Pages that link to "Item:Q2379550"
From MaRDI portal
The following pages link to Adaptive tabu search for course timetabling (Q2379550):
Displayed 35 items.
- GOAL solver: a hybrid local search based solver for high school timetabling (Q284398) (← links)
- Fairness in academic course timetabling (Q284412) (← links)
- Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem (Q300032) (← links)
- Multi-start iterated tabu search for the minimum weight vertex cover problem (Q306082) (← links)
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container (Q322528) (← links)
- Developing compact course timetables with optimized student flows (Q322740) (← links)
- Tabu search for the cyclic bandwidth problem (Q337475) (← links)
- A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem (Q339653) (← links)
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem (Q342121) (← links)
- An ILP based heuristic for a generalization of the post-enrollment course timetabling problem (Q342574) (← links)
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness (Q398925) (← links)
- A heuristic method to schedule training programs for small and medium enterprises (Q439435) (← links)
- Curriculum-based course timetabling with SAT and MaxSAT (Q475170) (← links)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem (Q1652501) (← links)
- An integer programming approach to curriculum-based examination timetabling (Q1686500) (← links)
- Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university (Q1687659) (← links)
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming (Q1730740) (← links)
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics (Q1753518) (← links)
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling (Q1761901) (← links)
- Coloring large graphs based on independent set extraction (Q1761974) (← links)
- An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines (Q1762138) (← links)
- An effective heuristic algorithm for sum coloring of graphs (Q1762148) (← links)
- Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints (Q2108178) (← links)
- A heuristic approach to combat multicollinearity in least trimmed squares regression analysis (Q2295249) (← links)
- An overview of curriculum-based course timetabling (Q2355018) (← links)
- Adaptive large neighborhood search for the curriculum-based course timetabling problem (Q2398424) (← links)
- A tabu search algorithm with controlled randomization for constructing feasible university course timetables (Q2664347) (← links)
- A SA-VNS approach for the High School Timetabling Problem (Q2840769) (← links)
- AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING (Q2868189) (← links)
- An integer program and a hybrid genetic algorithm for the university timetabling problem (Q5268943) (← links)
- Simulated annealing with penalization for university course timetabling (Q6090224) (← links)
- LCAHA: a hybrid artificial hummingbird algorithm with multi-strategy for engineering applications (Q6096488) (← 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)