Pages that link to "Item:Q1096533"
From MaRDI portal
The following pages link to A graph coloring algorithm for large scale scheduling problems (Q1096533):
Displaying 21 items.
- A graph coloring approach to the deployment scheduling and unit assignment problem (Q283268) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- A column generation based algorithm for the robust graph coloring problem (Q516837) (← links)
- Graph colouring approaches for a satellite range scheduling problem (Q835607) (← links)
- List-graph colouring for multiple depot vehicle scheduling (Q843401) (← links)
- A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding (Q869001) (← 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)
- The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918) (← links)
- Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306) (← links)
- Graph theory applied in school schedule network (Q2910757) (← links)
- A Pruning Procedure for Exact Graph Coloring (Q4015385) (← links)
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques (Q5085477) (← links)
- (Q5111006) (← links)
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem (Q5136236) (← links)
- (Q5152650) (← links)
- (Q5457679) (← links)
- “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)
- Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling (Q5497725) (← links)
