Matching interdiction
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2050722 (Why is no real title available?)
- scientific article; zbMATH DE number 871953 (Why is no real title available?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A partial k-arboretum of graphs with bounded treewidth
- A problem in network interdiction
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Blockers and transversals
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complexity classification of some edge modification problems
- Deterministic network interdiction
- Edge-Deletion Problems
- Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction
- Finding the most vital arcs in a network
- Maximizing the minimum source-sink path subject to a budget constraint
- NP-completeness results for edge modification problems
- Network flow interdiction on planar graphs
- Node-Deletion Problems on Bipartite Graphs
- On short paths interdiction problems: Total and node-wise limited interdiction
- Shortest-path network interdiction
- The 0-1 inverse maximum stable set problem
- The most vital edges in the minimum spanning tree problem
- The network inhibition problem
- The node-deletion problem for hereditary properties is NP-complete
- Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
- Treewidth. Computations and approximations
Cited in
(51)- Exact algorithms for the minimum cost vertex blocker clique problem
- Blockers for the stability number and the chromatic number
- Colored cut games
- Symmetric interdiction for matching problems
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Interdicting structured combinatorial optimization problems with {0,1}-objectives
- A \((B + 1)\)-approximation for network flow interdiction with unit costs
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem
- Logic-based Benders decomposition for wildfire suppression
- The continuous maximum capacity path interdiction problem
- Matrix interdiction problem
- On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph
- Multilevel approaches for the critical node problem
- Packing interdiction and partial covering problems
- The critical node game
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance
- Nodal interdiction
- Critical edges for the assignment problem: complexity and exact resolution
- Connectivity interdiction
- The most vital nodes with respect to independent set and vertex cover
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm
- Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut
- Improved Algorithms for MST and Metric-TSP Interdiction
- Interdiction problems on planar graphs
- A branch-and-cut algorithm for the edge interdiction clique problem
- Interdiction problems on planar graphs
- Vertex downgrading to minimize connectivity
- A survey on mixed-integer programming techniques in bilevel optimization
- A survey of network interdiction models and algorithms
- On designing networks resilient to clique blockers
- Detecting critical node structures on graphs: a mathematical programming approach
- A simple greedy heuristic for linear assignment interdiction
- Minimum edge blocker dominating set problem
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Bulk-robust combinatorial optimization
- The matching interdiction problem in dendrimers
- Integer programming methods for solving binary interdiction games
- Using edge contractions to reduce the semitotal domination number
- Perfect matching interdiction problem restricted to a stable vertex
- An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance
- Analysis of budget for interdiction on multicommodity network flows
- Maximizing convergence time in network averaging dynamics subject to edge removal
- On the independent set interdiction problem
- Minimum \(k\)-critical bipartite graphs
- Blocking unions of arborescences
- A note on linearized reformulations for a class of bilevel linear integer problems
- The complexity of blocking (semi)total dominating sets with edge contractions
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges
- Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
- Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers
This page was built for publication: Matching interdiction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q602686)
