Integer programming formulations for the multi-depot vehicle routing problem: Comments on a paper by Kulkarni and Bhave

DOI10.1016/0377-2217(89)90107-0zbMath0709.90610OpenAlexW2008632704MaRDI QIDQ922344

Gilbert Laporte

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90107-0

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items

Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints ⋮ A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem ⋮ Integer linear programming formulations of multiple salesman problems and its variations

Cites Work

• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• Implementing vehicle routing algorithms