Pages that link to "Item:Q391212"
From MaRDI portal
The following pages link to Approximation algorithms for a bi-level knapsack problem (Q391212):
Displaying 11 items.
- Approximation algorithms for a two-phase knapsack problem (Q1790954) (← links)
- An exact algorithm for bilevel 0-1 knapsack problems (Q1954852) (← links)
- On the Stackelberg knapsack game (Q2029942) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
- A Stackelberg knapsack game with weight control (Q2333816) (← links)
- Improved approximation algorithms for a bilevel knapsack problem (Q2354770) (← links)
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
- Approximation Algorithms for a Bi-level Knapsack Problem (Q5199165) (← links)
- Computational complexity characterization of protecting elections from bribery (Q5919119) (← links)
- Solution techniques for bi-level knapsack problems (Q6047889) (← links)