Lower bounds for the ITC-2007 curriculum-based course timetabling problem

This paper describes an approach for generating lower bounds for the curriculum-based course timetabling problem, which was presented at the International Timetabling Competition (ITC-2007, Track 3). So far, several methods based on integer linear programming have been proposed for computing lower b...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 212; číslo 3; s. 464 - 472
Hlavní autoři:	Hao, Jin-Kao, Benlic, Una
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.08.2011 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	Applied sciences Benchmarking Bounds Bounds Partitioning Tabu search Timetabling Computation Computer Science Curricula Curriculum development Divide & conquer algorithms Estimates Exact sciences and technology Heuristic Integer programming Linear programming Lower bounds Mathematical programming Operational research Operational research and scientific management Operational research. Management science Optimization Optimization algorithms Partitioning Scheduling, sequencing Solvers Studies Tabu search Timetabling Upper bounds Timetabling Partitioning Tabu search Bounds Lower bound Partition Curriculum guides Minimization Iterative method Linear programming Integer programming Educational program Upper bound Heuristic method Timetabling problem Divide and conquer method
ISSN:	0377-2217, 1872-6860
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!