Balanced Partition of a Graph for Football Team Realignment in Ecuador

DOI10.1007/978-3-319-45587-7_31zbMath1445.90115OpenAlexW2507761159MaRDI QIDQ2835691

Daniel Severín, Ramiro Torres, Diego Recalde, Polo Vaca

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_31

zbMATH Keywords

heuristicsgraph partitioningfootballinteger programming models

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment ⋮ Balancing stability and efficiency in team formation as a generalized roommate problem

Cites Work

• Scheduling the professional Ecuadorian football league by integer programming
• Size-constrained graph partitioning polytopes
• A cutting plane algorithm for a clustering problem
• Optimal realignments of the teams in the National Football League
• The node capacitated graph partitioning problem: A computational study
• New bounds and constraint propagation techniques for the clique partitioning problem
• Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
• Finding optimal realignments in sports leagues using a branch-and-cut-and-price approach

This page was built for publication: Balanced Partition of a Graph for Football Team Realignment in Ecuador