4 papers
Deep Learning for Data-Driven Districting-and-Routing
Arthur Ferraz, Cheikh Ahmed, Quentin Cappart +1
Districting-and-routing is a strategic problem aiming to aggregate basic geographical units (e.g., zip codes) into delivery districts. Its goal is to minimize the expected long-ter…
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…