IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v279y2019i1d10.1007_s10479-018-3107-5.html
   My bibliography  Save this article

A polyhedral study of dynamic monopolies

Author

Listed:
  • Hossein Soltani

    (Urmia University of Technology)

  • Babak Moazzez

    (Kennesaw State University)

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.

Suggested Citation

  • Hossein Soltani & Babak Moazzez, 2019. "A polyhedral study of dynamic monopolies," Annals of Operations Research, Springer, vol. 279(1), pages 71-87, August.
    • Handle: RePEc:spr:annopr:v:279:y:2019:i:1:d:10.1007_s10479-018-3107-5
    DOI: 10.1007/s10479-018-3107-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-018-3107-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-018-3107-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Babak Moazzez & Hossein Soltani, 2018. "Integer programming approach to static monopolies in graphs," Journal of Combinatorial Optimization, Springer, vol. 35(4), pages 1009-1041, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cheng-Lung Chen & Eduardo L. Pasiliao & Vladimir Boginski, 2023. "A polyhedral approach to least cost influence maximization in social networks," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-31, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Cheng-Lung Chen & Eduardo L. Pasiliao & Vladimir Boginski, 2023. "A polyhedral approach to least cost influence maximization in social networks," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-31, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:279:y:2019:i:1:d:10.1007_s10479-018-3107-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.