A polyhedral study of dynamic monopolies

DOI10.1007/s10479-018-3107-5zbMath1434.90100OpenAlexW2904302938MaRDI QIDQ2288851

Babak Moazzez, Hossein Soltani

Publication date: 20 January 2020

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-018-3107-5

zbMATH Keywords

integer programmingfacetsdynamic monopoly

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Target set selection with maximum activation time ⋮ Facets of the dynamic monopoly polytope: linear ordering formulation ⋮ A polyhedral approach to least cost influence maximization in social networks

Uses Software

• Monopoly

Cites Work

• Unnamed Item
• Unnamed Item
• A study of monopolies in graphs
• On dynamic monopolies of graphs with general thresholds
• Combinatorial model and bounds for target set selection
• On dynamic monopolies of graphs: the average and strict majority thresholds
• Dynamic monopolies in tori.
• Integer programming approach to static monopolies in graphs
• Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
• Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
• ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS
• Least-Cost Influence Maximization on Social Networks
• Facet of regular 0–1 polytopes

This page was built for publication: A polyhedral study of dynamic monopolies