IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v49y2001i1p163-168.html
   My bibliography  Save this article

Scheduling a Major College Basketball Conference---Revisited

Author

Listed:
  • Martin Henz

    (School of Computing, National University of Singapore, Singapore 117543)

Abstract

Nemhauser and Trick presented the problem of finding a timetable for the 1997/1998 Atlantic Coast Conference (ACC) in basketball. Their solution, found with a combination of integer programming and exhaustive enumeration, was accepted by the ACC.Finite-domain constraint programming is another programming technique that can be used for solving combinatorial search problems such as sports tournament scheduling. This paper presents a solution of round-robin tournament planning based on finite-domain constraint programming. The approach yields a dramatic performance improvement, which makes an integrated interactive software solution feasible.

Suggested Citation

  • Martin Henz, 2001. "Scheduling a Major College Basketball Conference---Revisited," Operations Research, INFORMS, vol. 49(1), pages 163-168, February.
    • Handle: RePEc:inm:oropre:v:49:y:2001:i:1:p:163-168
    DOI: 10.1287/opre.49.1.163.11193
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.49.1.163.11193
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.49.1.163.11193?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. George L. Nemhauser & Michael A. Trick, 1998. "Scheduling A Major College Basketball Conference," Operations Research, INFORMS, vol. 46(1), pages 1-8, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Carlsson, Mats & Johansson, Mikael & Larson, Jeffrey, 2017. "Scheduling double round-robin tournaments with divisional play using constraint programming," European Journal of Operational Research, Elsevier, vol. 259(3), pages 1180-1190.
    2. Ribeiro, Celso C. & Urrutia, Sebastian, 2007. "Heuristics for the mirrored traveling tournament problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 775-787, June.
    3. Rasmussen, Rasmus V. & Trick, Michael A., 2008. "Round robin scheduling - a survey," European Journal of Operational Research, Elsevier, vol. 188(3), pages 617-636, August.
    4. Rasmussen, Rasmus V., 2008. "Scheduling a triple round robin tournament for the best Danish soccer league," European Journal of Operational Research, Elsevier, vol. 185(2), pages 795-810, March.
    5. Drexl, Andreas & Knust, Sigrid, 2007. "Sports league scheduling: Graph- and resource-based models," Omega, Elsevier, vol. 35(5), pages 465-471, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Russell, Robert A. & Urban, Timothy L., 2010. "Multicriteria models for planning power-networking events," European Journal of Operational Research, Elsevier, vol. 207(1), pages 83-91, November.
    2. van Doornmalen, Jasper & Hojny, Christopher & Lambers, Roel & Spieksma, Frits C.R., 2023. "Integer programming models for round robin tournaments," European Journal of Operational Research, Elsevier, vol. 310(1), pages 24-33.
    3. Henz, Martin & Muller, Tobias & Thiel, Sven, 2004. "Global constraints for round robin tournament scheduling," European Journal of Operational Research, Elsevier, vol. 153(1), pages 92-101, February.
    4. Rasmussen, Rasmus V., 2008. "Scheduling a triple round robin tournament for the best Danish soccer league," European Journal of Operational Research, Elsevier, vol. 185(2), pages 795-810, March.
    5. Lim, A. & Rodrigues, B. & Zhang, X., 2006. "A simulated annealing and hill-climbing algorithm for the traveling tournament problem," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1459-1478, November.
    6. Urban, Timothy L. & Russell, Robert A., 2003. "Scheduling sports competitions on multiple venues," European Journal of Operational Research, Elsevier, vol. 148(2), pages 302-311, July.
    7. Özlü, Oğuzhan & Sokol, Joel, 2016. "An optimization approach to designing a baseball scout network," European Journal of Operational Research, Elsevier, vol. 255(3), pages 948-960.
    8. Drexl, Andreas & Knust, Sigrid, 2007. "Sports league scheduling: Graph- and resource-based models," Omega, Elsevier, vol. 35(5), pages 465-471, October.
    9. Van Bulck, David & Goossens, Dries & Clarner, Jan-Patrick & Dimitsas, Angelos & Fonseca, George H.G. & Lamas-Fernandez, Carlos & Lester, Martin Mariusz & Pedersen, Jaap & Phillips, Antony E. & Rosati,, 2024. "Which algorithm to select in sports timetabling?," European Journal of Operational Research, Elsevier, vol. 318(2), pages 575-591.
    10. Rasmussen, Rasmus V. & Trick, Michael A., 2007. "A Benders approach for the constrained minimum break problem," European Journal of Operational Research, Elsevier, vol. 177(1), pages 198-213, February.
    11. Lim, A. & Rodrigues, B. & Zhang, X., 2006. "Scheduling sports competitions at multiple venues--Revisited," European Journal of Operational Research, Elsevier, vol. 175(1), pages 171-186, November.
    12. Schonberger, J. & Mattfeld, D. C. & Kopfer, H., 2004. "Memetic Algorithm timetabling for non-commercial sport leagues," European Journal of Operational Research, Elsevier, vol. 153(1), pages 102-116, February.
    13. Van Bulck, David & Goossens, Dries, 2023. "The international timetabling competition on sports timetabling (ITC2021)," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1249-1267.
    14. Van Bulck, David & Goossens, Dries, 2023. "A traditional Benders’ approach to sports timetabling," European Journal of Operational Research, Elsevier, vol. 307(2), pages 813-826.
    15. Ribeiro, Celso C. & Urrutia, Sebastian, 2007. "Heuristics for the mirrored traveling tournament problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 775-787, June.
    16. Durán, Guillermo & Durán, Santiago & Marenco, Javier & Mascialino, Federico & Rey, Pablo A., 2019. "Scheduling Argentina’s professional basketball leagues: A variation on the Travelling Tournament Problem," European Journal of Operational Research, Elsevier, vol. 275(3), pages 1126-1138.
    17. Rasmussen, Rasmus V. & Trick, Michael A., 2008. "Round robin scheduling - a survey," European Journal of Operational Research, Elsevier, vol. 188(3), pages 617-636, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:49:y:2001:i:1:p:163-168. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.