Baseball, Optimization, and the World Wide Web

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Gallo G., Grigoriadis M. D., Tarjan R. E. A fast parametric maximum flow algorithm and applications. SIAM J. Comput. (1989) 18(1):30–55Crossref, Google Scholar
• Gay N. Giants officially leave the N.L. West race. San Francisco Chronicle (1996) September 10):D1Google Scholar
• Gusfield D., Martel C. A fast algorithm for the generalized parametric minimum cut problem and applications. Algorithmica (1992) 7(5–6):499–519Crossref, Google Scholar
• Gusfield D., Martel C., Fernandez-Baca D. Fast algorithms for bipartite network flow. SIAM J. Comput. (1987) 16(2):237–251Crossref, Google Scholar
• Hoffman A. J., Rivlin T. J., Kuhn H. W. When is a team ‘mathematically’ eliminated? Proc. Princeton Sympos. on Math. Programming (1970) (Princeton University Press, Princeton, NJ) Google Scholar
• McCormick S. T. Two hard min cut problems. (1987) . Technical report presented at the TIMS/ORSA Conference, New Orleans, LAGoogle Scholar
• McCormick S. T. Fast algorithms for parametric scheduling come from extensions to parametric maximum flow. Oper. Res. (1999) 47(5):744–756Link, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (John Wiley and Sons, New York) Crossref, Google Scholar
• Robinson L. W. Baseball playoff eliminations: An application of linear programming. Oper. Res. Letters (1991) 10(2):67–74Crossref, Google Scholar
• Schrage L.Linear, Integer, and Quadratic Programming with LINDO (1984) (Scientific Press, Palo Alto, CA) Google Scholar
• Schwartz B. L. Possible winners in partially completed tournaments. SIAM Rev. (1966) 8(3):302–308Crossref, Google Scholar
• Wayne K D. A new property and a faster algorithm for baseball elimination. SIAM J. Discrete Math. (2001) 14(2):223–229Crossref, Google Scholar