The Traveling Backpacker Problem : a computational comparison of two formulations
Year of publication: |
2018
|
---|---|
Authors: | Nakamura, Kátia Y. ; Coelho, Leandro C. ; Renaud, Jacques ; Nascimento, Mariá C. V. |
Published in: |
Journal of the Operational Research Society. - London : Taylor and Francis, ISSN 1476-9360, ZDB-ID 2007775-0. - Vol. 69.2018, 1, p. 108-114
|
Subject: | Low-cost airlines | backpacking | exact method | travelling salesman problem | graph theory | Tourenplanung | Vehicle routing problem | Graphentheorie | Graph theory | Rundreiseproblem | Travelling salesman problem | Fluggesellschaft | Airline |
-
Becker, Kai Helge, (2015)
-
Cornuéjols, Gerard, (1981)
-
An LP-based 2/3-approximation algorithm for the s-t path graph traveling salesman problem
Gao, Zhihan, (2013)
- More ...
-
Measuring fuel consumption in vehicle routing : new estimation models using supervised learning
Heni, Hamza, (2023)
-
The impact of time aggregation and travel time models on time-dependent routing solutions
Jaballah, Rabie, (2023)
-
A parallel variable neighborhood search for α-neighbor facility location problems
Chagas, Guilherme O., (2023)
- More ...