Minimizing user inconvenience and operational costs in a dial-a-flight problem for flying safaris
Year of publication: |
2023
|
---|---|
Authors: | Cordeau, Jean-François ; Iori, Manuel ; Mendes, Nilson F. M. ; Nelli, Davide ; Tedeschi, Riccardo |
Published in: |
INFOR : information systems and operational research. - Abingdon : Taylor & Francis Group, ISSN 1916-0615, ZDB-ID 1468358-1. - Vol. 61.2023, 1, p. 104-140
|
Subject: | adaptive large neighborhood search | Dial-a-flight problem | safari | set partitioning |
-
Hidden economic counterflows in post-COVID international wildlife tourism
Buckley, Ralf, (2022)
-
An employee transporting problem
Yüceer, Ümit, (2013)
-
An exact algorithm for the vehicle and crew scheduling problem
Friberg, Christian, (1996)
- More ...
-
Delorme, Maxence, (2021)
-
A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks
Alba Martínez, Manuel A., (2013)
-
A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
Martínez, Manuel A. Alba, (2013)
- More ...