Please use this identifier to cite or link to this item:
|Title:||Scheduling a major college basketball conference - Revisited||Authors:||Henz, M.||Issue Date:||2001||Citation:||Henz, M. (2001). Scheduling a major college basketball conference - Revisited. Operations Research 49 (1) : 163-168. ScholarBank@NUS Repository.||Abstract:||Nemhauser and Trick presented the problem of finding a timetable for the 1997/1998 Atlantic Coast Conference (AAC) in basketball. Their solution, found with a combination of integer programming and exhaustive enumeration, was accepted by the ACC. Finite-domain constraint programming is another programming technique that can be used for solving combinatorial search problems such as sports tournament scheduling. This paper presents a solution of round-robin tournament planning based on finite-domain constraint programming. The approach yields a dramatic performance improvement, which makes an integrated interactive software solution feasible.||Source Title:||Operations Research||URI:||http://scholarbank.nus.edu.sg/handle/10635/39195||ISSN:||0030364X|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 15, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.