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 ordered sets of variables. We present computational results for a large timetabling problem involving 900 subjects in a one-year graduate program.

MoreLess

Year of publication:	1984
Authors:	Tripathy, Arabinda
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 30.1984, 12, p. 1473-1489
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS
Subject:	programming: integer \| applications \| Lagrangean relaxation

More details

Extent:	application/pdf
Type of publication:	Article
Other identifiers:	10.1287/mnsc.30.12.1473 [DOI]
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10009198138