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 theory; Graph coloring; Timetabling

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

90C27: Combinatorial optimization

05C15: Coloring of graphs and hypergraphs

Related Items

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

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