The demand weighted vehicle routing problem
From MaRDI portal
Publication:1754023
DOI10.1016/j.ejor.2017.03.033zbMath1403.90090OpenAlexW2551686796MaRDI QIDQ1754023
Jeffrey D. Camm, Saravanan Kuppusamy, Michael J. Magazine, R. Kipp Martin
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.03.033
Programming involving graphs or networks (90C35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- COIN-OR
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Exact algorithms for routing problems under vehicle capacity constraints
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- The school bus routing problem: a review
- The pickup and delivery problem with time windows
- Semidefinite programming relaxations for the quadratic assignment problem
- On the capacitated vehicle routing problem
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- Gainfree Leontief substitution flow problems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A simple and effective metaheuristic for the minimum latency problem
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Projection results for vehicle routing
- The Vehicle Routing Problem
- Decomposition Principle for Linear Programs
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- Semidefinite Relaxations for Integer Programming
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- The Delivery Man Problem and Cumulative Matroids
- Optimal Integer Solutions to Industrial Cutting Stock Problems
- A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
- Column Generation
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
