Pages that link to "Item:Q1179200"
From MaRDI portal
The following pages link to Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths (Q1179200):
Displaying 16 items.
- On a reduction of the interval coloring problem to a series of bandwidth coloring problems (Q633552) (← links)
- School timetabling for quality student and teacher schedules (Q842557) (← links)
- About equivalent interval colorings of weighted graphs (Q967426) (← links)
- Modelling and solving an acyclic multi-period timetabling problem (Q1186307) (← links)
- Finding a feasible course schedule using Tabu search (Q1186313) (← links)
- Distribution requirements and compactness constraints in school timetabling (Q1291590) (← links)
- The course scheduling problem at Lufthansa technical training (Q1303529) (← links)
- Hybrid heuristics for examination timetabling problem (Q1774877) (← links)
- Comparison of metaheuristic algorithms for examination timetabling problem (Q1885092) (← links)
- Scheduling independent tasks with multiple modes (Q1900136) (← links)
- On the use of some known methods for \(T\)-colorings of graphs (Q2367012) (← links)
- CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
- Iterative coloring extension of a maximum clique (Q4544221) (← links)
- An integer program and a hybrid genetic algorithm for the university timetabling problem (Q5268943) (← links)
- Implementation of a university course and examination timetabling system (Q5932035) (← links)
- Comparability graph augmentation for some multiprocessor scheduling problems (Q5961606) (← links)
