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

• Anjos M, Ghaddar B, Hupp L, Liers F, Wiegele A (2013) Solving k-way graph partitioning problems to optimality: the impact of semidefinite relaxations and the bundle method. In: Jünger M, Reinelt G (eds) Facets of combinatorial optimization: Festschrift for Martin Grötschel. Springer, Berlin, pp 355–386

  Chapter  Google Scholar 

• Buluç A, Meyerhenke H, Safro I, Sanders P, Schulz C (2016) Recent advances in graph partitioning. In: Kliemann L, Sanders P (eds) Algorithm engineering: selected results and surveys. Springer, Cham, pp 117–158

  Chapter  Google Scholar 

• Catanzaro D, Gourdinb E, Labbé M, Özsoy FA (2011) A branch-and-cut algorithm for the partitioning-hub location-routing problem. Comput Oper Res 38(2):539–549

  Article  MathSciNet  MATH  Google Scholar 

• Fairbrother J, Letchford A, Briggs K (2017) A two-level graph partitioning problem arising in mobile wireless communications. arXiv:1705.08773

• Ferreira C, Martin A, de Souza C, Weismantel R, Wolsey L (1998) The node capacitated graph partitioning problem: a computational study. Math Program 81:229–256

  MathSciNet  MATH  Google Scholar 

• Glover F, McMillan C, Novick B (1985) Interactive decision software and computer graphics for architectural and space planning. Ann Oper Res 5(3):557–573

  Article  Google Scholar 

• Grötschel M, Wakabayashi Y (1989) A cutting plane algorithm for a clustering problem. Math Program 45:59–96

  Article  MathSciNet  MATH  Google Scholar 

• Hendrickson B, Kolda TG (2000) Graph partitioning models for parallel computing. Parallel Comput 26(12):1519–1534

  Article  MathSciNet  MATH  Google Scholar 

• Jaehn F, Pesch E (2013) New bounds and constraint propagation techniques for the clique partitioning problem. Discr Appl Math 161:2025–2037

  Article  MathSciNet  MATH  Google Scholar 

• Ji X, Mitchell JE (2007) Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement. Discr Optim 4:87–102

  Article  MathSciNet  MATH  Google Scholar 

• Kahng A, Lienig J, Markov I, Hu J (2011) VLSI physical design: from graph partitioning to timing closure, 1st edn. Springer, Berlin

  Book  MATH  Google Scholar 

• Labbé M, Özsoy FA (2010) Size-constrained graph partitioning polytopes. Discrete Math 310:3473–3493

  Article  MathSciNet  MATH  Google Scholar 

• Lai X, Hao JK, Glover F (2015) Backtracking based iterated tabu search for equitable coloring. Eng Appl Artif Intell 46:269–278

  Article  Google Scholar 

• McDonald B, Pulleyblank W (2014) Realignment in the NHL, MLB, NFL, and NBA. J Quant Anal Sports 10(2):225–240

  Google Scholar 

• Méndez Díaz I, Nasini G, Severin D (2014) A tabu search heuristic for the equitable coloring problem. Lect Notes Comput Sci 8596:347–358

  Article  MathSciNet  MATH  Google Scholar 

• Mitchell JE (2001) Branch-and-cut for the k-way equipartition problem. Technical report, Department of Mathematical Sciences, Rensselaer Polytechnic Institute

• Mitchell JE (2003) Realignment in the national football league: Did they do it right? Naval Res Logist (NRL) 50(7):683–701

  Article  MathSciNet  MATH  Google Scholar 

• Nguyen DP, Minoux M, Nguyen VH, Nguyen TH, Sirdey R (2017) Improved compact formulations for a wide class of graph partitioning problems in sparse graphs. Discrete Optim 25(C):175–188

  Article  MathSciNet  MATH  Google Scholar 

• Recalde D, Severin D, Torres R, Vaca P (2016) Balanced partition of a graph for football team realignment in ecuador. Lect Notes Comput Sci 9849:357–368

  Article  MathSciNet  MATH  Google Scholar 

• Saltzman R, Bradford RM (1996) Optimal realignments of the teams in the national football league. Eur J Oper Res 93(3):469–475

  Article  MATH  Google Scholar 

Download references