Showing 2026 · math.OCShow all
2 papers · 2 filters
math.OC2026
Learning to reoptimize: a GNN-aided fix-and-optimize approach and an application to the Lot Sizing problem
Mathieu Lerouge, Andrea Lodi, Enrico Malaguti +2
In many operational contexts, solutions to NP-hard combinatorial optimization problems, modeled by means of Mixed-Integer Linear Programming (MILP), may become infeasible due to un…
math.OC2026
Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes
Bart van Rossum, Rui Chen, Andrea Lodi
We study the fair capacitated vehicle routing problem, in which a fleet of vehicles must serve a set of customers such that the difference between the longest and shortest route, t…