Facets of the dynamic monopoly polytope: linear ordering formulation

DOI10.1016/j.disopt.2021.100641zbMath1506.90163OpenAlexW3136834530MaRDI QIDQ2042076

Hossein Soltani, Babak Moazzez

Publication date: 27 July 2021

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2021.100641

zbMATH Keywords

integer programmingfacetsvalid inequalitydynamic monopolylinear ordering polytope

Mathematics Subject Classification ID

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 (1)

A polyhedral approach to least cost influence maximization in social networks

Uses Software

• Monopoly

Cites Work

• 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
• On \(f\)-domination: polyhedral and algorithmic results
• A polyhedral study of dynamic monopolies
• Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
• Facets of the linear ordering polytope
• Combinatorial optimization. Theory and algorithms

This page was built for publication: Facets of the dynamic monopoly polytope: linear ordering formulation