Pages that link to "Item:Q4910808"
From MaRDI portal
The following pages link to A Complexity and Approximability Study of the Bilevel Knapsack Problem (Q4910808):
Displaying 14 items.
- A class of algorithms for mixed-integer bilevel min-max optimization (Q330266) (← links)
- A note on linearized reformulations for a class of bilevel linear integer problems (Q1730617) (← links)
- An exact algorithm for bilevel 0-1 knapsack problems (Q1954852) (← links)
- Exact solution approach for a class of nonlinear bilevel knapsack problems (Q2018478) (← links)
- The binary knapsack problem with qualitative levels (Q2029032) (← links)
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
- Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints (Q2293085) (← links)
- Improved approximation algorithms for a bilevel knapsack problem (Q2354770) (← links)
- Bilevel Knapsack with Interdiction Constraints (Q3186662) (← links)
- Sequential Interdiction with Incomplete Information and Learning (Q4971578) (← links)
- On Bilevel Optimization with Inexact Follower (Q5120277) (← links)
- Approximation Algorithms for a Bi-level Knapsack Problem (Q5199165) (← 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)
