Repairing high school timetables with polymorphic ejection chains
From MaRDI portal
Publication:284402
DOI10.1007/S10479-013-1504-3zbMATH Open1336.90076OpenAlexW2082748994MaRDI QIDQ284402FDOQ284402
Publication date: 18 May 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-013-1504-3
Recommendations
Cites Work
- Title not available (Why is that?)
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Nurse scheduling with tabu search and strategic oscillation
- Resource assignment in high school timetabling
- An XML format for benchmarks in high school timetabling
- Cyclic transfers in school timetabling
- Bridging the gap between self schedules and feasible schedules in staff scheduling
- Timetable construction: the algorithms and complexity perspective
- XHSTT: an XML archive for high school timetabling problems in different countries
- A survey of very large-scale neighborhood search techniques
Uses Software
This page was built for publication: Repairing high school timetables with polymorphic ejection chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284402)