Algorithmic improvements on dynamic programming for the bi-objective {0, 1} knapsack problem.
José Rui FigueiraLuís PaqueteMarco SimõesDaniel VanderpootenPublished in: Comput. Optim. Appl. (2013)
Keyphrases
- knapsack problem
- bi objective
- dynamic programming
- multiple objectives
- combinatorial optimization problems
- multidimensional knapsack problem
- test problems
- greedy algorithm
- exact algorithms
- nsga ii
- linear programming relaxation
- decision variables
- efficient solutions
- linear programming
- continuous relaxation
- vehicle routing problem
- greedy heuristic
- reinforcement learning
- random walk
- optimization problems
- optimal solution
- single machine
- linear program
- shortest path
- upper bound