✦ LIBER ✦

Linear combinations of heuristics for examination timetabling

✍ Scribed by Edmund K. Burke; Nam Pham; Rong Qu; Jay Yellen

Publisher: Springer US
Year: 2011
Tongue: English
Weight: 619 KB
Volume: 194
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-011-0854-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comparison of metaheuristic algorithms f

Comparison of metaheuristic algorithms for Examination Timetabling Problem

✍ Zahra Naji Azimi 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 183 KB

A heuristic approach to algorithms inten

A heuristic approach to algorithms intended for the solution of the timetable-problem

✍ D. Lazak 📂 Article 📅 1969 🏛 Springer Vienna 🌐 English ⚖ 861 KB

A survey of search methodologies and aut

A survey of search methodologies and automated system development for examination timetabling

✍ R. Qu; E. K. Burke; B. McCollum; L. T. G. Merlot; S. Y. Lee 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 637 KB

Stability Theorems for Linear Combinatio

Stability Theorems for Linear Combinations of Idempotents

✍ J. J. Koliha; V. Rakočević 📂 Article 📅 2007 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 120 KB

An IP-based heuristic for the post enrol

An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007

✍ J. J. J. van den Broek; C. A. J. Hurkens 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 496 KB

A combined Lagrangian, linear programmin

A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems

✍ A. Atamtürk; G. L. Nemhauser; M. W. P. Savelsbergh 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 685 KB

Given a finite ground set, a set of subsets, and costs on the subsets, the set partitioning problem is to find a minimum cost partition of the ground set. Many combinatorial optimization problems can be formulated as set partitioning problems. We present an approximation algorithm that produces high