IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v36y2018i3d10.1007_s10878-018-0254-1.html
   My bibliography  Save this article

An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment

Author

Listed:
  • Diego Recalde

    (Escuela Politécnica Nacional
    Escuela Politécnica Nacional)

  • Daniel Severín

    (Universidad Nacional de Rosario and CONICET)

  • Ramiro Torres

    (Escuela Politécnica Nacional)

  • Polo Vaca

    (Escuela Politécnica Nacional)

Abstract

In this work a balanced k-way partitioning problem with weight constraints is defined to model the sports team realignment. Sports teams must be partitioned into a fixed number of groups according to some regulations, where the total distance of the road trips that all teams must travel to play a double round robin tournament in each group is minimized. Two integer programming formulations for this problem are introduced, and the validity of three families of inequalities associated to the polytope of these formulations is proved. The performance of a tabu search procedure and a branch and cut algorithm, which uses the valid inequalities as cuts, is evaluated over simulated and real-world instances. In particular, an optimal solution for the realignment of the Ecuadorian football league is reported and the methodology can be suitable adapted for the realignment of other sports leagues.

Suggested Citation

  • Diego Recalde & Daniel Severín & Ramiro Torres & Polo Vaca, 2018. "An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 916-936, October.
    • Handle: RePEc:spr:jcomop:v:36:y:2018:i:3:d:10.1007_s10878-018-0254-1
    DOI: 10.1007/s10878-018-0254-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-018-0254-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-018-0254-1?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. FERREIRA, Carlos E. & MARTIN, Alexander & de SOUZA, Cid C. & WEISMANTEL, Robert, 1998. "The node capacitated graph partitioning problem: A computational study," LIDAM Reprints CORE 1335, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. John E. Mitchell, 2003. "Realignment in the National Football League: Did they do it right?," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 683-701, October.
    3. Saltzman, Robert M. & Bradford, Richard M., 1996. "Optimal realignments of the teams in the National Football League," European Journal of Operational Research, Elsevier, vol. 93(3), pages 469-475, September.
    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. Diego Recalde & Ramiro Torres & Polo Vaca, 2020. "An exact approach for the multi-constraint graph partitioning problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 289-308, October.
    2. Li, Miao & Davari, Morteza & Goossens, Dries, 2023. "Multi-league sports scheduling with different leagues sizes," European Journal of Operational Research, Elsevier, vol. 307(1), pages 313-327.
    3. Antonis Antonopoulos & Aris Pagourtzis & Stavros Petsalakis & Manolis Vasilakis, 2023. "Faster algorithms for k-subset sum and variations," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-21, January.

    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. Diego Recalde & Ramiro Torres & Polo Vaca, 2020. "An exact approach for the multi-constraint graph partitioning problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 289-308, October.
    2. John E. Mitchell, 2003. "Realignment in the National Football League: Did they do it right?," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 683-701, October.
    3. Li, Miao & Davari, Morteza & Goossens, Dries, 2023. "Multi-league sports scheduling with different leagues sizes," European Journal of Operational Research, Elsevier, vol. 307(1), pages 313-327.
    4. Fuda Ma & Jin-Kao Hao, 2017. "A multiple search operator heuristic for the max-k-cut problem," Annals of Operations Research, Springer, vol. 248(1), pages 365-403, January.
    5. Anuj Mehrotra & Joseph Shantz & Michael A. Trick, 2005. "Determining newspaper marketing zones using contiguous clustering," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 82-92, February.
    6. de Meijer, Frank, 2023. "Integrality and cutting planes in semidefinite programming approaches for combinatorial optimization," Other publications TiSEM b1f1088c-95fe-4b8a-9e15-c, Tilburg University, School of Economics and Management.
    7. A I Jarrah & J F Bard, 2011. "Pickup and delivery network segmentation using contiguous geographic clustering," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(10), pages 1827-1843, October.
    8. Renata Sotirov, 2018. "Graph bisection revisited," Annals of Operations Research, Springer, vol. 265(1), pages 143-154, June.
    9. Simona Mancini, 2018. "Assignment of swimmers to events in a multi-team meeting for team global performance optimization," Annals of Operations Research, Springer, vol. 264(1), pages 325-337, May.
    10. Mancini Simona & Isabello Andrea, 2014. "Fair referee assignment for the Italian soccer serieA," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 10(2), pages 153-160, June.
    11. M B Wright, 2009. "50 years of OR in sport," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 161-168, May.
    12. Vilmar Jefté Rodrigues de Sousa & Miguel F. Anjos & Sébastien Le Digabel, 2018. "Computational study of valid inequalities for the maximum k-cut problem," Annals of Operations Research, Springer, vol. 265(1), pages 5-27, June.
    13. Bissan Ghaddar & Miguel Anjos & Frauke Liers, 2011. "A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem," Annals of Operations Research, Springer, vol. 188(1), pages 155-174, August.
    14. Albareda-Sambola, Maria & Marín, Alfredo & Rodríguez-Chía, Antonio M., 2019. "Reformulated acyclic partitioning for rail-rail containers transshipment," European Journal of Operational Research, Elsevier, vol. 277(1), pages 153-165.
    15. Michael M. Sørensen, 2004. "b-Tree Facets for the Simple Graph Partitioning Polytope," Journal of Combinatorial Optimization, Springer, vol. 8(2), pages 151-170, June.
    16. Renata Sotirov, 2014. "An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 16-30, February.
    17. Stefan E. Karisch & Franz Rendl & Jens Clausen, 2000. "Solving Graph Bisection Problems with Semidefinite Programming," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 177-191, August.
    18. Vilmar Jefté Rodrigues de Sousa & Miguel F. Anjos & Sébastien Le Digabel, 2019. "Improving the linear relaxation of maximum k-cut with semidefinite-based constraints," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(2), pages 123-151, June.
    19. Saltzman, Robert M. & Bradford, Richard M., 2022. "A data-driven approach to scheduling the U.S. presidential primary elections," Socio-Economic Planning Sciences, Elsevier, vol. 79(C).
    20. Wright, Mike, 2014. "OR analysis of sporting rules – A survey," European Journal of Operational Research, Elsevier, vol. 232(1), pages 1-8.

    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:spr:jcomop:v:36:y:2018:i:3:d:10.1007_s10878-018-0254-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.