A modification of the knapsack problem taking into account the effect of the interaction between the items.
Marina I. RebezovaN. I. SulimaR. T. SurinovPublished in: Autom. Control. Comput. Sci. (2013)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- dynamic programming
- test problems
- optimal solution
- optimization problems
- multidimensional knapsack problem
- np hard
- bicriteria
- exact algorithms
- greedy algorithm
- np hard problems
- user interaction
- human computer interaction
- multiple objectives
- linear programming relaxation
- maximum profit
- greedy heuristic
- cutting plane
- decision variables
- vehicle routing problem
- implicit enumeration
- continuous relaxation
- evolutionary algorithm