Pages that link to "Item:Q1761894"
From MaRDI portal
The following pages link to Local search and constraint programming for the post enrolment-based course timetabling problem (Q1761894):
Displaying 8 items.
- Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem (Q300032) (← links)
- A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem (Q338852) (← links)
- An ILP based heuristic for a generalization of the post-enrollment course timetabling problem (Q342574) (← links)
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis (Q421447) (← links)
- Random partial neighborhood search for the post-enrollment course timetabling problem (Q1652508) (← links)
- Solving university course timetabling problems using constriction particle swarm optimization with local search (Q1736554) (← links)
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics (Q1753518) (← links)
- Improved local search approaches to solve the post enrolment course timetabling problem (Q1753553) (← links)
