𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On thek-cut subgraph polytope

✍ Scribed by Kalyan T. Talluri; Donald K. Wagner

Publisher
Springer-Verlag
Year
1994
Tongue
English
Weight
774 KB
Volume
67
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the acyclic subgraph polytope
On the acyclic subgraph polytope
✍ Martin GrΓΆtschel; Michael JΓΌnger; Gerhard Reinelt πŸ“‚ Article πŸ“… 1985 πŸ› Springer-Verlag 🌐 English βš– 768 KB
On two-connected subgraph polytopes
On two-connected subgraph polytopes
✍ Francisco Barahona; Ali Ridha Mahjoub πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 674 KB

We further study some known families of valid inequalities for the 2-edge-connected and 2-node-connected subgraph polytopes. For the 2-edge-connected case, we show that the odd wheel inequalities together with the obvious constraints give a complete description of the polytope for Halin graphs. For

Small bipartite subgraph polytopes
Small bipartite subgraph polytopes
✍ Laura Galli; Adam N. Letchford πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 272 KB
The cut polytope and the Boolean quadric
The cut polytope and the Boolean quadric polytope
✍ Caterina De Simone πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 264 KB

In 1983 Barahona defined the class of cut polytopes; recently Padberg defined the class of Boolean quadric polytopes. We show that every Boolean quadric polytope is the image of a cut polytope under a bijective linear transformation, and so studying Boolean quadric polytopes reduces to studying spe