Solving the minimum sum coloring problem via binary quadratic programming
Data Structures and Algorithms
2013-04-23 v1 Discrete Mathematics
Abstract
In recent years, binary quadratic programming (BQP) has been successively applied to solve several combinatorial optimization problems. We consider in this paper a study of using the BQP model to solve the minimum sum coloring problem (MSCP). For this purpose, we recast the MSCP with a quadratic model which is then solved via a recently proposed Path Relinking (PR) algorithm designed for the general BQP. Based on a set of MSCP benchmark instances, we investigate the performance of this solution approach compared with existing methods.
Cite
@article{arxiv.1304.5876,
title = {Solving the minimum sum coloring problem via binary quadratic programming},
author = {Yang Wang and Jin-Kao Hao and Fred Glover and Zhipeng Lü},
journal= {arXiv preprint arXiv:1304.5876},
year = {2013}
}
Comments
Short pre-print