The demand weighted vehicle routing problem
Authors:
- Jeffrey D. CammJCJeffrey D. Camm
- Michael J. MagazineMMMichael J. Magazine
- Saravanan KuppusamySKSaravanan Kuppusamy
- Kipp MartinKMKipp Martin
- 1 October 2017
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 262 (1) , 151-162
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Exact algorithms for routing problems under vehicle capacity constraintsAnnals of Operations Research, 2009
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR methodDiscrete Applied Mathematics, 2009
- Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time WindowsTransportation Science, 2008
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cutsMathematical Programming, 2007
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow FormulationOperations Research, 2004
- The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms4OR, 2003
- Optimal Integer Solutions to Industrial Cutting Stock ProblemsINFORMS Journal on Computing, 1999
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxationsMathematical Programming, 1981
- Decomposition Principle for Linear ProgramsOperations Research, 1960