𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities

✍ Scribed by Gollowitzer, Stefan; Gouveia, Luis; Ljubić, Ivana

Book ID
119234597
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
495 KB
Volume
225
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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