2 citations · 2 across the 7 of their papers we have counts for
4 papers · 1 filter
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…
Combinatorial Optimization and Machine Learning for Dynamic Inventory Routing
Toni Greif, Louis Bouvier, Christoph M. Flath +3
We introduce a combinatorial optimization-enriched machine learning pipeline and a novel learning paradigm to solve inventory routing problems with stochastic demand and dynamic in…
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…
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…