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
β¦ LIBER β¦
Lifting facets of the cut polytope
β Scribed by Caterina De Simone
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 229 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The cut polytope and the Boolean quadric
β
Caterina De Simone
π
Article
π
1990
π
Elsevier Science
π
English
β 264 KB
New facets for the planar subgraph polyt
β
Illya V. Hicks
π
Article
π
2008
π
John Wiley and Sons
π
English
β 356 KB
Gap Inequalities for the Cut Polytope
β
Monique Laurent; Svatopluk Poljak
π
Article
π
1996
π
Elsevier Science
π
English
β 437 KB
Stability critical graphs and ranks face
β
E.C. Sewell; L.E. Trotter Jr.
π
Article
π
1995
π
Elsevier Science
π
English
β 616 KB
Rank inequalities due to stability critical (u-critical) graphs are used to develop a finite nested sequence of linear relaxations of the stable set polytope, the strongest of which provides an integral max-min relation: In a simple graph, the maximum size of a stable set is equal to the minimum (we
On a positive semidefinite relaxation of
β
Monique Laurent; Svatopluk Poljak
π
Article
π
1995
π
Elsevier Science
π
English
β 937 KB
The project scheduling polyhedron: Dimen
β
RamΓ³n Alvarez-ValdΓ©s OlaguΓbel; JosΓ©Manuel Tamarit Goerlich
π
Article
π
1993
π
Elsevier Science
π
English
β 959 KB