![]() |
Volumn 156, Issue 3, 2004, Pages 579-589
|
A cutting plane algorithm for computing k-edge survivability of a network
|
Author keywords
Cutting plane algorithm; Integer programming; Network survivability; Polyhedral analysis
|
Indexed keywords
ALGORITHMS;
COMPUTATIONAL METHODS;
COST EFFECTIVENESS;
FAILURE ANALYSIS;
FIBER OPTICS;
HEURISTIC METHODS;
INTEGER PROGRAMMING;
NETWORKS (CIRCUITS);
TELECOMMUNICATION TRAFFIC;
CUTTING PLANE ALGORITHMS;
NETWORK SURVIVABILITY;
POLYHEDRAL ANALYSIS;
OPERATIONS RESEARCH;
|
EID: 1642618985
PISSN: 03772217
EISSN: None
Source Type: Journal
DOI: 10.1016/S0377-2217(03)00135-8 Document Type: Article |
Times cited : (66)
|
References (13)
|