The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time

•New mathematical models for the Capacitated Vehicle Routing Problem.•Lower bounds computable in pseudo-polynomial time.•Column-generation technique to solve vehicle routing problems with capacity constraints. The Capacitated Vehicle Routing Problem (CVRP) is a classic combinatorial optimization pro...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 272; no. 1; pp. 24 - 31
Main Authors:	Letchford, Adam N., Salazar-González, Juan-José
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.01.2019
Subjects:	Column generation Integer programming Vehicle routing Integer programming Vehicle routing Column generation
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!