On reduction of duality gap in quadratic knapsack problems.
Xiaojin ZhengXiaoling SunDuan LiYifan XuPublished in: J. Glob. Optim. (2012)
Keyphrases
- knapsack problem
- duality gap
- optimal solution
- optimization problems
- combinatorial optimization problems
- primal dual
- test problems
- set covering problem
- objective function
- augmented lagrangian
- exact algorithms
- bi objective
- np hard
- dynamic programming
- convex programming
- linear programming relaxation
- pairwise
- multiple objectives
- greedy algorithm
- inequality constraints
- linear program
- metaheuristic
- linear programming
- branch and bound algorithm
- branch and bound
- optimality conditions
- ant colony optimization
- set covering
- genetic algorithm