Pages that link to "Item:Q1356739"
From MaRDI portal
The following pages link to Restricted coloring models for timetabling (Q1356739):
Displaying 17 items.
- A survey of search methodologies and automated system development for examination timetabling (Q835639) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- The combinatorics of timetabling (Q1278524) (← links)
- On a multiconstrained model for chromatic scheduling (Q1293198) (← links)
- On the complexity of a restricted list-coloring problem (Q1296975) (← links)
- Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
- Complexity of some special types of timetabling problems (Q1600003) (← links)
- Partially concurrent open shop scheduling with integral preemptions (Q1698281) (← links)
- A flow based pruning scheme for enumerative equitable coloring algorithms (Q1730611) (← links)
- Solving university course timetabling problems using constriction particle swarm optimization with local search (Q1736554) (← links)
- Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- Bounded colouring motivated by the limited resource partially concurrent open shop problem (Q2241155) (← links)
- Proportional choosability: a new list analogue of equitable coloring (Q2319722) (← links)
- New results in two identical machines scheduling with agreement graphs (Q2420580) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)
- Scheduling with machine conflicts (Q6176548) (← links)