Pages that link to "Item:Q1293198"
From MaRDI portal
The following pages link to On a multiconstrained model for chromatic scheduling (Q1293198):
Displaying 15 items.
- Cyclic transfers in school timetabling (Q421072) (← links)
- Consensus models: computational complexity aspects in modern approaches to the list coloring problem (Q638544) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- A graph colouring model for assigning a heterogeneous workforce to a given schedule (Q1266545) (← links)
- Extensions of coloring models for scheduling purposes (Q1268282) (← links)
- Chromatic scheduling and frequency assignment (Q1327228) (← links)
- Restricted coloring models for timetabling (Q1356739) (← links)
- Preassignment requirements in chromatic scheduling (Q1363744) (← links)
- A flow based pruning scheme for enumerative equitable coloring algorithms (Q1730611) (← links)
- An XML format for benchmarks in high school timetabling (Q1761916) (← links)
- An exact method for graph coloring (Q2489282) (← links)
- Chromatic scheduling (Q2822599) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- Scheduling N Burgers for a k-Burger Grill: Chromatic Numbers With Restrictions (Q5225513) (← links)
- Mixed graph colouring as scheduling multi-processor tasks with equal processing times (Q6669643) (← links)