School Timetabling--A Case in Large Binary Integer Linear Programming
A timetabling problem is formulated as a large integer linear programming problem in 0-1 variables. A solution method based on Lagrangean relaxation coupled with subgradient optimization is presented. The solution method also incorporates a branch and bound procedure which takes advantage of special...
Saved in:
Published in | Management science Vol. 30; no. 12; pp. 1473 - 1489 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Linthicum, MD
INFORMS
01.12.1984
Institute of Management Sciences Institute for Operations Research and the Management Sciences |
Series | Management Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!