Branch-and-check approaches for the tourist trip design problem with rich constraints
From MaRDI portal
Publication:2669676
DOI10.1016/J.COR.2021.105566OpenAlexW3203266107MaRDI QIDQ2669676
Yannick Kergosien, Pierre Desport, Duc Minh Vu, Jorge E. Mendoza
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105566
Related Items (1)
Cites Work
- Unnamed Item
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Heuristics for the time dependent team orienteering problem: application to tourist route planning
- The orienteering problem: a survey
- Heuristics for the multi-period orienteering problem with multiple time windows
- Variable neighborhood search
- Local branching
- A branch-and-check approach for a wind turbine maintenance scheduling problem
- A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints
- Bi-objective orienteering for personal activity scheduling
- A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach
- Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
This page was built for publication: Branch-and-check approaches for the tourist trip design problem with rich constraints
