The robust coloring problem.

DOI10.1016/S0377-2217(02)00362-4zbMath1035.90077MaRDI QIDQ1812001

Javier Ramírez, Javier Yáñez

Publication date: 18 June 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Graph theoryGraph coloringTimetabling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Scheduling for stability in single-machine production systems ⋮ Inverse chromatic number problems in interval and permutation graphs ⋮ Grouping products for the optimization of production processes: a case in the steel manufacturing industry ⋮ New results on the robust coloring problem ⋮ A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems ⋮ A branch-and-price algorithm for the robust graph coloring problem ⋮ A column generation based algorithm for the robust graph coloring problem ⋮ The complexity of machine scheduling for stability with a single disrupted job ⋮ Flow-based formulations for operational fixed interval scheduling problems with random delays ⋮ Fuzzy robust courses scheduling problem ⋮ Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling

Cites Work

• Extensions of coloring models for scheduling purposes
• A continuous genetic algorithm designed for the global optimization of multimodal functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The robust coloring problem.