Pages that link to "Item:Q2196299"
From MaRDI portal
The following pages link to An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299):
Displaying 17 items.
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
- A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
- Exact solution approach for a class of nonlinear bilevel knapsack problems (Q2018478) (← links)
- On the Stackelberg knapsack game (Q2029942) (← links)
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities (Q2089867) (← links)
- Complexity of the multilevel critical node problem (Q2121476) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective (Q2154452) (← links)
- Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints (Q2293085) (← links)
- Bilevel Knapsack with Interdiction Constraints (Q3186662) (← links)
- A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
- Solution techniques for bi-level knapsack problems (Q6047889) (← links)
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)
- Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds (Q6102856) (← links)
- An exact method for binary fortification games (Q6167322) (← links)
- Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set (Q6179697) (← links)
