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