Skip to main content
SpringerLink
Log in

The Traveling Tournament Problem Description and Benchmarks

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming — CP 2001 (CP 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2239))

Abstract

The Traveling Tournament Problem is a sports timetabling problem that abstracts two issues in creating timetables:home/away pattern feasibility and team travel. Instances of this problem seem to be very dificult even for a very small number of teams,making it an interesting challenge for combinatorial optimization techniques such as integer programming and constraint programming. We introduce the problem, describe one way of modeling it,and give some interesting classes of instances with base computational results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Applegate, D.R. Bixby, V. Chvatal,and W. Cook.1998. “On the solution of traveling salesman problems”, Documenta Mathematica Journal der Deutschen Mathematiker-Verinigung International Congress of Mathemeticians,645–656.

    Google Scholar 

  2. Barnhart, C., E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh,and P.H. Vance. 1998. “Branch-and-Price:Column Generation for Huge Integer Programs”, Operations Research 46:3,316–329.

    Article  MathSciNet  Google Scholar 

  3. Benoist, T.,F. Laburthe,and B. Rottembourg, 2001. “Lagrange relaxation and constraint programming collaborative schemes for traveling tournament problems”, CPAI-OR,Wye College,UK,15–26.

    Google Scholar 

  4. Campbell, R.T.,and D.S. Chen,1976. “A Minimum Distances Basketball Scheduling Problem”, in Optimal Strategies in Sports, S.P. Ladany and R.E Machol (eds.), North-Holland, Amsterdam, 32–41.

    Google Scholar 

  5. Henz, M.2001. “Scheduling a Major College Basketball Conference:Revisted”,Operations Research,49:1,.

    Article  MathSciNet  Google Scholar 

  6. Nemhauser, G.L. and M.A. Trick.1998. “Scheduling a Major College Basketball Conference”, Operations Research, 46, 1–8.

    Google Scholar 

  7. Russell, R.A. and J.M Leung.1994. “Devising a cost efective schedule for a baseball league”, Operations Research 42, 614–625.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Industrial and Systems Engineering Georgia Institute of Technology, 30332, Atlanta, Georgia, USA

    Kelly Easton & George Nemhauser

  2. Graduate School of Industrial Administration Carnegie Mellon, 15213, Pittsburgh, PA, USA

    Michael Trick

Authors
  1. Kelly Easton
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. George Nemhauser
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael Trick
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of York, YO10 5DD, Heslington, York, UK

    Toby Walsh

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Easton, K., Nemhauser, G., Trick, M. (2001). The Traveling Tournament Problem Description and Benchmarks. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-45578-7_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42863-3

  • Online ISBN: 978-3-540-45578-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation