A heuristic for the minimum cost chromatic partition problem

Abstract

The graph coloring problem consists in coloring the vertices of a graph G = (V, E) with a minimum number of colors, such as that any two adjacent vertices receive different colors. The minimum cost chromatic partition problem (MCCPP) is an extension of the graph coloring problem in which there are costs associated with the colors and one seeks a vertex coloring minimizing the sum of the costs of the colors used in each vertex. The problem finds applications in VLSI design and in some scheduling problems modeled on interval graphs. We propose a trajectory search heuristic using local search, path-relinking, and perturbations for solving MCCPP and discuss computational results.Mathematics Subject Classification. 90C27, 68R10.

A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem

“…Applications reported, for example, by Pessoa et al. (), Interian and Ribeiro (), and Ribeiro and Santos () illustrate the speedups in the average times to target solution value obtained by the hybridization of GRASP with path‐relinking heuristics with restart strategies. The pseudo‐code in Fig.…”