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)
-
Neamatian Monemi, Rahimeh, (2025)
-
Generating subtour elimination constraints for the TSP from pure integer solutions
Pferschy, Ulrich, (2017)
- More ...
-
Integrated production-distribution systems: trends and perspectives
Darvish, Maryam, (2021)
-
The time-dependent shortest path and vehicle routing problem
Jaballah, Rabie, (2021)
-
Silva, Allyson, (2021)
- More ...