The robust coloring problem.

DOI10.1016/S0377-2217(02)00362-4MaRDI QIDQ1812001zbMATH OpenFDO

Authors Javier Yáñez, Javier Ramírez

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)

Recommendations

• Heuristics for the robust coloring problem
• A hybrid algorithm for the robust graph coloring problem
• The color-balanced spanning tree problem.
• Colouring Some Classes of Perfect Graphs Robustly
• A branch-and-price algorithm for the robust graph coloring problem
• The \(a\)-graph coloring problem
• New bounds on a hypercube coloring problem.

Cites work

• scientific article; zbMATH DE number 3672307 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1302184 (Why is no real title available?)
• scientific article; zbMATH DE number 1302199 (Why is no real title available?)
• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• A continuous genetic algorithm designed for the global optimization of multimodal functions
• Extensions of coloring models for scheduling purposes

Cited in

(15)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812001)