✦ LIBER ✦

A separation algorithm for the matchable set polytope

✍ Scribed by William H. Cunningham; Jan Green-Krótki

Publisher: Springer-Verlag
Year: 1994
Tongue: English
Weight: 820 KB
Volume: 65
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01581694

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On separation and adjacency problems for

On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph

✍ Ning Qi 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 296 KB

Separation algorithms for 0-1 knapsack p

Separation algorithms for 0-1 knapsack polytopes

✍ Konstantinos Kaparis; Adam N. Letchford 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 251 KB

Linear-time separation algorithms for th

Linear-time separation algorithms for the three-index assignment polytope

✍ Egon Balas; Liqun Qi 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 641 KB

Gear composition and the stable set poly

Gear composition and the stable set polytope

✍ A. Galluccio; C. Gentile; P. Ventura 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 414 KB

We present a new graph composition that produces a graph G from a given graph H and a fixed graph B called gear and we study its polyhedral properties. This composition yields counterexamples to a conjecture on the facial structure of STAB(G) when G is claw-free.

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

On the facial structure of the set cover

On the facial structure of the set covering polytope

✍ A. Sassano 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 892 KB