5 papers
The Branch-and-Bound Tree Closure
Marius Roland, Nagisa Sugishita, Alexandre Forel +3
This paper investigates the a-posteriori analysis of Branch-and-Bound~(BB) trees to extract structural information about the feasible region of mixed-binary linear programs. We int…
Free Lunch in the Forest: Functionally-Identical Pruning of Boosted Tree Ensembles
Youssouf Emine, Alexandre Forel, Idriss Malek +1
Tree ensembles, including boosting methods, are highly effective and widely used for tabular data. However, large ensembles lack interpretability and require longer inference times…
DistrictNet: Decision-aware learning for geographical districting
Cheikh Ahmed, Alexandre Forel, Axel Parmentier +1
Districting is a complex combinatorial problem that consists in partitioning a geographical area into small districts. In logistics, it is a major strategic decision determining op…
Adaptive Partitioning for Chance-Constrained Problems with Finite Support
Marius Roland, Alexandre Forel, Thibaut Vidal
This paper studies chance-constrained stochastic optimization problems with finite support. It presents an iterative method that solves reduced-size chance-constrained models obtai…
The Differentiable Feasibility Pump
Matteo Cacciola, Alexandre Forel, Antonio Frangioni +1
Although nearly 20 years have passed since its conception, the feasibility pump algorithm remains a widely used heuristic to find feasible primal solutions to mixed-integer linear…