Copertina

Learning in Spatial Branching: Limitations of Strong Branching Imitation

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	González-Rodríguez, Brais, Gómez-Casares, Ignacio, Ghaddar, Bissan, González-Díaz, Julio, Pateiro-López, Beatriz
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
di: Gómez-Casares, Ignacio, et al.
Pubblicazione: (2025)

Impact of domain reduction techniques in polynomial optimization: A computational study
di: Gómez-Casares, Ignacio, et al.
Pubblicazione: (2024)

Three Network Design Problems for Community Energy Storage
di: Ghaddar, Bissan, et al.
Pubblicazione: (2024)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
di: González-Díaz, Julio, et al.
Pubblicazione: (2025)

Extreme Strong Branching for QCQPs
di: Dey, Santanu S., et al.
Pubblicazione: (2025)

Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model
di: Mexi, Gioni, et al.
Pubblicazione: (2023)

Artificial Intelligence for Operations Research: Revolutionizing the Operations Research Process
di: Fan, Zhenan, et al.
Pubblicazione: (2024)

Data-Boosted Optimization for AC Optimal Power Flow: Interior-Point and Spatial Branching Methods
di: Repiso, Ignacio, et al.
Pubblicazione: (2025)

Degree reduction techniques for polynomial optimization problems
di: González-Rodríguez, Brais, et al.
Pubblicazione: (2024)

Improving Full Strong Branching Decisions by Incorporating Additional Information
di: Shah, Prachi, et al.
Pubblicazione: (2025)

Piecewise Linearization of Quadratic Branch Flow Limits by Irregular Polygon
di: Pareek, Parikshit, et al.
Pubblicazione: (2018)

Theoretical Challenges in Learning for Branch-and-Cut
di: Cheng, Hongyu, et al.
Pubblicazione: (2026)

An extension of an RLT-based solver to MINLP polynomial problems
di: González-Díaz, Julio, et al.
Pubblicazione: (2024)

Branch & Solve for Hub Location
di: Fernández, Elena, et al.
Pubblicazione: (2025)

The Branch-and-Bound Tree Closure
di: Roland, Marius, et al.
Pubblicazione: (2025)

On Branch-and-Price for Project Scheduling
di: Kolter, Maximilian, et al.
Pubblicazione: (2025)

Homotopy Continuation Enhanced Branch and Bound Algorithms for Strongly Nonconvex Mixed-Integer Nonlinear Programming Problems
di: Ma, Yingjie, et al.
Pubblicazione: (2021)

Branching Adaptive Surrogate Search Optimization (BASSO)
di: Maneekul, Pariyakorn, et al.
Pubblicazione: (2025)

Non-Monotonicity of Branching Rules with respect to Linear Relaxations
di: Shah, Prachi, et al.
Pubblicazione: (2024)

LLM4Branch: Large Language Model for Discovering Efficient Branching Policies of Integer Programs
di: Hou, Zhinan, et al.
Pubblicazione: (2026)

Branch-and-price strikes back for the k-vertex cut problem
di: Ciccarelli, Fabio, et al.
Pubblicazione: (2026)

Branch and price for nonlinear production-maintenance scheduling in complex machinery
di: Dionísio, João, et al.
Pubblicazione: (2025)

Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming
di: Cheng, Hongyu, et al.
Pubblicazione: (2025)

An Efficient Spatial Branch-and-Bound Algorithm for Global Optimization of Gaussian Process Posterior Mean Functions
di: Tang, Wei-Ting, et al.
Pubblicazione: (2026)

Heuristic Optimal Transport in Branching Networks
di: Andrecut, M.
Pubblicazione: (2023)

Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization
di: Peng, Zedong, et al.
Pubblicazione: (2025)

Efficient Branching Rules for Optimizing Range and Order-Based Objective Functions
di: van Rossum, Bart, et al.
Pubblicazione: (2023)

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming
di: Scavuzzo, Lara, et al.
Pubblicazione: (2024)

Speeding Up Mixed-Integer Programming Solvers with Sparse Learning for Branching
di: Bayramoğlu, Selin, et al.
Pubblicazione: (2026)

A Branch-and-Price Algorithm for the Electric Autonomous Dial-A-Ride Problem
di: Su, Yue, et al.
Pubblicazione: (2022)

A GPU-accelerated Nonlinear Branch-and-Bound Framework for Sparse Linear Models
di: Meng, Xiang, et al.
Pubblicazione: (2026)

An Alternating Primal Heuristic for Nonconvex MIQCQP with Dynamic Convexification and Parallel Local Branching
di: Dai, Yongzheng, et al.
Pubblicazione: (2026)

Optimal Control of McKean--Vlasov Branching Diffusion Processes
di: Claisse, Julien, et al.
Pubblicazione: (2025)

Learning Branching Policies for MILPs with Proximal Policy Optimization
di: Mhamed, Abdelouahed Ben, et al.
Pubblicazione: (2025)

A Branch and Bound Algorithm for Multiobjective Optimization Problems Using General Ordering Cones
di: Wu, Weitian, et al.
Pubblicazione: (2024)

Branch-and-bound for integer D-Optimality with fast local search and variable-bound tightening
di: Ponte, Gabriel, et al.
Pubblicazione: (2023)

Scalable Global Optimization for AC-OPF via Quadratic Convex Relaxation and Branch-and-Bound
di: Iranpour, Mohammadreza, et al.
Pubblicazione: (2025)

CORL: Reinforcement Learning of MILP Policies Solved via Branch and Bound
di: Anand, Akhil S, et al.
Pubblicazione: (2025)

Rethinking the Capacity of Graph Neural Networks for Branching Strategy
di: Chen, Ziang, et al.
Pubblicazione: (2024)

Branch and Price for the Length-Constrained Cycle Partition Problem
di: Ghannam, Mohammed, et al.
Pubblicazione: (2024)