Realignment in the National Football League: Did they do it right?

DOI10.1002/NAV.10084MaRDI QIDQ4456091zbMATH OpenOpenAlexFDO

Authors John E. Mitchell

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

zbMATH Keywords

branch-and-cutgraph equipartitionrealignment

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90)

Recommendations

• Optimal realignments of the teams in the National Football League
• Finding optimal realignments in sports leagues using a branch-and-cut-and-price approach
• An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
• Balanced partition of a graph for football team realignment in Ecuador
• Organization of a college baseball tournament

Cites work

• scientific article; zbMATH DE number 1182569 (Why is no real title available?)
• Improved approximation algorithms for MAX k-CUT and MAX BISECTION

Cited in

(17)

• Optimal realignments of the teams in the National Football League
• An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
• Computational study of valid inequalities for the maximum \(k\)-cut problem
• An exact approach for the multi-constraint graph partitioning problem
• OR analysis of sporting rules -- a survey
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
• 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
• Computational study of a branching algorithm for the maximum \(k\)-cut problem
• Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables
• A multiple search operator heuristic for the max-k-cut problem
• Restructuring the Belgian Professional Football League: a location-allocation solution
• Size-constrained graph partitioning polytopes
• Multi-league sports scheduling with different leagues sizes
• A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
• Optimizing connected components graph partitioning with minimum size constraints using integer programming and spectral clustering techniques
• New bounds for the -k-cut and chromatic number of a graph

This page was built for publication: Realignment in the National Football League: Did they do it right?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4456091)