|
|
|
|
|
| Abstract of Paper |
On the Approximability of Interactive Knapsack Problems
by Isto Aho
Abstract:
We show that the interactive knapsack heuristic optimization problem is APX-hard. Moreover, we discuss the relationship between the interactive knapsack heuristic optimization problem and some other knapsack problems.