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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming computation Ročník 9; číslo 1; s. 61 - 100
Hlavní autoři:	Pecin, Diego, Pessoa, Artur, Poggi, Marcus, Uchoa, Eduardo
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2017 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!