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 ✦
A new separation algorithm for the Boolean quadric and cut polytopes
✍ Scribed by Letchford, Adam N.; Sørensen, Michael M.
- Book ID
- 125825787
- Publisher
- Elsevier Science
- Year
- 2014
- Tongue
- English
- Weight
- 431 KB
- Volume
- 14
- Category
- Article
- ISSN
- 1572-5286
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
The volume of relaxed Boolean-quadric an
✍
Chun-Wa Ko; Jon Lee; Einar Steingrímsson
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 230 KB
For n ~> 2, the boolean quadric polytope ~, is the convex hull in d:= (~ l) dimensions of the binary solutions xixj = Yo, for all i < j in N := { I. 2 ..... n}. The polytope is naturally modeled by a somewhat larger polytope; namely, .~ the solution set of Yo <~x~, yo<~xj. x~ + xj <<. 1 + Yo, Yo >1
A simultaneous lifting strategy for iden
✍
Hanif D. Sherali; Youngho Lee; Warren P. Adams
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 477 KB
Lifting and separation procedures for th
✍
Thorsten Bonato, Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi
📂
Article
📅
2013
🏛
Springer-Verlag
🌐
English
⚖ 675 KB
A separation algorithm for the matchable
✍
William H. Cunningham; Jan Green-Krótki
📂
Article
📅
1994
🏛
Springer-Verlag
🌐
English
⚖ 820 KB
A new scaling algorithm for the maximum
✍
Kazuo Iwano; Shinji Misono; Shu Tezuka; Satoru Fujishige
📂
Article
📅
1994
🏛
Springer
🌐
English
⚖ 673 KB