✦ LIBER ✦

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

✍ Scribed by Diarrassouba, Ibrahima; Kutucu, Hakan; Ridha Mahjoub, A.

Book ID: 122781872
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 171 KB
Volume: 41
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2013.05.137

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two Edge-Disjoint Hop-Constrained Paths

Two Edge-Disjoint Hop-Constrained Paths and Polyhedra

✍ Huygens, David; Mahjoub, Ali Ridha; Pesneau, Pierre 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 305 KB

Hop-Constrained Node Survivable Network

Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM

✍ Luís Gouveia; Pedro Patrício; Amaro de Sousa 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 460 KB

The two-edge connected hop-constrained n

The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut

✍ David Huygens; Martine Labbé; A. Ridha Mahjoub; Pierre Pesneau 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 389 KB

## Abstract This article deals with the Two‐edge connected Hop‐constrained Network Design Problem (or THNDP for short). Given a weighted graph __G__ = (__N__,__E__), an integer __L__ ≥ 2, and a subset of pairs of nodes __D__, the problem consists of finding the minimum cost subgraph in __G__ contai