A heuristic for the minimum cost chromatic partition problem.

Celso C. Ribeiro Philippe L. F. dos Santos

Published in: RAIRO Oper. Res. (2020)

Keyphrases

minimum cost
np hard
approximation algorithms
network flow
spanning tree
network flow problem
network simplex algorithm
optimal solution
minimum cost flow
color images
capacity constraints
search algorithm
upper bound
feasible solution
combinatorial optimization
special case
lower bound