ACM

Communications of the ACM

Home/Magazine Archive/April 1974 (Vol. 17, No. 4)/On Lion's counter example for Gotlieb's method for.../Abstract

On Lion's counter example for Gotlieb's method for the construction of school timetables

By Graham Smith, Ian M. Sefton
Communications of the ACM, April 1974, Vol. 17 No. 4, Pages 196-197
10.1145/360924.360935
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.