A Lagrangian Relaxation for the Maximum Stable Set Problem

Details A Lagrangian Relaxation for the Maximum Stable Set Problem A Lagrangian Relaxation for the Maximum Stable Set Problem

2009-03-08

arxiv.org/abs/0903.1407v1

Computer Science

Discrete Mathematics

Submitted to International Transactions on Operations Research

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Lagrangian Relaxation for the Maximum Stable Set Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Lagrangian Relaxation for the Maximum Stable Set Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Lagrangian Relaxation for the Maximum Stable Set Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-496819