The multiple disposal facilities and multiple inventory locations rollon–rolloff vehicle routing problem
- 30 September 2006
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 33 (9), 2667-2702
- https://doi.org/10.1016/j.cor.2005.02.023
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow FormulationOperations Research, 2004
- A new branch-and-cut algorithm for the capacitated vehicle routing problemMathematical Programming, 2004
- An Exact Algorithm for the Simplified Multiple Depot Crew Scheduling ProblemAnnals of Operations Research, 2004
- A new method for solving capacitated location problems based on a set partitioning approachComputers & Operations Research, 2002
- A Set Partitioning Approach to the Crew Scheduling ProblemOperations Research, 1999
- Optimal sequencing of skip collections and deliveriesJournal of the Operational Research Society, 1997
- A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxationsAnnals of Operations Research, 1995
- A set partitioning approach to the multiple depot vehicle scheduling problemOptimization Methods and Software, 1994
- Two exact algorithms for the distance‐constrained vehicle routing problemNetworks, 1984
- State‐space relaxation procedures for the computation of bounds to routing problemsNetworks, 1981