An approximation algorithm for the traveling tournament problem
- 23 April 2010
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 194 (1) , 317-324
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Round robin scheduling – a surveyEuropean Journal of Operational Research, 2008
- Constructive Algorithms for the Constant Distance Traveling Tournament Problem2007
- A Benders approach for the constrained minimum break problemEuropean Journal of Operational Research, 2007
- A simulated annealing approach to the traveling tournament problemJournal of Scheduling, 2006
- Traveling Tournament Scheduling: A Systematic Evaluation of Simulated AnneallingLecture Notes in Computer Science, 2006
- On the complexity of the k-customer vehicle routing problemOperations Research Letters, 2005
- The Traveling Tournament Problem Description and Benchmarks2001
- Randomized Algorithms1995
- Bounds and Heuristics for Capacitated Routing ProblemsMathematics of Operations Research, 1985
- Complexity of vehicle routing and scheduling problemsNetworks, 1981