A Lagrangian Relaxation for the Maximum Stable Set Problem
Discrete Mathematics
2009-03-10 v1 Data Structures and Algorithms
Abstract
We propose a new integer programming formulation for the problem of finding a maximum stable set of a graph based on representatives of stable sets. In addition, we investigate exact solutions provided by a Lagrangian decomposition of this formulation in which only one constraint is relaxed. Some computational experiments were carried out with an effective multi-threaded implementation of our algorithm in a multi-core system, and their results are presented.
Cite
@article{arxiv.0903.1407,
title = {A Lagrangian Relaxation for the Maximum Stable Set Problem},
author = {Manoel Campelo and Ricardo C. Correa},
journal= {arXiv preprint arXiv:0903.1407},
year = {2009}
}
Comments
Submitted to International Transactions on Operations Research