Pages that link to "Item:Q475200"
From MaRDI portal
The following pages link to Timetable construction: the algorithms and complexity perspective (Q475200):
Displaying 9 items.
- Repairing high school timetables with polymorphic ejection chains (Q284402) (← links)
- A complexity analysis and an algorithmic approach to student sectioning in existing timetables (Q310342) (← links)
- Exchanges procedures for timetabling problems (Q1186312) (← links)
- Iterative restart technique for solving timetabling problems. (Q1417483) (← links)
- Complexity of some special types of timetabling problems (Q1600003) (← links)
- Decomposition of university course timetabling. A systematic study of subproblems and their complexities (Q2241151) (← links)
- Model of time-table construction process (Q2760542) (← links)
- Accelerating time-dependent multi-criteria timetable information is harder than expected (Q2917326) (← links)
- About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness (Q3651622) (← links)