Article ID: | iaor20022479 |
Country: | United Kingdom |
Volume: | 29 |
Issue: | 3 |
Start Page Number: | 205 |
End Page Number: | 219 |
Publication Date: | Mar 2002 |
Journal: | Computers and Operations Research |
Authors: | Curet Norman D., Vinney Jason de, Gaston Matthew E. |
Cutset algorithms have been well documented in the operations research literature. A directed graph is used to model the network, where each node and arc has an associated cost to cut or remove it from the graph. The problem considered in this paper is to determine all minimum cost sets of nodes and/or arcs to cut so that no directed paths exist from a specified source node