A heuristic for the minimum cost chromatic partition problem

DOI10.1051/RO/2019037MaRDI QIDQ5109809zbMATH OpenOpenAlexWikidataFDO

Authors Philippe L. F. dos Santos, Celso C. Ribeiro

Publication date 13 May 2020

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2019037

zbMATH Keywords

graph coloring problemmetaheuristicsminimum cost chromatic partition problempath-relinkingtrajectory search heuristic

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Approximation results for the optimum cost chromatic partition problem
• Approximation Results for the Optimum Cost Chromatic Partition Problem
• A metaheuristic approach for the vertex coloring problem
• scientific article; zbMATH DE number 1163713
• scientific article; zbMATH DE number 4187836

Cited in

(2)

• Computing lower bounds for minimum sum coloring and optimum cost chromatic partition
• A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem

This page was built for publication: A heuristic for the minimum cost chromatic partition problem

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