Separating multi-oddity constrained shortest circuits over the polytope of stable multisets

Authors:
Eddie Cheng;Sven De Vries
Affiliations:
Department of Mathematics and Statistics, Oakland University, Rochester, MI 48309, USA;Zentrum Mathematik, TU München, D-85747 Garching bei München, Germany
Venue:
Operations Research Letters
Year:
2004

Citing 3
Cited 1

Habitat dispersion in forest planning and the stable set problem

Operations Research - Supplement
Wheel inequalities for stable set polytopes

Mathematical Programming: Series A and B
Weakly bipartite graphs and the Max-cut problem

Operations Research Letters

On cycles and the stable multi-set polytope

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.