Considering the isolation set problem

Travis J. Herbranson

doi:10.1016/j.ejor.2012.11.016

Return

Considering the isolation set problem

2013-06-01

PRE

DOI：10.1016/j.ejor.2012.11.016

Original

Original request for help

Save

Abstract

En 中文

Given a network, G = [N,E] the Isolation Set Problem (ISP) finds the set of arcs, D c E, that when removed will separate a predefined set of r distinguished nodes [2]. This involves eliminating connections from a specific set of nodes to the rest of a network. In our increasingly interconnected network-centric world, this might be isolating various units from Headquarters; isolating a portion of a computer network to disrupt communications or to quarantine a virus or some other form of cyber attack; or isolating a cell or sub-group in a terrorist or dark network, for example. The research presented here reviews the ISP, addresses the totally unimodular character of the ISP, offers a node consolidation method, provides for the inclusion of nodes in the cut sets, and introduces resource constraints to the ISP. An example is presented to illustrate the approach. Published by Elsevier B.V.

Keywords:

Networks

Isolation Set Problem

Integer Program

Network Centric Warfare

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.