Pages that link to "Item:Q1735171"
From MaRDI portal
The following pages link to The maximum clique interdiction problem (Q1735171):
Displaying 29 items.
- Minimum cost edge blocker clique problem (Q827246) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
- A balm: defend the clique-based attack from a fundamental aspect (Q2082182) (← links)
- Complexity of the multilevel critical node problem (Q2121476) (← links)
- Interdicting facilities in tree networks (Q2121611) (← links)
- On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
- Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm (Q2228388) (← links)
- The maximum clique problem in multiple interval graphs (Q2350898) (← links)
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
- Integer programming methods for solving binary interdiction games (Q2672065) (← links)
- The Clique Problem in Ray Intersection Graphs (Q2912845) (← links)
- (Q3112179) (← links)
- The disjoint cliques problem (Q4345417) (← links)
- A Unified Framework for Multistage Mixed Integer Linear Optimization (Q5014640) (← links)
- A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
- Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
- A generic optimization framework for resilient systems (Q5882239) (← links)
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690) (← links)
- On designing networks resilient to clique blockers (Q6106962) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)
- An exact method for binary fortification games (Q6167322) (← links)
- Mathematical programming formulations for the collapsed k-core problem (Q6168587) (← links)
- Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set (Q6179697) (← links)
- Reformulations and complexity of the clique interdiction problem by graph mapping (Q6558672) (← links)
- Benders decomposition algorithms for minimizing the spread of harmful contagions in networks (Q6568498) (← links)
