A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 332-339
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An effective PSO-inspired algorithm for the team orienteering problemEuropean Journal of Operational Research, 2013
- Subgraph extraction and metaheuristics for the maximum clique problemJournal of Heuristics, 2012
- Metaheuristics for Tourist Trip Planning2009
- An exact algorithm for team orienteering problems4OR, 2006
- A TABU search heuristic for the team orienteering problemComputers & Operations Research, 2005
- An optimal solution procedure for the multiple tour maximum collection problem using column generationComputers & Operations Research, 1999
- Solving the Orienteering Problem through Branch-and-CutINFORMS Journal on Computing, 1998
- The team orienteering problemEuropean Journal of Operational Research, 1996