A branch-and-cut algorithm for the profitable windy rural postman problem
| Year of publication: |
2016
|
|---|---|
| Authors: | Ávila, Thais ; Corberán, Ángel ; Plana, Isaac ; Sanchis, José M. |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 249.2016, 3 (16.3.), p. 1092-1101
|
| Subject: | Windy rural postman problem | Arc routing | Profits | Branch-and-cut algorithm | Polyhedron | Tourenplanung | Vehicle routing problem | Theorie | Theory | Algorithmus | Algorithm |
-
A hybrid heuristic procedure for the Windy Rural Postman Problem with Zigzag Time Windows
Lum, Oliver, (2017)
-
Karaoğlan, Ismail, (2017)
-
Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times
Cacchiani, Valentina, (2020)
- More ...
-
Ávila, Thais, (2017)
-
A new branch-and-cut algorithm for the generalized directed rural postman problem
Ávila, Thais, (2016)
-
A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem
Corberán, Ángel, (2019)
- More ...