Integer programming formulations of vehicle routing problems
- 1 April 1985
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 20 (1) , 58-67
- https://doi.org/10.1016/0377-2217(85)90284-x
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Complexity of vehicle routing and scheduling problemsNetworks, 1981
- Combinatorial optimization and vehicle fleet planning: Perspectives and prospectsNetworks, 1981
- A Survey of Local Delivery Vehicle Routing MethodologyJournal of the Operational Research Society, 1979
- Implementing vehicle routing algorithmsNetworks, 1977
- Some Simple Applications of the Travelling Salesman ProblemJournal of the Operational Research Society, 1975
- Transformation of Multisalesman Problem to the Standard Traveling Salesman ProblemJournal of the ACM, 1974
- Routing a fleet of M vehicles to/from a central facilityNetworks, 1974
- An Algorithm for the Vehicle-dispatching ProblemJournal of the Operational Research Society, 1969
- Direct search algorithms for truck-dispatching problemsTransportation Research, 1969
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960