A hybrid dynamic programming approach to the biobjective binary knapsack problem.
Charles DelortOlivier SpanjaardPublished in: ACM J. Exp. Algorithmics (2013)
Keyphrases
- knapsack problem
- bi objective
- dynamic programming
- multiple objectives
- combinatorial optimization problems
- test problems
- set covering problem
- greedy algorithm
- minimum cost flow
- multidimensional knapsack problem
- optimization problems
- exact algorithms
- nsga ii
- maximum profit
- lagrangian relaxation
- efficient solutions
- linear program
- linear programming
- np hard
- multi objective
- optimal solution
- shortest path problem
- evolutionary algorithm
- implicit enumeration