کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
478409 | 1446081 | 2012 | 10 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: A hybrid constraint programming and enumeration approach for solving NHL playoff qualification and elimination problems A hybrid constraint programming and enumeration approach for solving NHL playoff qualification and elimination problems](/preview/png/478409.png)
Many sports fans invest a great deal of time into watching and analyzing the performance of their favorite team. However, the tools at their disposal are primarily heuristic or based on folk wisdom. We provide a concrete mechanism for calculating the minimum number of points needed to guarantee a playoff spot and the minimum number of points needed to possibly qualify for a playoff spot in the National Hockey League (NHL). Our approach uses a combination of constraint programming, enumeration, network flows and decomposition to solve the problem efficiently. The technique can successfully be applied to any team at any point of the season to determine how well a team must do to make the playoffs.
► We model NHL qualification and elimination problems.
► We solve the problems using constraint programming and enumeration.
► Our phased approach is an efficient technique for solving these problems.
Journal: European Journal of Operational Research - Volume 218, Issue 3, 1 May 2012, Pages 819–828