𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut

✍ Scribed by B. Fortz; A. R. Mahjoub; S. T. McCormick; P. Pesneau

Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
267 KB
Volume
105
Category
Article
ISSN
0025-5610

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