Recycling solutions for vertex coloring heuristics

MaRDI QIDQ5013089zbMATH OpenFDO

Authors Yasutaka Uchida, Kaito Yajima, Kazuya Haraguchi

Publication date 26 November 2021

Full work available at URL https://arxiv.org/abs/1902.01206

zbMATH Keywords

heuristicsinitial solutionschedulingvertex coloring problemwarm start

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A metaheuristic approach for the vertex coloring problem
• scientific article; zbMATH DE number 4187836
• A survey on vertex coloring problems
• A new approach to the vertex coloring problem
• A graph coloring algorithm for large scale scheduling problems

This page was built for publication: Recycling solutions for vertex coloring heuristics

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