A cutting-plane algorithm for solving a weighted influence interdiction problem
From MaRDI portal
Publication:2436687
DOI10.1007/s10589-013-9589-9zbMath1308.91040OpenAlexW2045443989MaRDI QIDQ2436687
J. Cole Smith, My T. Thai, Mehdi Hemmati
Publication date: 25 February 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9589-9
Programming involving graphs or networks (90C35) Integer programming (90C10) 2-person games (91A05) Games involving graphs (91A43) Applications of game theory (91A80)
Related Items (10)
Exact and approximation algorithms for sensor placement against DDoS attacks ⋮ Bilevel Knapsack with Interdiction Constraints ⋮ The referenced vertex ordering problem: theory, applications, and solution methods ⋮ Optimal Containment of Misinformation in Social Media: A Scenario-Based Approach ⋮ A branch‐and‐cut approach for the least cost influence problem on social networks ⋮ Influence maximization with deactivation in social networks ⋮ Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks ⋮ An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections ⋮ EIA-CNDP: an exact iterative algorithm for critical node detection problem ⋮ Multilevel Approaches for the Critical Node Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic network interdiction
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Power domination in graphs
- Emergence of Scaling in Random Networks
- On the Approximability of Influence in Social Networks
- An analysis of approximations for maximizing submodular set functions—I
- Fundamentals of Computation Theory
This page was built for publication: A cutting-plane algorithm for solving a weighted influence interdiction problem
