3 papers
math.OC2025
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…
cs.LG2024
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…
math.OC2024
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…