✦ LIBER ✦

Primal separation for 0/1 polytopes

✍ Scribed by Friedrich Eisenbrand; Giovanni Rinaldi; Paolo Ventura

Publisher: Springer-Verlag
Year: 2003
Tongue: English
Weight: 241 KB
Volume: 95
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-002-0309-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Simple 0/1-Polytopes

✍ Volker Kaibel; Martin Wolff 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 100 KB

For general polytopes, it has turned out that with respect to many questions it suffices to consider only the simple polytopes, i.e., d-dimensional polytopes where every vertex is contained in only d facets. In this paper, we show that the situation is very different within the class of 0/1-polytope

All 0–1 polytopes are traveling salesman

All 0–1 polytopes are traveling salesman polytopes

✍ Louis J. Billera; A. Sarangarajan 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 578 KB

The hirsch conjecture is true for (0, 1)

The hirsch conjecture is true for (0, 1)-polytopes

✍ Denis Naddef 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 77 KB

On 0-1 Polytopes with Many Facets

✍ Imre Bárány; Attila Pór 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 159 KB

There exist n-dimensional 0-1 polytopes with as many as ( cn log n ) nÂ4 facets. This is our main result. It answers a question of Komei Fukuda and Gu nter M. Ziegler.

Computing low-capacity 0–1 knapsack poly

Computing low-capacity 0–1 knapsack polytopes

✍ P. L. Hammer; U. N. Peled 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 312 KB