A polynomial algorithm for a continuous bilevel knapsack problem
From MaRDI portal
Recommendations
- A faster algorithm for the continuous bilevel knapsack problem
- A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
- Bilevel programming with knapsack constraints
- A dynamic programming algorithm for the bilevel Knapsack problem
- Bilevel knapsack with interdiction constraints
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- A dynamic programming algorithm for the bilevel Knapsack problem
- An Algorithm for Large Zero-One Knapsack Problems
- Bilevel knapsack with interdiction constraints
- Bilevel programming with knapsack constraints
- Improved approximation algorithms for a bilevel knapsack problem
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear programming in \(O(n\times 3^{d^2})\) time
- One-level reformulation of the bilevel Knapsack problem using dynamic programming
Cited in
(8)- Complexity of the multilevel critical node problem
- A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- The subset sum game revisited
- The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
- A faster algorithm for the continuous bilevel knapsack problem
- Exact solution approaches for a class of bilevel fractional programs
This page was built for publication: A polynomial algorithm for a continuous bilevel knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2417096)
