Network disconnection problems in a centralized network |
| |
| Authors: | Young‐Soo Myung Hyun‐Joon Kim |
| |
| Institution: | 1. Department of Business Administration, Dankook University, Cheonan, Chungnam 330‐714, KoreaDepartment of Business Administration, Dankook University, Cheonan, Chungnam 330‐714, Korea;2. Department of Management Information Systems, University of Ulsan, Ulsan 680‐749, Korea |
| |
| Abstract: | We consider three network disconnection problems in a centralized network where a source node provides service to the other nodes, called demand nodes. In network disconnection problems, each demand node gets a certain benefit when connected to a source node and a network attacker destroys edges to prevent demand nodes from achieving benefits. As destroying edges incurs expenses, an attacker considers the following three different strategies. The first is to maximize the sum of benefits of the disconnected nodes while keeping the total edge destruction cost no more than a given budget. The second is to minimize the total destruction cost needed to make a certain amount of benefits not accomplished. The last is to minimize the ratio of the total destruction cost to the benefits not accomplished. In this paper, we develop exact algorithms to solve the above three problems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 |
| |
| Keywords: | network disconnection centralized network parametric network flow algorithm |
|
|
