Pages that link to "Item:Q2031072"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072):
Displaying 9 items.
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
- Integer programming methods for solving binary interdiction games (Q2672065) (← links)
- Exact solution approaches for a class of bilevel fractional programs (Q2679008) (← links)
- A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← 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)
- 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)