A branch-and-price approach for the maximum weight independent set problem

Authors:
Deepak Warrier;Wilbert E. Wilhelm;Jeffrey S. Warren;Illya V. Hicks
Affiliations:
Department of Industrial Engineering, Texas A&M University, TAMUS 3131, College Station, Texas 77843-3131;Department of Industrial Engineering, Texas A&M University, TAMUS 3131, College Station, Texas 77843-3131;Department of Industrial Engineering, Texas A&M University, TAMUS 3131, College Station, Texas 77843-3131;Department of Industrial Engineering, Texas A&M University, TAMUS 3131, College Station, Texas 77843-3131
Venue:
Networks
Year:
2005

Citing 0
Cited 2

A Branch and Cut solver for the maximum stable set problem

Journal of Combinatorial Optimization
ISBA: an independent set-based algorithm for automated partial reconfiguration module generation

Proceedings of the International Conference on Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

The maximum weight-independent set problem (MWISP) is one of the most well-known and well-studied problems in combinatorial optimization. This article presents a novel approach to solve MWISP exactly by decomposing the original graph into vertex-induced subgraphs. The approach solves MWISP for the original graph by solving MWISP on the subgraphs to generate columns for a branch-and-price framework. The authors investigate different implementation techniques that can be associated with the approach, and offer computational results to identify the strengths and weaknesses of each implementation technique. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 46(4), 198–209 2005