Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic.
Cai Wen ZhangHoon Liong OngPublished in: Eur. J. Oper. Res. (2004)
Keyphrases
- knapsack problem
- bi objective
- randomly generated test instances
- lp relaxation
- optimal solution
- linear relaxation
- exact algorithms
- multidimensional knapsack problem
- set covering problem
- linear programming relaxation
- multiple objectives
- np hard
- optimization problems
- dynamic programming
- test problems
- combinatorial optimization problems
- implicit enumeration
- efficient solutions
- minimum cost flow
- linear program
- feasible solution
- greedy algorithm
- linear programming
- maximum profit
- nsga ii
- lower bound
- shortest path problem
- search space
- column generation
- branch and bound
- search algorithm