Realignment in the National Football League: Did they do it right?
From MaRDI portal
Publication:4456091
DOI10.1002/nav.10084zbMath1043.90559OpenAlexW1986613675MaRDI QIDQ4456091
Publication date: 15 March 2004
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.10084
Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (13)
An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment ⋮ Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables ⋮ Computational study of valid inequalities for the maximum \(k\)-cut problem ⋮ Size-constrained graph partitioning polytopes ⋮ Computational study of a branching algorithm for the maximum \(k\)-cut problem ⋮ Multi-league sports scheduling with different leagues sizes ⋮ New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph ⋮ A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem ⋮ An exact approach for the multi-constraint graph partitioning problem ⋮ Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement ⋮ A multiple search operator heuristic for the max-k-cut problem ⋮ OR analysis of sporting rules -- a survey ⋮ Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
Cites Work
This page was built for publication: Realignment in the National Football League: Did they do it right?
