Pages that link to "Item:Q3093045"
From MaRDI portal
The following pages link to A clique-based algorithm for constructing feasible timetables (Q3093045):
Displaying 5 items.
- Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem (Q300032) (← links)
- A column generation approach for solving the examination-timetabling problem (Q323146) (← links)
- An effective hybrid local search approach for the post enrolment course timetabling problem (Q2656559) (← links)
- A tabu search algorithm with controlled randomization for constructing feasible university course timetables (Q2664347) (← links)
- Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata (Q3448629) (← links)
