Integer programming approach to static monopolies in graphs

DOI10.1007/s10878-018-0256-zzbMath1387.90145MaRDI QIDQ1752610

Hossein Soltani, Babak Moazzez

Publication date: 24 May 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0256-z

zbMATH Keywords

integer programming; polytopes; valid inequalities; cactus graphs; majority thresholds; static monopoly

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C10: Integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

Monopoly

Uses Software

• NetworkX
• Gurobi
• Cbc
• PORTA
• CLP