A branch-and-cut algorithm for the orienteering arc routing problem
Year of publication: |
2016
|
---|---|
Authors: | Archetti, Claudia ; Corberán, Ángel ; Plana, Isaac ; Sanchis, José M. ; Speranza, Maria Grazia |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 66.2016, p. 95-104
|
Subject: | Orienteering Arc Routing Problem | Routing problems with profits | Branch-and-cut | Tourenplanung | Vehicle routing problem | Ganzzahlige Optimierung | Integer programming | USA | United States | Theorie | Theory | Algorithmus | Algorithm |
-
The clustered orienteering problem
Angelelli, E., (2014)
-
A three-front parallel branch-and-cut algorithm for production and inventory routing problems
Schenekemberg, Cleder M., (2022)
-
Asghari, Mohammad, (2020)
- More ...
-
The team orienteering arc routing problem
Archetti, Claudia, (2014)
-
A matheuristic for the team orienteering arc routing problem
Archetti, Claudia, (2015)
-
A branch-and-cut algorithm for the profitable windy rural postman problem
Ávila, Thais, (2016)
- More ...