A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem

A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem

The objective of this paper is to derive a tight and efficient lower bound for the minimum sum coloring problem. This NP-hard problem is a variant of the classical graph coloring problem where the objective is to minimize the sum of the colors. A column generation approach is proposed to solve the l...

Full description

Bibliographic Details
Main Authors: Mehdi Mrad, Olfa Harrabi, Jouhaina Chaouachi Siala, Anis Gharbi
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Chromatic sum
graph coloring
column generation
lower bound
Online Access:https://ieeexplore.ieee.org/document/8990124/

Internet

https://ieeexplore.ieee.org/document/8990124/

Similar Items