Approximation algorithms for a bi-level knapsack problem
From MaRDI portal
Recommendations
Cites work
- A dynamic programming algorithm for the bilevel Knapsack problem
- Bilevel programming with knapsack constraints
- Bilevel programming: a survey
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Two-group knapsack game
- Two-person knapsack game
- Weak via strong Stackelberg problem: New results
- Worst-case equilibria
Cited in
(13)- An exact algorithm for bilevel 0-1 knapsack problems
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Computational complexity characterization of protecting elections from bribery
- Approximation Algorithms for a Bi-level Knapsack Problem
- On the Stackelberg knapsack game
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Approximation algorithms for a two-phase knapsack problem
- A Stackelberg knapsack game with weight control
- Improved approximation algorithms for a bilevel knapsack problem
- Improved approximation algorithms for a bilevel knapsack problem
- Solution techniques for bi-level knapsack problems
- An approximation scheme for a bilevel knapsack problem
This page was built for publication: Approximation algorithms for a bi-level knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391212)