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:	Algorithms applications Applied sciences Exact sciences and technology Graduate studies Groups Heuristics Integer programming Integers Integrality Iterative solutions Lagrangean relaxation Linear programming Management science Mathematical models Mathematical programming Objective functions Operational research and scientific management Operational research. Management science Optimization Planning. Forecasting programming: integer Relaxation Scheduling Schools Students Teachers Transportation Variable coefficients Variables Integer programming Relaxation method Linear programming Planning Mathematical programming
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!

Buďte první, kdo okomentuje tento záznam!