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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Management science Ročník 30; číslo 12; s. 1473 - 1489
Hlavní autor: Tripathy, Arabinda
Médium: Journal Article
Jazyk:angličtina
Vydáno: Linthicum, MD INFORMS 01.12.1984
Institute of Management Sciences
Institute for Operations Research and the Management Sciences
Edice:Management Science
Témata:
ISSN:0025-1909, 1526-5501
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.30.12.1473