Pages that link to "Item:Q2436687"
From MaRDI portal
The following pages link to A cutting-plane algorithm for solving a weighted influence interdiction problem (Q2436687):
Displaying 10 items.
- An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections (Q1756351) (← links)
- EIA-CNDP: an exact iterative algorithm for critical node detection problem (Q2027003) (← links)
- Exact and approximation algorithms for sensor placement against DDoS attacks (Q2140977) (← links)
- The referenced vertex ordering problem: theory, applications, and solution methods (Q2165588) (← links)
- Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks (Q2242189) (← links)
- Influence maximization with deactivation in social networks (Q2424770) (← links)
- Optimal Containment of Misinformation in Social Media: A Scenario-Based Approach (Q2942429) (← links)
- Bilevel Knapsack with Interdiction Constraints (Q3186662) (← links)
- Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
- A branch‐and‐cut approach for the least cost influence problem on social networks (Q6092651) (← links)
