✦ LIBER ✦
Separating multi-oddity constrained shortest circuits over the polytope of stable multisets
✍ Scribed by Eddie Cheng; Sven de Vries
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 173 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
✦ Synopsis
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 e cient separation algorithm for them.