A hybrid constraint programming and enumeration approach for solving NHL playoff qualification and elimination problems
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.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:218:y:2012:i:3:p:819-828. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.