TY - CHAP
T1 - Selected Topics in Critical Element Detection
AU - Walteros, Jose L.
AU - Pardalos, Panos M.
N1 - Publisher Copyright:
© 2012, Springer Science+Business Media New York.
PY - 2012
Y1 - 2012
N2 - In this paper we consider the problem of detecting critical elements in networks. The objective of these problems is to identify a subset of elements (i.e., nodes, arcs, paths, cliques, etc.) whose deletion minimizes a given connectivity measure over the resulting network. This paper surveys some of the recent advances for solving these kinds of problems including heuristic, mathematical programming, approximated algorithms, and dynamic programming approaches.
AB - In this paper we consider the problem of detecting critical elements in networks. The objective of these problems is to identify a subset of elements (i.e., nodes, arcs, paths, cliques, etc.) whose deletion minimizes a given connectivity measure over the resulting network. This paper surveys some of the recent advances for solving these kinds of problems including heuristic, mathematical programming, approximated algorithms, and dynamic programming approaches.
KW - Critical clique detection
KW - Critical element detection
KW - Critical node problem
UR - https://www.scopus.com/pages/publications/84903591225
U2 - 10.1007/978-1-4614-4109-0_2
DO - 10.1007/978-1-4614-4109-0_2
M3 - Chapter
AN - SCOPUS:84903591225
T3 - Springer Optimization and Its Applications
SP - 9
EP - 26
BT - Springer Optimization and Its Applications
PB - Springer
ER -