Solving the Generalized Steiner Problem in edge-survivable networks
The Generalized Steiner Problem with Edge-Connectivity constraints (GSP-EC) consists of computing the minimal cost subnetwork of a given feasible network where some pairs of nodes must satisfy edge-connectivity requirements. It can be applied in the design of communications networks where connection...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | report |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.12008/3461 |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: Solving the Generalized Steiner Problem in edge-survivable networks
- GRASP heuristics for Wide Area Network design
- The capacitated m two node survivable star problem
- A multi-objective metaheuristic approach for the transit network design problem
- Problema General de Steiner en Grafos :Resultados y algoritmos GRASP para la versión arista-disjunta
- A Survivable & Reliable Network Topological Design Model
- Optimal design of an IP/MPLS over DWDM network