A compact mixed integer linear formulation for safe set problems
From MaRDI portal
Recommendations
Cites work
- A genetic algorithm for a class of critical node problems
- A new formulation for the safe set problem on graphs
- An integer programming framework for critical elements detection in graphs
- Collective dynamics of `small-world' networks
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Detecting critical nodes in sparse graphs
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Network majority on tree topological network
- On the approximability of positive influence dominating set in social networks
- Positive Influence Dominating Set in Online Social Networks
- Safe set problem on graphs
- Safe sets in graphs: graph classes and structural parameters
- Safe sets, network majority on weighted trees
- The k-separator problem: polyhedra, complexity and approximation results
- The critical node detection problem in networks: a survey
- The minimum connected dominating set problem: formulation, valid inequalities and a branch-and-cut algorithm
- The vertex \(k\)-cut problem
- The vertex separator problem: a polyhedral investigation
Cited in
(5)
This page was built for publication: A compact mixed integer linear formulation for safe set problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228393)
