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 | Ganzzahlige Optimierung | Integer programming |
-
Karaoğlan, Ismail, (2017)
-
Two-phase branch-and-cut for the mixed capacitated general routing problem
Irnich, Stefan, (2015)
-
Bektaş, Tolga, (2019)
- More ...
-
A new branch-and-cut algorithm for the generalized directed rural postman problem
Ávila, Thais, (2016)
-
Ávila, Thais, (2017)
-
A branch-and-cut algorithm for the orienteering arc routing problem
Archetti, Claudia, (2016)
- More ...