Comparative analysis of capacitated arc routing formulations for designing a new branch-cut-and-price algorithm
Year of publication: |
2019
|
---|---|
Authors: | Pecin, Diego ; Uchoa, Eduardo |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 53.2019, 6, p. 1673-1694
|
Subject: | integer programming | column generation | cut separation | algorithmic engineering | Theorie | Theory | Tourenplanung | Vehicle routing problem | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
A branch-and-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
Santos, Fernando Afonso, (2015)
-
A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection
Barbosa, Luiz Henrique, (2020)
-
Models and algorithms for combinatorial optimization problems arising in railway applications
Cacchiani, Valentina, (2009)
- More ...
-
Limited memory rank-1 cuts for vehicle routing problems
Pecin, Diego, (2017)
-
New enhancements for the exact solution of the vehicle routing problem with time windows
Pecin, Diego, (2017)
-
New benchmark instances for the capacitated vehicle routing problem
Uchoa, Eduardo, (2017)
- More ...