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 | Fluggesellschaft | Airline | Tourismus | Tourism | Urlaubsverhalten | Holiday behaviour | Graphentheorie | Graph theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | USA | United States | Theorie | Theory |
-
The 3 [three]-interchange graph and the symmetric traveling salesman polytope
Stam, T., (1989)
-
The capacitated family traveling salesperson problem
Domínguez-Casasola, Saúl, (2024)
-
The bi-objective traveling purchaser problem with deliveries
Palomo-Martínez, Pamela J., (2019)
- More ...
-
Road-based goods transportation : a survey of real-world logistics applications from 2000 to 2015
Coelho, Leandro C., (2016)
-
Solving the vehicle routing problem with lunch break arising in the furniture delivery industry
Coelho, Leandro C., (2016)
-
Integrated production-distribution systems: trends and perspectives
Darvish, Maryam, (2021)
- More ...