A branch-and-cut algorithm for the multidepot rural postman problem
Year of publication: |
March-April 2018
|
---|---|
Authors: | Fernández, Elena ; Laporte, Gilbert ; Rodríguez-Pereira, Jessica |
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. 52.2018, 2, p. 353-369
|
Subject: | arc routing | multi-depot rural postman problem | worst-case analysis | polyhedral analysis | branch-and-cut | Tourenplanung | Vehicle routing problem | Theorie | Theory | Algorithmus | Algorithm |
-
The hierarchical mixed rural postman problem : polyhedral analysis and a branch-and-cut algorithm
Colombi, Marco, (2017)
-
Multi-depot rural postman problems
Fernández, Elena, (2017)
-
GRASP with evolutionary path-relinking for the capacitated arc routing problem
Usberti, Fábio Luiz, (2013)
- More ...
-
Exact solution of several families of location-arc routing problems
Fernández, Elena, (2019)
-
The Steiner Traveling Salesman Problem and its extensions
Rodríguez-Pereira, Jessica, (2019)
-
Multi-depot rural postman problems
Fernández, Elena, (2017)
- More ...