Cover Image

The Branch-and-Bound Tree Closure

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Roland, Marius, Sugishita, Nagisa, Forel, Alexandre, Emine, Youssouf, Fukasawa, Ricardo, Vidal, Thibaut
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Free Lunch in the Forest: Functionally-Identical Pruning of Boosted Tree Ensembles
by: Emine, Youssouf, et al.
Published: (2024)

Adaptive Partitioning for Chance-Constrained Problems with Finite Support
by: Roland, Marius, et al.
Published: (2023)

Complexity of Bilevel Linear Programming with a Single Upper-Level Variable
by: Sugishita, Nagisa, et al.
Published: (2025)

Decision Problems in Multilevel Linear Programming
by: Sugishita, Nagisa, et al.
Published: (2026)

Price of Coupling in Multilevel Linear Programming
by: Sugishita, Nagisa, et al.
Published: (2026)

Don't Explain Noise: Robust Counterfactuals for Randomized Ensembles
by: Forel, Alexandre, et al.
Published: (2022)

The Strength of Flow Refueling Location Problem Formulations and an Extension to Cyclic Routing
by: Sugishita, Nagisa, et al.
Published: (2024)

DistrictNet: Decision-aware learning for geographical districting
by: Ahmed, Cheikh, et al.
Published: (2024)

Competitive EV charging station location with queues
by: Nguyen, The Minh, et al.
Published: (2025)

A Survey of Contextual Optimization Methods for Decision Making under Uncertainty
by: Sadana, Utsav, et al.
Published: (2023)

On vehicle routing problems with stochastic demands -- Generic disaggregated integer L-shaped formulations
by: Ota, Matheus J., et al.
Published: (2025)

On vehicle routing problems with stochastic demands -- Scenario-optimal recourse policies
by: Ota, Matheus J., et al.
Published: (2026)

The Differentiable Feasibility Pump
by: Cacciola, Matteo, et al.
Published: (2024)

Optimization by Directional Attacks: Solving Problems with Neural Network Surrogates
by: Bouchet, Pierre-Yves, et al.
Published: (2025)

Approximating value functions via corner Benders' cuts
by: Ota, Matheus J., et al.
Published: (2025)

Solving Two-Stage Stochastic Programs with Endogenous Uncertainty via Random Variable Transformation
by: Bazotte, Maria, et al.
Published: (2024)

Deep Learning for Data-Driven Districting-and-Routing
by: Ferraz, Arthur, et al.
Published: (2024)

Contextual Stochastic Vehicle Routing with Time Windows
by: Serrano, Breno, et al.
Published: (2024)

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

The XL Instances for the Capacitated Vehicle Routing Problem
by: Queiroga, Eduardo, et al.
Published: (2026)

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

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

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

Optimization-based Verification of Discrete-time Control Barrier Functions: A Branch-and-Bound Approach
by: Shakhesi, Erfan, et al.
Published: (2024)

PACE: Prune-And-Compress Ensemble Models
by: Akkerman, Fabian, et al.
Published: (2026)

Learning-based Online Optimization for Autonomous Mobility-on-Demand Fleet Control
by: Jungel, Kai, et al.
Published: (2023)

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

Non-linear Multi-objective Optimization with Probabilistic Branch and Bound
by: Huang, Hao, et al.
Published: (2025)

Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
by: Costandin, Marius, et al.
Published: (2023)

Two-Stage Stochastic Capacity Expansion in Stable Matching under Truthful or Strategic Preference Uncertainty
by: Bazotte, Maria, et al.
Published: (2025)

Learning in Spatial Branching: Limitations of Strong Branching Imitation
by: González-Rodríguez, Brais, et al.
Published: (2024)

Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion
by: Bertsimas, Dimitris, et al.
Published: (2023)

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

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
by: Encz, Koppány István, et al.
Published: (2025)

Green Scheduling with Time-of-Use Tariffs and Machine States: Optimizing Energy Cost via Branch-and-Bound and Bin Packing Strategies
by: Benedikt, Ondřej, et al.
Published: (2025)

Combinatorial Optimization and Machine Learning for Dynamic Inventory Routing
by: Greif, Toni, et al.
Published: (2024)

Dynamic Range Reduction via Branch-and-Bound
by: Gerlach, Thore, et al.
Published: (2024)

A New Branch-and-Bound Pruning Framework for $\ell_0$-Regularized Problems
by: Guyard, Theo, et al.
Published: (2024)

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

Approximation of Singular-Stopping Control Driven by Hawkes Processes via Rescaled MDPs
by: Agostino, Isabel, et al.
Published: (2026)