Branch-and-cut algorithms for the split delivery vehicle routing problem

DOI10.1016/j.ejor.2014.04.026zbMath1338.90042MaRDI QIDQ296858

F. Blanchet-Sadri, M. Dambrine

Publication date: 23 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.026

zbMATH Keywords

branch-and-cut; split delivery vehicle routing problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B06: Transportation, logistics and supply chain management

Uses Software

• VRP
• MAXFLOW