A polyhedral study of dynamic monopolies

Hossein Soltani () and Babak Moazzez ()
Additional contact information
Hossein Soltani: Urmia University of Technology
Babak Moazzez: Kennesaw State University

Annals of Operations Research, 2019, vol. 279, issue 1, No 3, 87 pages

Abstract: Abstract Spread of influence in a network can be modeled and studied within the concept of dynamic monopolies in graphs. We give an integer programming formulation for finding a minimum dynamic monopoly in an undirected graph. The corresponding 0–1 polytope and its facets are studied and several families of facet defining inequalities are introduced. Computational experiments have been performed to show the strength of the IP formulation and its facet defining inequalities.

Keywords: Integer programming; Dynamic monopoly; Facets; 90C10; 05C69; 90C57 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-018-3107-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:annopr:v:279:y:2019:i:1:d:10.1007_s10479-018-3107-5

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-018-3107-5

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().