Online Removable Knapsack Problem for Integer-Sized Unweighted Items.
Hiroshi FujiwaraKanaho HanjiHiroaki YamamotoPublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2022)
Keyphrases
- knapsack problem
- continuous relaxation
- combinatorial optimization problems
- integer variables
- optimization problems
- optimal solution
- decision variables
- dynamic programming
- online learning
- test problems
- exact algorithms
- multidimensional knapsack problem
- np hard
- np hard problems
- linear programming relaxation
- greedy heuristic
- bicriteria
- neural network
- heuristic solution
- greedy algorithm
- special case
- higher dimensional
- evolutionary algorithm
- multiple objectives
- maximum profit