Abstract
Max–max, max–min, min–max and min–min optimization problems with a knapsack-type constraint containing a single numerical parameter are studied. The goal is to present optimal solutions for all possible values of the parameter. Algorithms with O(nlog n) and O(n2) running times are proposed for the problems with a fixed parameter and for the general problem, respectively, where n is the number of items to be packed into the knapsack. The latter algorithm determines optimal solution values for all values of the parameter in O(nlog 2n) time. The problem of deciding whether there exists a single optimal solution for all values of the numerical parameter is proved to be NP-complete.
Original language | English |
---|---|
Pages (from-to) | 235-246 |
Number of pages | 12 |
Journal | 4OR |
Volume | 21 |
Issue number | 2 |
DOIs | |
State | Published - Jun 2023 |
Keywords
- FPTAS
- Knapsack problems
- Parametric optimization
- Polynomial algorithm
All Science Journal Classification (ASJC) codes
- Management Information Systems
- Theoretical Computer Science
- Management Science and Operations Research
- Computational Theory and Mathematics