A clique-based algorithm for constructing feasible timetables
From MaRDI portal
Publication:3093045
DOI10.1080/10556781003664739zbMath1225.90054OpenAlexW2025265020MaRDI QIDQ3093045
Yong-Kai Liu, Defu Zhang, Francis Y. L. Chin
Publication date: 12 October 2011
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10722/129976
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (6)
Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata ⋮ Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem ⋮ A column generation approach for solving the examination-timetabling problem ⋮ An effective hybrid local search approach for the post enrolment course timetabling problem ⋮ A tabu search algorithm with controlled randomization for constructing feasible university course timetables ⋮ An integer program and a hybrid genetic algorithm for the university timetabling problem
This page was built for publication: A clique-based algorithm for constructing feasible timetables
