{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:33:11Z","timestamp":1743143591177,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642019289"},{"type":"electronic","value":"9783642019296"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01929-6_18","type":"book-chapter","created":{"date-parts":[[2009,5,16]],"date-time":"2009-05-16T09:09:16Z","timestamp":1242464956000},"page":"233-247","source":"Crossref","is-referenced-by-count":4,"title":["Determining the Number of Games Needed to Guarantee an NHL Playoff Spot"],"prefix":"10.1007","author":[{"given":"Tyrel","family":"Russell","sequence":"first","affiliation":[]},{"given":"Peter","family":"van Beek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-540-68825-9_23","volume-title":"Advances in Artificial Intelligence","author":"T. Russell","year":"2008","unstructured":"Russell, T., van Beek, P.: Mathematically clinching a playoff spot in the NHL and the effect of scoring systems. In: Bergler, S. (ed.) Canadian AI. LNCS, vol.\u00a05032, pp. 234\u2013245. Springer, Heidelberg (2008)"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1111\/j.1475-3995.2005.00513.x","volume":"12","author":"C.C. Ribeiro","year":"2005","unstructured":"Ribeiro, C.C., Urrutia, S.: An application of integer programming to playoff elimination in football championships. International Transactions in Operational Research\u00a012, 375\u2013386 (2005)","journal-title":"International Transactions in Operational Research"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1287\/inte.32.2.12.67","volume":"32","author":"I. Adler","year":"2002","unstructured":"Adler, I., Erera, A.L., Hochbaum, D.S., Olinick, E.V.: Baseball, optimization and the world wide web. Interfaces\u00a032, 12\u201322 (2002)","journal-title":"Interfaces"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(91)90089-8","volume":"10","author":"L.W. Robinson","year":"1991","unstructured":"Robinson, L.W.: Baseball playoff eliminations: an application of linear programming. Operations Research Letters\u00a010, 67\u201374 (1991)","journal-title":"Operations Research Letters"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00453-001-0074-y","volume":"32","author":"D. Gusfield","year":"2002","unstructured":"Gusfield, D., Martel, C.E.: The structure and complexity of sports elimination numbers. Algorithmica\u00a032, 73\u201386 (2002)","journal-title":"Algorithmica"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/S0895480198348847","volume":"14","author":"K.D. Wayne","year":"2001","unstructured":"Wayne, K.D.: A new property and a faster algorithm for baseball elimination. SIAM Journal on Discrete Mathematics\u00a014, 223\u2013229 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1287\/opre.27.2.324","volume":"27","author":"J.R. Brown","year":"1979","unstructured":"Brown, J.R.: The sharing problem. Operations Research\u00a027, 324\u2013340 (1979)","journal-title":"Operations Research"},{"key":"18_CR8","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/1008062","volume":"8","author":"B. Schwartz","year":"1966","unstructured":"Schwartz, B.: Possible winners in partially completed tournaments. SIAM Review\u00a08, 302\u2013308 (1966)","journal-title":"SIAM Review"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Maher, M., Narodytska, N., Quimper, C.G., Walsh, T.: Flow-based propagators for the sequence and related global constraints. In: Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (2008)","DOI":"10.1007\/978-3-540-85958-1_11"},{"key":"18_CR11","volume-title":"Boost Graph Library: User Guide and Reference Manual","author":"J. Siek","year":"2001","unstructured":"Siek, J., Lee, L.Q., Lumsdaine, A.: Boost Graph Library: User Guide and Reference Manual. Addison-Wesley, Reading (2001)"},{"key":"18_CR12","unstructured":"ILOG S.A.: ILOG Solver 4.2 user\u2019s manual (1998)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01929-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T13:23:36Z","timestamp":1739107416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01929-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642019289","9783642019296"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01929-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}