Pages that link to "Item:Q827246"
From MaRDI portal
The following pages link to Minimum cost edge blocker clique problem (Q827246):
Displaying 8 items.
- Minimum edge blocker dominating set problem (Q319914) (← links)
- Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
- The maximum clique interdiction problem (Q1735171) (← links)
- A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
- Integer programming methods for solving binary interdiction games (Q2672065) (← links)
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- Benders decomposition algorithms for minimizing the spread of harmful contagions in networks (Q6568498) (← links)