A study on the computational complexity of the bilevel knapsack problem
From MaRDI portal
Recommendations
- A complexity and approximability study of the bilevel knapsack problem
- A dynamic programming algorithm for the bilevel Knapsack problem
- Bilevel programming with knapsack constraints
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- Improved approximation algorithms for a bilevel knapsack problem
Cited in
(37)- Observability of power systems with optimal PMU placement
- A dynamic reformulation heuristic for generalized interdiction problems
- On the Stackelberg knapsack game
- The trouble with the second quantifier
- Complexity of the multilevel critical node problem
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
- Computing equilibria for integer programming games
- Mixed-integer bilevel representability
- Complexity of near-optimal robust versions of multilevel optimization problems
- Algorithms and applications for a class of bilevel MILPs
- A Stackelberg knapsack game with weight control
- A faster algorithm for the continuous bilevel knapsack problem
- A complexity and approximability study of the bilevel knapsack problem
- Bilevel optimization: theory, algorithms, applications and a bibliography
- On bilevel optimization with inexact follower
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- The subset sum game revisited
- Computational complexity characterization of protecting elections from bribery
- Solution techniques for bi-level knapsack problems
- A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
- Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds
- A survey on mixed-integer programming techniques in bilevel optimization
- An exact method for binary fortification games
- Single machine adversarial bilevel scheduling problems
- The stochastic bilevel selection problem
- Geometric and computational hardness of bilevel programming
- Completeness in the polynomial hierarchy for many natural problems in bilevel and robust optimization
- On the complexity of the bilevel shortest path problem
- Public-private partnership concerning infrastructure projects in a resource region: a model based on a consortium of subsoil users
- Learning primal heuristics for 0-1 knapsack interdiction problems
- Mixed-integer bilevel optimization with nonconvex quadratic lower-level problems: complexity and a solution method
- The robust bilevel selection problem
- Deep learning based high accuracy heuristic approach for knapsack interdiction problem
- The Maximal covering location disruption problem
- Bilevel optimization approach for fuel treatment planning
- A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
This page was built for publication: A study on the computational complexity of the bilevel knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192105)
