Separating multi-oddity constrained shortest circuits over the polytope of stable multisets
OPERATIONS RESEARCH LETTERS. Bd. 32. H. 2. 2004 S. 181 - 184
Erscheinungsjahr: 2004
ISBN/ISSN: 0167-6377
Publikationstyp: Zeitschriftenaufsatz
Doi/URN: 10.1016/j.orl.2003.05.001
| Geprüft | Bibliothek |
Inhaltszusammenfassung
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. (C) 2003 Elsevier B.V. All rights reserved.
