Integer programming approach to static monopolies in graphs
type: Item
instance of: scholarly article
title: Integer programming approach to static monopolies in graphs
zbMATH Open document ID: 1387.90145
author: Babak Moazzez
author: Hossein Soltani
published in: Journal of Combinatorial Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6872595
zbMATH Keywords: static monopoly
zbMATH Keywords: integer programming
zbMATH Keywords: polytopes
zbMATH Keywords: valid inequalities
zbMATH Keywords: cactus graphs
zbMATH Keywords: majority thresholds
describes a project that uses: CLP
describes a project that uses: Gurobi
describes a project that uses: NetworkX
describes a project that uses: Cbc
describes a project that uses: PORTA
MaRDI profile type: Publication
full work available at URL: s10878-018-0256-z
OpenAlex ID: W2786376884
cites work: Combinatorial model and bounds for target set selection
cites work: On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
cites work: On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
cites work: Q5422499
cites work: Spread of influence in weighted networks under time and budget constraints
cites work: On the 0,1 facets of the set covering polytope
cites work: Q3267900
cites work: Q4368728
cites work: A linear algorithm for finding a minimum dominating set in a cactus
cites work: Q2941641
cites work: On dynamic monopolies of graphs: the average and strict majority thresholds
cites work: A study of monopolies in graphs
cites work: Combinatorial algorithms on a class of graphs
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: Q5747187
cites work: Q4943600
cites work: On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\)
cites work: On the facial structure of the set covering polytope
cites work: On the global offensive alliance number of a graph
cites work: ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS
cites work: On dynamic monopolies of graphs with general thresholds
DOI: 10.1007/S10878-018-0256-Z
Recommended article: A study of monopolies in graphs
Recommended article: Q4566364
Recommended article: On dynamic monopolies of graphs with general thresholds
Recommended article: Dynamic monopolies for interval graphs with bounded thresholds
Recommended article: Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives
Recommended article: Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
Recommended article: Applications and efficient algorithms for integer programming problems on monotone constraints
Recommended article: ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS
Recommended article: On monopoly and dynamic monopoly of Cartesian product of graphs with constant thresholds
Recommended article: Integer Programming Subject to Monomial Constraints
description: scientific article; zbMATH DE number 6872595