Minimum cost edge blocker clique problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1786225 (Why is no real title available?)
- scientific article; zbMATH DE number 871953 (Why is no real title available?)
- scientific article; zbMATH DE number 1424314 (Why is no real title available?)
- A class of algorithms for mixed-integer bilevel min-max optimization
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A review on algorithms for maximum clique problems
- An integer programming framework for critical elements detection in graphs
- Blockers and transversals
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- Bound and exact methods for assessing link vulnerability in complex networks
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Clique-detection models in computational biochemistry and genomics
- Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
- Complexity of the critical node problem over trees
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- Detecting critical nodes in sparse graphs
- Deterministic network interdiction
- Exact identification of critical nodes in sparse networks via new compact formulations
- Minimum edge blocker dominating set problem
- Minimum vertex blocker clique problem
- Network flow interdiction on planar graphs
- On biconnected and fragile subgraphs of low diameter
- On cliques in graphs
- On short paths interdiction problems: Total and node-wise limited interdiction
- Optimal interdiction policy for a flow network
- Reducibility among combinatorial problems
- Removing Arcs from a Network
- Shortest-path network interdiction
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- The most vital edges in the minimum spanning tree problem
- The most vital nodes with respect to independent set and vertex cover
- Two extended formulations for cardinality maximum flow network interdiction problem
Cited in
(11)- A branch-and-cut algorithm for the edge interdiction clique problem
- On supervalid inequalities for binary interdiction games
- Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
- The maximum clique interdiction problem
- Exact algorithms for the minimum cost vertex blocker clique problem
- Minimum vertex blocker clique problem
- Minimum edge blocker dominating set problem
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
- The complexity of blocking all solutions
- Integer programming methods for solving binary interdiction games
- A survey on mixed-integer programming techniques in bilevel optimization
This page was built for publication: Minimum cost edge blocker clique problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q827246)
