The following pages link to Matching interdiction (Q602686):
Displaying 43 items.
- Minimum edge blocker dominating set problem (Q319914) (← links)
- The most vital nodes with respect to independent set and vertex cover (Q411833) (← links)
- On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689) (← links)
- Blockers for the stability number and the chromatic number (Q489343) (← links)
- Blocking optimal arborescences (Q507342) (← links)
- Analysis of budget for interdiction on multicommodity network flows (Q513161) (← links)
- A simple greedy heuristic for linear assignment interdiction (Q513608) (← links)
- Interdiction problems on planar graphs (Q897609) (← links)
- Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
- A note on linearized reformulations for a class of bilevel linear integer problems (Q1730617) (← links)
- Blocking unions of arborescences (Q1751195) (← links)
- Connectivity interdiction (Q1785279) (← links)
- Perfect matching interdiction problem restricted to a stable vertex (Q1794725) (← links)
- Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs (Q1999634) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (Q2022299) (← links)
- Minimum \(k\)-critical bipartite graphs (Q2043356) (← links)
- The continuous maximum capacity path interdiction problem (Q2083925) (← links)
- Colored cut games (Q2087453) (← links)
- Using edge contractions to reduce the semitotal domination number (Q2098176) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (Q2230789) (← links)
- A survey of network interdiction models and algorithms (Q2294622) (← links)
- Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut (Q2299979) (← links)
- Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← links)
- Bulk-robust combinatorial optimization (Q2515045) (← links)
- Integer programming methods for solving binary interdiction games (Q2672065) (← links)
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges (Q2672432) (← links)
- An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance (Q2688925) (← links)
- The complexity of blocking (semi)total dominating sets with edge contractions (Q2690876) (← links)
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
- Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers (Q2980027) (← links)
- Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
- Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
- (Q5002612) (← links)
- On the Independent Set Interdiction Problem (Q5006560) (← links)
- Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal (Q5051378) (← links)
- Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
- Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
- Vertex downgrading to minimize connectivity (Q6038644) (← links)
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690) (← links)
- Logic-based Benders decomposition for wildfire suppression (Q6068720) (← links)
- On designing networks resilient to clique blockers (Q6106962) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
