Assessing solution quality of biobjective 0-1 knapsack problem using evolutionary and heuristic algorithms.
Rajeev KumarPramod Kumar SinghPublished in: Appl. Soft Comput. (2010)
Keyphrases
- solution quality
- knapsack problem
- test problems
- optimal solution
- exact algorithms
- benchmark instances
- bi objective
- simulated annealing
- computational efficiency
- test instances
- optimization problems
- combinatorial optimization problems
- feasible solution
- efficient solutions
- nsga ii
- lp relaxation
- minimum cost flow
- greedy algorithm
- lower bound
- np hard
- heuristic methods
- multiple objectives
- dynamic programming
- combinatorial optimization
- genetic programming
- linear programming
- benchmark problems
- tabu search
- evolutionary algorithm
- objective function
- genetic algorithm
- computationally efficient
- multi objective
- search space
- set covering problem