The demand weighted vehicle routing problem
type: Item
instance of: scholarly article
title: The demand weighted vehicle routing problem
zbMATH Open document ID: 1403.90090
author: Jeffrey D. Camm
author: Saravanan Kuppusamy
author: Michael Magazine
author: Kipp Martin
published in: European Journal of Operational Research
publication date: 2018-05-30T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6876511
zbMATH Keywords: vehicle routing
zbMATH Keywords: column generation
zbMATH Keywords: dynamic programming
zbMATH Keywords: integer programming
zbMATH Keywords: COIN-OR
cites work: COIN-OR
cites work: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
cites work: An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
cites work: Exact algorithms for routing problems under vehicle capacity constraints
cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
cites work: The dial-a-ride problem (DARP): variants, modeling issues and algorithms
cites work: Q4532229
cites work: Decomposition Principle for Linear Programs
cites work: Optimal Integer Solutions to Industrial Cutting Stock Problems
cites work: Q4955266
cites work: Column Generation
cites work: The pickup and delivery problem with time windows
cites work: The Delivery Man Problem and Cumulative Matroids
cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem
cites work: Q5613011
cites work: Gainfree Leontief substitution flow problems
cites work: On Semidefinite Programming Relaxations of the Traveling Salesman Problem
cites work: Q4077718
cites work: Projection results for vehicle routing
cites work: Q3677502
cites work: An effective memetic algorithm for the cumulative capacitated vehicle routing problem
cites work: Relaxation and decomposition methods for mixed integer nonlinear programming.
cites work: The school bus routing problem: a review
cites work: Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
cites work: On the capacitated vehicle routing problem
cites work: Semidefinite Relaxations for Integer Programming
cites work: A simple and effective metaheuristic for the minimum latency problem
cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
cites work: The vehicle routing problem
cites work: A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
cites work: Semidefinite programming relaxations for the quadratic assignment problem
describes a project that uses: COIN-OR
describes a project that uses: Bonmin
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.03.033
OpenAlex ID: W2551686796
DOI: 10.1016/J.EJOR.2017.03.033
Recommended article: The vehicle routing problem with demand range
Recommended article: Q3204336
Recommended article: The vehicle routing problem
Recommended article: The driver and vehicle routing problem
Recommended article: Q3517048
Recommended article: A Vehicle Routing Problem with Stochastic Demand
Recommended article: Vehicle routing problem considering equity of demand satisfaction
Recommended article: Algorithms and Data Structures
Recommended article: On the vehicle routing problem
description: scientific article; zbMATH DE number 6876511