Considering the isolation set problem

Travis J. Herbranson, Richard F. Deckro, James W. Chrissis and Hamill, Jonathan (Todd)

European Journal of Operational Research, 2013, vol. 227, issue 2, 268-274

Abstract: Given a network, G=[N,E] the Isolation Set Problem (ISP) finds the set of arcs, D⊆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.

Keywords: Networks; Isolation Set Problem; Integer Program; Network Centric Warfare (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221712008405
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:227:y:2013:i:2:p:268-274

DOI: 10.1016/j.ejor.2012.11.016

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().