Minimum vertex blocker clique problem
From MaRDI portal
Publication:4642478
DOI10.1002/net.21556zbMath1390.90183OpenAlexW2162275416MaRDI QIDQ4642478
Foad Mahdavi Pajouh, Eduardo L. Pasiliao, Vladimir L. Boginski
Publication date: 23 May 2018
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21556
Related Items (34)
Minimum cost edge blocker clique problem ⋮ Exact algorithms for the minimum cost vertex blocker clique problem ⋮ Minimum edge blocker dominating set problem ⋮ A class of algorithms for mixed-integer bilevel min-max optimization ⋮ Integer Programming Formulations for Minimum Spanning Tree Interdiction ⋮ Reducing the chromatic number by vertex or edge deletions ⋮ Integer programming methods for solving binary interdiction games ⋮ Contraction Blockers for Graphs with Forbidden Induced Paths ⋮ Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem ⋮ A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem ⋮ Logic-based Benders decomposition for wildfire suppression ⋮ Exact solution approaches for a class of bilevel fractional programs ⋮ Assistance and interdiction problems on interval graphs ⋮ Reducing the vertex cover number via edge contractions ⋮ Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations ⋮ On designing networks resilient to clique blockers ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ The complexity of blocking (semi)total dominating sets with edge contractions ⋮ Reducing the domination number of graphs via edge contractions and vertex deletions ⋮ Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ Critical vertices and edges in \(H\)-free graphs ⋮ The maximum clique interdiction problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Contraction and deletion blockers for perfect graphs and \(H\)-free graphs ⋮ A branch-and-cut algorithm for the edge interdiction clique problem ⋮ Algorithms and applications for a class of bilevel MILPs ⋮ Blocking total dominating sets via edge contractions ⋮ Reducing graph transversals via edge contractions ⋮ A survey of network interdiction models and algorithms ⋮ Complexity and algorithms for constant diameter augmentation problems ⋮ Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions ⋮ Using edge contractions to reduce the semitotal domination number
This page was built for publication: Minimum vertex blocker clique problem
