Minimum cost edge blocker clique problem
From MaRDI portal
Publication:827246
DOI10.1007/s10479-019-03315-xzbMath1456.90168OpenAlexW2963128532WikidataQ127447228 ScholiaQ127447228MaRDI QIDQ827246
Publication date: 7 January 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-019-03315-x
Related Items (3)
Integer programming methods for solving binary interdiction games ⋮ Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem ⋮ A survey on mixed-integer programming techniques in bilevel optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum edge blocker dominating set problem
- A class of algorithms for mixed-integer bilevel min-max optimization
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- Bound and exact methods for assessing link vulnerability in complex networks
- An integer programming framework for critical elements detection in graphs
- The most vital nodes with respect to independent set and vertex cover
- Complexity of the critical node problem over trees
- On short paths interdiction problems: Total and node-wise limited interdiction
- Network flow interdiction on planar graphs
- Detecting critical nodes in sparse graphs
- Blockers and transversals
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- The most vital edges in the minimum spanning tree problem
- On biconnected and fragile subgraphs of low diameter
- Deterministic network interdiction
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- Exact identification of critical nodes in sparse networks via new compact formulations
- Clique-detection models in computational biochemistry and genomics
- A review on algorithms for maximum clique problems
- Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- Two extended formulations for cardinality maximum flow network interdiction problem
- Minimum vertex blocker clique problem
- Shortest-path network interdiction
- Reducibility among Combinatorial Problems
- Removing Arcs from a Network
- Optimal interdiction policy for a flow network
- On cliques in graphs
This page was built for publication: Minimum cost edge blocker clique problem
