Solving the knapsack problem with imprecise weight coefficients using genetic algorithms.
Feng-Tse LinPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- knapsack problem
- randomly generated test instances
- implicit enumeration
- optimal solution
- combinatorial optimization problems
- optimization problems
- dynamic programming
- linear relaxation
- test problems
- np hard
- lp relaxation
- exact algorithms
- multidimensional knapsack problem
- multiple objectives
- linear programming relaxation
- np hard problems
- bicriteria
- integer variables
- greedy algorithm
- continuous relaxation
- maximum profit
- cutting plane
- metaheuristic
- linear programming problems
- quadratic programming
- greedy heuristic
- decision variables
- neural network
- vehicle routing problem
- feasible solution
- combinatorial optimization
- evolutionary algorithm
- genetic algorithm