Pages that link to "Item:Q2506215"

The following pages link to Neighborhood portfolio approach for local search applied to timetabling problems (Q2506215):

Displaying 25 items.

• Fairness in academic course timetabling (Q284412) (← links)
• A memetic algorithm for the minimum sum coloring problem (Q336939) (← links)
• A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem (Q339653) (← links)
• The balanced academic curriculum problem revisited (Q519088) (← links)
• A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
• An effective multilevel tabu search approach for balanced graph partitioning (Q622162) (← links)
• Local search and lower bounds for the patient admission scheduling problem (Q632698) (← links)
• On the application of graph colouring techniques in round-robin sports scheduling (Q709125) (← links)
• A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (Q1013410) (← links)
• Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
• Random partial neighborhood search for the post-enrollment course timetabling problem (Q1652508) (← links)
• Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university (Q1687659) (← links)
• Variable neighborhood search: basics and variants (Q1707084) (← links)
• \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming (Q1730740) (← links)
• Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843) (← links)
• Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results (Q1761890) (← links)
• A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
• Local search and constraint programming for the post enrolment-based course timetabling problem (Q1761894) (← links)
• Curriculum based course timetabling: new solutions to Udine benchmark instances (Q1761906) (← links)
• On the performance of scatter search for post-enrolment course timetabling problems (Q2015784) (← links)
• Iterated responsive threshold search for the quadratic multiple knapsack problem (Q2341207) (← links)
• An overview of curriculum-based course timetabling (Q2355018) (← links)
• Adaptive tabu search for course timetabling (Q2379550) (← links)
• The minimum shift design problem (Q2468734) (← links)
• Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics (Q2669512) (← links)