3 papers
math.OC2025
Representability of forests via generalized subtour elimination constraints
Matheus J. Ota
Generalized subtour elimination constraints (GSECs) are widely used in state-of-the-art exact algorithms for vehicle routing and network design problems, as their right-hand sides…
math.OC2025
On vehicle routing problems with stochastic demands -- Generic disaggregated integer L-shaped formulations
Matheus J. Ota, Ricardo Fukasawa
We study the vehicle routing problem with stochastic demands (VRPSD), an important variant of the classical capacitated vehicle routing problem in which customer demands are modele…
math.OC2025
Approximating value functions via corner Benders' cuts
Matheus J. Ota, Ricardo Fukasawa, Aleksandr M. Kazachkov
We introduce a novel technique to generate Benders' cuts from a conic relaxation ("corner") derived from a basis of a higher-dimensional polyhedron that we aim to outer approximate…