Determining the K-best solutions of knapsack problems.
Aline Aparecida de Souza LeãoLuiz Henrique CherriMarcos N. ArenalesPublished in: Comput. Oper. Res. (2014)
Keyphrases
- knapsack problem
- optimal solution
- multidimensional knapsack problem
- exact algorithms
- combinatorial optimization problems
- optimization problems
- test problems
- greedy algorithms
- linear programming relaxation
- np hard problems
- dynamic programming
- integer variables
- bicriteria
- neural network
- benchmark problems
- greedy algorithm
- cutting plane
- nsga ii
- feasible solution
- solution quality
- implicit enumeration
- production planning
- solution space
- metaheuristic
- linear programming
- simulated annealing
- np hard
- objective function