IDEAS home Printed from https://ideas.repec.org/a/bpj/jqsprt/v5y2009i2n10.html
   My bibliography  Save this article

Scramble Teams for the Pinehurst Terrapin Classic

Author

Listed:
  • Ball Michael O

    (University of Maryland - College Park)

  • Halper Russell

    (University of Maryland - College Park)

Abstract

The Pinehurst Terrapin Classic (PTC) is a five day, 16 player, annual golf tournament that includes match-play and scramble rounds. Pairings must be created for each day of the tournament that ensure each pair of participants play on the same team at least once during the tournament, and ensure that the teams for each scramble round are of comparable ability. Over the past four years, both a simple interactive, spreadsheet-based heuristic and an integer programming model have been developed to create the pairings. These both rely on very special properties of the structure of this tournament. In this paper, we describe this structure, the methods used to create the pairings and the experience with the use of these methods over the most recent years.

Suggested Citation

  • Ball Michael O & Halper Russell, 2009. "Scramble Teams for the Pinehurst Terrapin Classic," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 5(2), pages 1-25, May.
    • Handle: RePEc:bpj:jqsprt:v:5:y:2009:i:2:n:10
    DOI: 10.2202/1559-0410.1180
    as

    Download full text from publisher

    File URL: https://doi.org/10.2202/1559-0410.1180
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.
    File URL: https://libkey.io/10.2202/1559-0410.1180?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. W. J. Hurley, 2002. "How Should Team Captains Order Golfers on the Final Day of the Ryder Cup Matches?," Interfaces, INFORMS, vol. 32(2), pages 74-77, April.
    2. Rex Cutshall & Srinagesh Gavirneni & Kenneth Schultz, 2007. "Indiana University’s Kelley School of Business Uses Integer Programming to Form Equitable, Cohesive Student Teams," Interfaces, INFORMS, vol. 37(3), pages 265-276, June.
    3. Hurley William J, 2007. "The Ryder Cup: Are Balanced Four-Ball Pairings Optimal?," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 3(4), pages 1-20, October.
    4. de Werra, D., 1997. "The combinatorics of timetabling," European Journal of Operational Research, Elsevier, vol. 96(3), pages 504-513, February.
    5. 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.
    6. Ken Darby-Dowman & James Little, 1998. "Properties of Some Combinatorial Optimization Problems and Their Effect on the Performance of Integer Programming and Constraint Logic Programming," INFORMS Journal on Computing, INFORMS, vol. 10(3), pages 276-286, August.
    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. Grasman Scott E. & Thomas Barrett W., 2013. "Scrambled experts: team handicaps and win probabilities for golf scrambles," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 9(3), pages 217-227, September.

    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. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    2. John N. Hooker, 2002. "Logic, Optimization, and Constraint Programming," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 295-321, November.
    3. 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.
    4. Nahid Rezaeinia & Julio César Góez & Mario Guajardo, 2022. "Efficiency and fairness criteria in the assignment of students to projects," Annals of Operations Research, Springer, vol. 319(2), pages 1717-1735, December.
    5. Briskorn, Dirk & Horbach, Andrei, 2009. "A Lagrangian approach for minimum cost tournaments," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 647, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. Guillermo Durán, 2021. "Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 125-155, April.
    7. Oberhelman Dennis & Galbreth Michael & Fry Timothy, 2013. "Equitable handicapping of scramble golf tournaments," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 9(4), pages 285-300, December.
    8. Jaeseob Han & Seung-Hyun Jeon & Gyeong-Ho Lee & Sangdon Park & Jun-Kyun Choi, 2023. "Power and Frequency Band Allocation Mechanisms for WPT System with Logarithmic-Based Nonlinear Energy Harvesting Model," Sustainability, MDPI, vol. 15(13), pages 1-27, July.
    9. Puterman Martin L & Wittman Stefan M, 2009. "Match Play: Using Statistical Methods to Categorize PGA Tour Players' Careers," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 5(1), pages 1-63, January.
    10. Michael A. Trick & Hakan Yildiz & Tallys Yunes, 2012. "Scheduling Major League Baseball Umpires and the Traveling Umpire Problem," Interfaces, INFORMS, vol. 42(3), pages 232-244, June.
    11. Vipul Jain & Ignacio E. Grossmann, 2001. "Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 13(4), pages 258-276, November.
    12. Jari Kyngäs & Kimmo Nurmi & Nico Kyngäs & George Lilley & Thea Salter & Dries Goossens, 2017. "Scheduling the Australian Football League," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(8), pages 973-982, August.
    13. Dries Goossens & Jeroen Beliën, 2023. "Teaching Integer Programming by Scheduling the Belgian Soccer League," INFORMS Transactions on Education, INFORMS, vol. 23(3), pages 164-172, May.
    14. Tallys H. Yunes & Arnaldo V. Moura & Cid C. de Souza, 2005. "Hybrid Column Generation Approaches for Urban Transit Crew Management Problems," Transportation Science, INFORMS, vol. 39(2), pages 273-288, May.
    15. Ritxar Arlegi & Dinko Dimitrov, 2023. "League competitions and fairness," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-18, May.
    16. Guillermo Durán & Mario Guajardo & Facundo Gutiérrez & Javier Marenco & Denis Sauré & Gonzalo Zamorano, 2021. "Scheduling the Main Professional Football League of Argentina," Interfaces, INFORMS, vol. 51(5), pages 361-372, September.
    17. Cangalovic, Mirjana & Kovacevic-Vujcic, Vera & Ivanovic, Lav & Drazic, Milan, 1998. "Modeling and solving a real-life assignment problem at universities," European Journal of Operational Research, Elsevier, vol. 110(2), pages 223-233, October.
    18. Yi, Xiajie & Goossens, Dries & Nobibon, Fabrice Talla, 2020. "Proactive and reactive strategies for football league timetabling," European Journal of Operational Research, Elsevier, vol. 282(2), pages 772-785.
    19. Dimopoulou, M. & Miliotis, P., 2001. "Implementation of a university course and examination timetabling system," European Journal of Operational Research, Elsevier, vol. 130(1), pages 202-213, April.
    20. Briskorn, Dirk, 2009. "A branching scheme for minimum cost tournaments with regard to real world constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 643, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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:bpj:jqsprt:v:5:y:2009:i:2:n:10. 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: Peter Golla (email available below). General contact details of provider: https://www.degruyter.com .

    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.