Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. (Q1417599)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. |
scientific article |
Statements
Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. (English)
0 references
5 January 2004
0 references
The stable multiset problem was introduced by \textit{A. Koster} and \textit{A. Zymolka} [Math. Methods Oper. Res. 56, 45--65 (2002; Zbl 1023.90086)] as a generalization of the maximum stable set problem (known to be NP-hard). An efficient separation algorithm for the stable multiset problem is presented.
0 references
stable set problem
0 references
stable multiset problem
0 references
efficient separation algorithm
0 references
odd valued odd cycle inequality
0 references
0 references
