Improved branch-cut-and-price for capacitated vehicle routing

The best performing exact algorithms for the capacitated vehicle routing problem developed in the last 10 years are based in the combination of cut and column generation. Some authors only used cuts expressed over the variables of the original formulation, in order to keep the pricing subproblem rel...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming computation Vol. 9; no. 1; pp. 61 - 100
Main Authors:	Pecin, Diego, Pessoa, Artur, Poggi, Marcus, Uchoa, Eduardo
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2017 Springer Nature B.V
Subjects:	Algorithms Customers Enumeration Full Length Paper Heuristic methods Mathematics Mathematics and Statistics Mathematics of Computing Operations Research/Decision Theory Optimization Pricing Route planning Routing Theory of Computation Vehicle routing Integer programming Column generation Cut separation 90C10 Integer programming 90C39 Dynamic programming branch-and-cut 90C57 Polyhedral combinatorics branch-and-bound Algorithmic engineering
ISSN:	1867-2949, 1867-2957
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!