Pages that link to "Item:Q1761894"

The following pages link to Local search and constraint programming for the post enrolment-based course timetabling problem (Q1761894):

Displaying 14 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)
• On the performance of scatter search for post-enrolment course timetabling problems (Q2015784) (← links)
• An effective hybrid local search approach for the post enrolment course timetabling problem (Q2656559) (← links)
• Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) (← links)
• Simulated annealing with penalization for university course timetabling (Q6090224) (← links)
• Educational timetabling: problems, benchmarks, and state-of-the-art results (Q6167390) (← links)
• A matheuristic for customized multi-level multi-criteria university timetabling (Q6179219) (← links)