Thumbnail
Access Restriction
Subscribed

Author Smith, Graham ♦ Sefton, Ian M.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Timetable ♦ Schedule ♦ School timetable ♦ Combinatorical ♦ Necessary conditions ♦ Multi-index problem
Abstract The timetable problem is an essentially discrete problem. Although the discrete problem may have no feasible solution, there may exist a solution to the equivalent continuous problem. An example, is given, for which the nondiscrete solution can be interpreted as a set of timetables, differing from week to week, which together satisfy the long-term requirements of the timetable problem.
Description Affiliation: Univ. of Sydney, Sydney, Australia (Sefton, Ian M.) || Univ. of New South Wales, Kensington, Australia (Smith, Graham)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 17
Issue Number 4
Page Count 2
Starting Page 196
Ending Page 197


Open content in new tab

   Open content in new tab
Source: ACM Digital Library