✦ LIBER ✦

Separation of Antiweb-Wheel Inequalities Over Stable Set Polytopes

✍ Scribed by Eddie Cheng; Sven de Vries

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 758 KB
Volume: 11
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00063-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Antiweb-wheel inequalities and their sep

Antiweb-wheel inequalities and their separation problems over the stable set polytopes

✍ Eddie Cheng; Sven de Vries 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 251 KB

Clique family inequalities for the stabl

Clique family inequalities for the stable set polytope of quasi-line graphs

✍ G. Oriolo 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 248 KB

In one of fundamental works in combinatorial optimization, Edmonds gave a complete linear description of the matching polytope. Matchings in a graph are equivalent to stable sets in its line graph. Also the neighborhood of any vertex in a line graph partitions into two cliques: graphs with this latt

Separating multi-oddity constrained shor

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

✍ Eddie Cheng; Sven de Vries 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 173 KB

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.