✦ LIBER ✦

Generalized network design polyhedra

✍ Scribed by Corinne Feremans; Martine Labbé; Adam N. Letchford; Juan-José Salazar-González

Book ID: 102541452
Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 207 KB
Volume: 58
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20455

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On capacitated network design cut–set po

On capacitated network design cut–set polyhedra

✍ Alper Atamtürk 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 146 KB

On cut-based inequalities for capacitate

On cut-based inequalities for capacitated network design polyhedra

✍ Christian Raack; Arie M.C.A. Koster; Sebastian Orlowski; Roland Wessäly 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 375 KB

On splittable and unsplittable flow capa

On splittable and unsplittable flow capacitated network design arc–set polyhedra

✍ Alper Atamtürk; Deepak Rajan 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 193 KB

Two Node-Disjoint 3-Hop-Constrained Surv

Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and Polyhedra

✍ Diarrassouba, Ibrahima; Kutucu, Hakan; Ridha Mahjoub, A. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 171 KB

Inclusion test for general polyhedra

✍ F.R. Feito; J.C. Torres 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 580 KB

Generation of carbon-cage polyhedra

✍ X. Liu; D. J. Klein; T. G. Schmalz; W. A. Seitz 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 683 KB

The problem of the generation of polyhedra with degree-3 vertices, and faces each of which is pentagonal or hexagonal, is addressed in order to characterize carbon in order to characterize clusters of ca. 30 or more atoms. Following Eulerian type arguments such polyhedra are subcategorized in terms