A Lagrangean Relaxation Approach to Course Timetabling
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A study of mathematical programming approaches to time-tabling resulted in the development of an algorithm based on Lagrangean relaxation embedded in a branch and bound procedure, which is applied to a more modest-sized problem based on published real data.
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.