Lower and Upper Bounding Strategies for the Network Disconnection Problem
![]() |
김현준
(울산대학교 경영학부)
명영수 (단국대학교(천안) 경영학과) 박성수 (한국과학기술원 산업공학과) 오상민 (한국과학기술원 산업공학과) |
1 |
Computing the strength of a graph
/
DOI |
2 |
SONET toolkit : A decision support system for designing robust and cost-effective fiber-optic networks
/
DOI ScienceOn |
3 |
Mathematical Models and a Heuristic Algorithm for the Graph Disconnection Problem
/
|
4 |
Tabu Search-Part II
/
DOI |
5 |
A Cutting Plane Algorithm for Computing k-edge Survivability of a Network
/
|
6 |
Optimal attack and reinforcement of network
/
DOI ScienceOn |
7 |
Design of survivable networks
/
|
8 |
Future Paths for Integer Programming and Links to Artificial Intellingence
/
|
9 |
An improved algorithm for the graph disconnection problem
/
|
10 |
Tabu Search-Part I
/
DOI |
11 |
/
|
12 |
Design of communication networks with survivability constraints
/
DOI ScienceOn |
13 |
An algorithm for the graph disconnection problem
/
|
14 |
/
|
15 |
Computing the disconnectivity of graph
/
|
![]() |