Solution methods for the vertex variant of the network system vulnerability analysis problem
I. A. Nazarova · Journal of Computer and Systems Sciences International · 2009
The problem of multicommodity network vulnerability analysis with account of a complete break-down of one or more vertices is considered. The problem is formalized as a bicriterion lexicographic optimization problem. The criterion of efficiency for the network operation is chosen to be a guaranteed estimate for the loss of users. Some particular cases are investigated using flow and graph-theoretical methods and the corresponding algorithms are specified. In the remaining cases, combinatorial and other methods are proposed.