A Study on the Computational Complexity of the Bilevel Knapsack Problem

@article{Caprara2014ASO,
  title={A Study on the Computational Complexity of the Bilevel Knapsack Problem},
  author={Alberto Caprara and Margarida Carvalho and Andrea Lodi and Gerhard J. Woeginger},
  journal={SIAM J. Optim.},
  year={2014},
  volume={24},
  pages={823-838}
}
We analyze the computational complexity of three fundamental variants of the bilevel knapsack problem. All three variants are shown to be complete for the second level of the polynomial hierarchy. We also discuss the somewhat easier situation where the weight and profit coefficients in the knapsack problem are encoded in unary: two of the considered bilevel variants become solvable in polynomial time, whereas the third becomes NP-complete. Furthermore, we design a polynomial time approximation… 

Figures from this paper

Canonical Duality Theory and Algorithm for Solving Bilevel Knapsack Problems With Applications
  • D. Gao
  • Computer Science
    IEEE Transactions on Systems, Man, and Cybernetics: Systems
  • 2021
A novel canonical duality theory (CDT) is presented for solving general bilevel mixed integer nonlinear optimization governed by linear and quadratic knapsack problems. It shows that the challenging
The bilevel continuous knapsack problem with uncertain follower's objective
TLDR
It is shown that placing uncertainty sets by their convex hulls may change the problem significantly, in contrast to the situation in classical single-level robust optimization, and that optimizing the leader's objective function is #P-hard in the case of independently uniformly distributed profits.
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower’s objective
TLDR
It is shown that replacing uncertainty sets by their convex hulls may change the problem significantly, in contrast to the situation in classical single-level robust optimization, and the problem again turns out to be NP-hard.
The robust bilevel continuous knapsack problem with uncertain follower’s objective∗
TLDR
It is shown that replacing uncertainty sets by their convex hulls may change the problem significantly, in contrast to the situation in classical single-level robust optimization, and the problem again turns out to be NP-hard.
Approximation Algorithms for a Two-Phase Knapsack Problem
TLDR
A natural generalization of the knapsack problem and the multiple knapsacks problem, which has two phases of packing decisions, and which is strongly NP-hard, is considered, and three approximation algorithms are proposed.
Uncertain bilevel knapsack problem based on an improved binary wolf pack algorithm
TLDR
The UBKP model and the PE uncertain solution are applied to an armament transportation problem as a case study and an evolutionary algorithm, the improved binary wolf pack algorithm, is constructed with one rule, two operators, and three intelligent behaviors.
...
...

References

SHOWING 1-10 OF 42 REFERENCES
An Exact Algorithm for Bilevel 0-1 Knapsack Problems
TLDR
A polynomial time procedure to solve the linear relaxation of the bilevel 0-1 knapsack problem is described and a feasible solution is computed and used together with an upper bound to reduce the size of the original problem.
Optimization Problems in the Polynomial-Time Hierarchy
TLDR
This talk surveys work on classifying the complexity and approximability of problems residing in the Polynomial-Time Hierarchy, above the first level, and describes how strong inapproximability results for certain $\Sigma^p_2$ optimization problems can be obtained using dispersers to build error-correcting codes.
Bilevel Programming With Knapsack Constraints
TLDR
A pseu-dopolynomial exact and a polynomial approximate algorithms for solving the bilevel problem are proposed.
Fast approximation algorithms for knapsack problems
  • E. Lawler
  • Computer Science
    18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
TLDR
These algorithms are based on ideas of Ibarra and Kim, with modifications which yield better time and space bounds, and also tend to improve the practicality of the procedures.
On the Complexity of Min-Max Optimization Problems and their Approximation
TLDR
A number of optimization problems of the min-max form are presented and it is shown that the constant–factor approximation versions of some of these optimization problems are complete for ∏ 2 P.
The polynomial hierarchy and a simple model for competitive analysis
TLDR
An easy corollary of these results is that value questions for two-player (bi-level) games of this type is NP-hard.
The Polynomial-Time Hierarchy
  • L. Stockmeyer
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 1976
Approximation schemes for a class of subset selection problems
...
...