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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical programming computation Jg. 9; H. 1; S. 61 - 100
Hauptverfasser:	Pecin, Diego, Pessoa, Artur, Poggi, Marcus, Uchoa, Eduardo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2017 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!