A heuristic for the convex recoloring problem in graphs

DOI10.1111/itor.12896OpenAlexW3096161649MaRDI QIDQ6071077

Zanoni Dias, Unnamed Author, Cid Carvalho De Souza

Publication date: 27 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12896

zbMATH Keywords

combinatorial optimizationGRASPconvex recoloring

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• The convex recoloring problem: polyhedra, facets and computational experiments
• Improved approximation algorithm for convex recoloring of trees
• Convex recolorings of strings and trees: Definitions, hardness results and algorithms
• An extended formulation of the convex recoloring problem on a tree
• Column generation approach to the convex recoloring problem on a tree
• Greedy randomized adaptive search procedures
• Partial convex recolorings of trees and galled networks
• Connected Coloring Completion for General Graphs: Algorithms and Complexity
• On the Complexity of Solving or Approximating Convex Recoloring Problems

This page was built for publication: A heuristic for the convex recoloring problem in graphs