Formulations for the orienteering problem with additional constraints
DOI10.1007/s10479-017-2408-4zbMath1381.90020OpenAlexW2584814407MaRDI QIDQ1686508
Víctor M. Albornoz, Pamela J. Palomo-Martínez, M. Angélica Salazar-Aguilar
Publication date: 15 December 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2408-4
exclusionary constraintsorienteering problemsubtour elimination constraintsselective traveling salesman problem
Mixed integer programming (90C11) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
- Orienteering problem: a survey of recent variants, solution approaches and applications
- The multi-district team orienteering problem
- Routing problems with loading constraints
- The orienteering problem: a survey
- Heuristics for the multi-period orienteering problem with multiple time windows
- Iterated local search for the team orienteering problem with time windows
- The selective travelling salesman problem
- Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling
- The attractive traveling salesman problem
- The team orienteering problem
- A heuristic for the multiple tour maximum collection problem
- A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints
- A TABU search heuristic for the team orienteering problem
- Optimal solutions for routing problems with profits
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- An exact algorithm for team orienteering problems
- Classification, models and exact algorithms for multi-compartment delivery problems
- Integer Programming Formulation of Traveling Salesman Problems
- A New Formulation for the Travelling Salesman Problem
- The orienteering problem
- AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
- The Orienteering Problem with Time Windows
- Solving the Orienteering Problem through Branch-and-Cut
- Solution of a Large-Scale Traveling-Salesman Problem
This page was built for publication: Formulations for the orienteering problem with additional constraints
