School Timetabling---A Case in Large Binary Integer Linear Programming

Arabinda Tripathy
Additional contact information
Arabinda Tripathy: Indian Institute of Management, Vastrapur, Ahmedabad 380015, India

Management Science, 1984, vol. 30, issue 12, 1473-1489

Abstract: 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.

Keywords: programming: integer; applications; Lagrangean relaxation (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (18)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.30.12.1473 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:30:y:1984:i:12:p:1473-1489

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().