Realignment in the national football league: Did they do it right?

Naval Research Logistics

Volumn 50, Issue 7, 2003, Pages 683-701

  Mitchell, John E ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Branch and cut; Graph equipartition; Realignment

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; LINEAR PROGRAMMING; OPERATIONS RESEARCH; PROBLEM SOLVING; THEOREM PROVING; VECTORS;

BRANCH-AND-CUT ALGORITHM; EQUIPARTITION PROBLEM; GRAPH EQUIPARTITION; POLYHEDRAL THEORY;

GRAPH THEORY;

EID: 0141905045     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.10084     Document Type: Article

References (34)

1. I. Adler, A.L. Erera, D.S. Hochbaum, and E.V. Olinick, Baseball, optimization, and the world wide web, Interfaces 32(2) (2002), 12-22.
2. S. Areibi and A. Vannelli, "Advanced search techniques for circuit partitioning," Quadratic assignment and related problems, P.M. Pardaols and H. Wolkowicz (Editors), DIMACS 16, American Mathematical Society, Providence, RI, 1994, pp. 77-96.
3. F. Barahona and A.R. Mahjoub, On the cut polytope, Math Program 36 (1986), 157-173.
4. J.C. Bean and J.R. Birge, Reducing travel costs and player fatigue in the NBA, Interfaces 10 (1980), 98-102.
5. S.J. Benson, Y. Ye, and X. Zhang, Solving large-scale sparse semidefinite programs for combinatorial optimization. SIAM J Optim 10(2) (2000), 443-461.
6. L. Brunetta, M. Conforti, and G. Rinaldi, A branch-and-cut algorithm for the equicut problem, Math Program 78 (1997), 243-263.
7. V.W.C. Chan, P.C.H. Chan, and M. Chan, Multiple layers of CMOS integrated circuits using recrystallized silicon film, IEEE Electron Device Lett 22(2) (2001), 77-79.
8. S. Chopra, The graph partitioning polytope on series-parallel and 4-wheel free graphs, SIAM J Discrete Math 7 (1994), 16-31.
9. S. Chopra and M.R. Rao, The partition problem, Math Program 59 (1993), 87-115.
10. M. Conforti, M.R. Rao, and A. Sassano, The equipartition polytope I: Formulations, dimension and basic facets, Math Program 49 (1990), 49-70.
11. M. Conforti, M.R. Rao, and A. Sassano, The equilibrium polytype II: Valid inequalities and facets, Math Program 49 (1990), 71-90.
12. J. Domingo-Ferrer and J.M. Mateo-Sanz, Practical data-oriented microaggregation for statistical disclosure control, IEEE Trans Knowledge Data Engr 14(1) (2002), 189-201.
13. W.E. Donath and A.J. Hoffman, Lower bounds for the partitioning of graphs, IBM J Res Dev 17 (1973), 420-425.
14. F.C. Duckworth and A.J. Lewis. A fair method for resetting the target in interrupted one-day cricket matches, J Oper Res Soc 49(3) (1998), 220-227.
15. J. Falkner, F. Rendl, and H. Wolkowicz, A computational study of graph partitioning, Math Program 66 (1994), 211-239.
16. C.E. Ferreira, A. Martin, C.C. de Souza, R. Weismantel, and L.A. Wolsey, The node capacitated graph partitioning problem: formulations and valid inequalities, Math Program 74 (1996), 247-267.
17. C.E. Ferreira, A. Martin, C.C. de Souza, R. Weismantel, and L.A. Wolsey, The node capacitated graph partitioning problem: A computational study, Math Program 81 (1998), 229-256.
18. M. Fischetti and J.J. Salazar, Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control, Math Program 84 (1999), 283-312.
19. A. Frieze and M. Jerrum, Improved approximation algorithms for max k-cut and max bisection, Proc Fourth IPCO Conf, 1995, pp. 1-13.
20. M.R. Garey and D.S. Johnson, Computers and intractibility: A guide to the theory of NP-completeness, Freeman, New York, 1979.
21. M. Grötschel and Y. Wakabayashi, A cutting plane algorithm for a clustering problem, Math Program 45 (1989), 59-96.
22. M. Grötschel and Y. Wakabayashi, Facets of the clique partitioning polytope, Math Program 47 (1990), 367-387.
23. S.E. Karisch and F. Rendl, "Semidefinite programming and graph equipartition," Topics in semidefinite and interior-point methods, P.M. Pardalos and H. Wolkowicz (Editors), Fields Institute Communications 18, American Mathematical Society, Providence, RI, pp. 77-95.
24. G. Karypis and V. Kumar, Multilevel k-way hypergraph partitioning, VLSI Des 11(3) (2000), 285-300.
25. B.W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell Syst Tech J 49 (1970), 291-307.
26. A. Lisser and F. Rendl, Telecommunication clustering using linear and semidefinite programming, Technical Report, Institüt für Mathematik, Universität Klagenfurt, A-9020 Klagenfurt, Austria, November 2000.
27. J.E. Mitchell, Computational experience with an interior point cutting plane algorithm, SIAM J Optim 10(4) (2000), 1212-1227.
28. J.E. Mitchell, Branch-and-cut for the k-way equipartition problem, Technical Report, Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY, January 2001.
29. G.L. Nemhauser and M.A. Trick, Scheduling a major college basketball conference, Oper Res 46 (1998), 1-8.
30. NFL, New century, new look for NFL, news release, 22 May 2001, The National Football League, New York, http://www.nfl.com/news/010522realignment.html.
31. R. Saltzman and R.M. Bradford, Optimal realignments of the teams in the National Football League, European J Oper Res 93(3) (1996), 469-475.
32. M.A. Trick, "A schedule-and-break approach to sports scheduling" PATAT2000, E. Burke and W. Erben (Editors). Springer Lecture Notes in Computer Science 2079, Springer-Verlag, New York, 2000, pp. 242-253.
33. H. Wolkowicz and Q. Zhao, Semidefinite programming relaxations for the graph partitioning problem, Discrete Appl Math 96/97 (1999), 461-479.
34. Y. Ye, A .699-approximation algorithm for max-bisection, Math Program 90(1) (2001), 101-111.