The following pages link to The robust coloring problem. (Q1812001):
Displaying 15 items.
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems (Q445938) (← links)
- A column generation based algorithm for the robust graph coloring problem (Q516837) (← links)
- Scheduling for stability in single-machine production systems (Q835553) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- Fuzzy robust courses scheduling problem (Q1001153) (← links)
- Flow-based formulations for operational fixed interval scheduling problems with random delays (Q1789616) (← links)
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry (Q2184105) (← links)
- A branch-and-price algorithm for the robust graph coloring problem (Q2448920) (← links)
- The complexity of machine scheduling for stability with a single disrupted job (Q2488217) (← links)
- A hybrid algorithm for the robust graph coloring problem (Q3178960) (← links)
- Heuristics for the robust coloring problem (Q5177316) (← links)
- AI 2003: Advances in Artificial Intelligence (Q5191586) (← links)
- Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling (Q5497725) (← links)
- New results on the robust coloring problem (Q6127005) (← links)
