Pages that link to "Item:Q2354770"
From MaRDI portal
The following pages link to Improved approximation algorithms for a bilevel knapsack problem (Q2354770):
Displaying 15 items.
- Approximation algorithms for a bi-level knapsack problem (Q391212) (← links)
- On the Stackelberg knapsack game (Q2029942) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- The stochastic bilevel continuous knapsack problem with uncertain follower's objective (Q2156390) (← 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)
- A Stackelberg knapsack game with weight control (Q2333816) (← links)
- A polynomial algorithm for a continuous bilevel knapsack problem (Q2417096) (← links)
- Improved Generic Algorithms for Hard Knapsacks (Q3003392) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- Approximation Algorithms for a Bi-level Knapsack Problem (Q5199165) (← links)
- Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model (Q5425476) (← links)
- The subset sum game revisited (Q5918370) (← links)
- Computational complexity characterization of protecting elections from bribery (Q5919119) (← links)
- Solution techniques for bi-level knapsack problems (Q6047889) (← links)
