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 | Ganzzahlige Optimierung | Integer programming | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Theorie | Theory |
-
Sun, Peter, (2014)
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
-
The circlet inequalities : a new, circulant-based, facet-defining inequality for the TSP
Gutekunst, Samuel C., (2023)
- 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 ...