1966/07/01 by Benjamin L. Schwartz · 1 citation
Decision Sciences · Economics, Econometrics and Finance · Mathematics · Psychology · #Bipartite graph #Combinatorics #Computer science #Discrete mathematics #Educational Games and Gamification #Graph #Mathematical economics #Mathematics #Operations research #Scheduling and Timetabling Solutions #Sports Analytics and Performance #Tournament
paper · doi:10.1137/1008062
openalex publication_date 1966/07/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/05/09
Previous article Next article Possible Winners in Partially Completed TournamentsB. L. SchwartzB. L. Schwartzhttps://doi.org/10.1137/1008062PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] David Gale, A theorem on flows in networks, Pacific J. Math., 7 (1957), 1073–1082 MR0091855 0087.16303 CrossrefGoogle Scholar[2] L. R. Ford, Jr. and , D. R. Fulkerson, Flows in networks, Report, R-375-PR, The RANK Corporation, Santa Monica, California, 1962 Google Scholar[3] Claude Berge, The theory of graphs and its applications, Translated by Alison Doig, Methuen & Co. Ltd., London, 1962x+247 MR0132541 0097.38903 Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Bounding the final rank during a round robin tournament with integer programming10 February 2020 | Operational Research, Vol. 22, No. 1 Cross Ref Improving Sports Media's Crystal Ball for National Basketball Association Playoff EliminationINFORMS Journal on Applied Analytics, Vol. 51, No. 2 Cross Ref Non-Network Solution Coordinated Voltage Stability Enhancement With STATCOM and UVLS for Wind-Penetrated Power SystemIEEE Transactions on Sustainable Energy, Vol. 11, No. 3 Cross Ref Network Flow Algorithms21 August 2019 | , Vol. 194 Cross Ref A Connection Between Sports and Matroids: How Many Teams Can We Beat?28 November 2016 | Algorithmica, Vol. 80, No. 1 Cross Ref SABIO: An Implementation of MIP and CP for Interactive Soccer Queries23 August 2016 Cross Ref Constraint Programming and Machine Learning for Interactive Soccer Analysis1 December 2016 Cross Ref Refining the complexity of the sports elimination problemDiscrete Applied Mathematics, Vol. 199 Cross Ref Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs12 February 2015 | Annals of Operations Research, Vol. 229, No. 1 Cross Ref Soccer is Harder Than FootballInternational Journal of Foundations of Computer Science, Vol. 26, No. 04 Cross Ref A hybrid constraint programming and enumeration approach for solving NHL playoff qualification and elimination problemsEuropean Journal of Operational Research, Vol. 218, No. 3 Cross Ref Matchings, Cuts, and Flows Cross Ref Determining the Number of Games Needed to Guarantee an NHL Playoff Spot Cross Ref A multi-agent framework to build integer programming applications to playoff elimination in sports tournamentsInternational Transactions in Operational Research, Vol. 15, No. 6 Cross Ref Mathematically Clinching a Playoff Spot in the NHL and the Effect of Scoring Systems Cross Ref An application of integer programming to playoff elimination in football championshipsInternational Transactions in Operational Research, Vol. 12, No. 4 Cross Ref The computational complexity of the elimination problem in generalized sports competitionsDiscrete Optimization, Vol. 1, No. 2 Cross Ref Baseball, Optimization, and the World Wide WebInterfaces, Vol. 32, No. 2 Cross Ref A new?old algorithm for minimum-cut and maximum-flow in closure graphs1 January 2001 | Networks, Vol. 37, No. 4 Cross Ref A New Property and a Faster Algorithm for Baseball Elimination1 August 2006 | SIAM Journal on Discrete Mathematics, Vol. 14, No. 2AbstractPDF (114 KB)Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum FlowOperations Research, Vol. 47, No. 5 Cross Ref Thresholds for Sports Elimination Numbers: Algorithms and Complexity18 July 2002 Cross Ref Chapter 1 Applications of network optimization Cross Ref Improved Algorithms for Bipartite Network Flow13 July 2006 | SIAM Journal on Computing, Vol. 23, No. 5AbstractPDF (3642 KB)Sum decompositions of symmetric matricesLinear Algebra and its Applications, Vol. 208-209 Cross Ref A fast algorithm for the generalized parametric minimum cut problem and applicationsAlgorithmica, Vol. 7, No. 1-6 Cross Ref Baseball playoff eliminations: An application of linear programmingOperations Research Letters, Vol. 10, No. 7 Cross Ref Fast Algorithms for Bipartite Network Flow13 July 2006 | SIAM Journal on Computing, Vol. 16, No. 2AbstractPDF (2049 KB)Network Modelling Cross Ref Volume 8, Issue 3| 1966SIAM Review History Submitted:01 June 1965Accepted:01 December 1965Published online:18 July 2006 InformationCopyright © 1966 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1008062Article page range:pp. 302-308ISSN (print):0036-1445ISSN (online):1095-7200Publisher:Society for Industrial and Applied Mathematics