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

@article{Warrier2005ABA,
  title={A branch-and-price approach for the maximum weight independent set problem},
  author={Deepak Warrier and Wilbert E. Wilhelm and Jeffrey S. Warren and Illya V. Hicks},
  journal={Networks},
  year={2005},
  volume={46},
  pages={198-209}
}
The maximum weight independent set problem (MWISP) is one of the most well-known and wellstudied problems in combinatorial optimization. This paper presents a novel approach to solve MWISP exactly by decomposing the original graph into vertex-induced sub-graphs. The approach solves MWISP for the original graph by solving MWISP on the sub-graphs in order to generate columns for a branch-and-price framework. The authors investigate different implementation techniques that can be associated with… CONTINUE READING