A Lagrangean Relaxation Approach to Course Timetabling

Publisher Website
Google Scholar
Abstract
A study of mathematical programming approaches to time-tabling has resulted in the development of an algorithm based on Lagrangean relaxation embedded in a branch and bound procedure. The algorithm is still under development for larger scale problems, but this paper reports on its application to a more modest-sized problem based on published real data.

This publication has 0 references indexed in Scilit: