Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems.
Aiying RongJosé Rui FigueiraPublished in: Comput. Math. Appl. (2012)
Keyphrases
- knapsack problem
- bi objective
- dynamic programming algorithms
- dynamic programming
- combinatorial optimization problems
- optimization problems
- test problems
- multiple objectives
- efficient solutions
- nsga ii
- multi objective
- np hard
- optimal solution
- multi objective optimization
- vehicle routing problem
- linear programming relaxation
- ant colony optimization
- markov chain
- state space
- lower bound