| Article ID: | iaor20043258 |
| Country: | Netherlands |
| Volume: | 32 |
| Issue: | 2 |
| Start Page Number: | 181 |
| End Page Number: | 184 |
| Publication Date: | Mar 2004 |
| Journal: | Operations Research Letters |
| Authors: | Cheng Eddie, Vries Sven de |
The maximum stable set problem is NP-hard. Koster and Zymolka introduced as a generalization the stable multiset problem by allowing vertices multiple times subject to vertex- and edge capacities and introduced cycle inequalities. We derive an efficient separation algorithm for them.