Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
Year of publication: |
September 2017
|
---|---|
Authors: | Ávila, Thais ; Corberán, Ángel ; Plana, Isaac ; Sanchis, José M. |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 5.2017, 3, p. 339-365
|
Subject: | Distance constrained | Multivehicle | Generalized directed rural postman problem | Close-enough arc routing problem | Branch-and-cut | Theorie | Theory | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming |
-
A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem
Corberán, Ángel, (2019)
-
The min-max close-enough arc routing problem
Bianchessi, Nicola, (2022)
-
Adulyasak, Yossiri, (2014)
- More ...
-
A branch-and-cut algorithm for the profitable windy rural postman problem
Ávila, Thais, (2016)
-
A new branch-and-cut algorithm for the generalized directed rural postman problem
Ávila, Thais, (2016)
-
A branch-and-cut algorithm for the orienteering arc routing problem
Archetti, Claudia, (2016)
- More ...