Survivability in hierarchical telecommunications networks under dual homing
Year of publication: |
2014
|
---|---|
Authors: | Karaşan, Oya Ekin ; Mahjoub, Ali Ridha ; Özkök, Onur ; Yaman, Hande |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 26.2014, 1, p. 1-15
|
Subject: | hierarchical network design | two-edge connectedness | dual-homing survivability | facets | branch and cut | variable fixing |
-
The team orienteering arc routing problem
Archetti, Claudia, (2014)
-
The generalized arc routing problem
Aráoz, Julián, (2017)
-
Regenerator location problem : polyhedral study and effective branch-and-cut algorithms
Li, Xiangyong, (2017)
- More ...
-
A branch-and-cut algorithm for the alternative fuel refueling station location problem with routing
Arslan, Okan, (2019)
-
Time constrained maximal covering salesman problem with weighted demands and partial coverage
Tiniç, Gizem Özbaygın, (2016)
-
Branch-and-price approaches for the network design problem with relays
Yıldız, Barış, (2018)
- More ...