𝔖 Bobbio Scriptorium
✦   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

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A combined Lagrangian, linear programmin
✍ 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