Global Optimality Conditions and Optimization Methods for Quadratic Knapsack Problems
@article{Wu2011GlobalOC, title={Global Optimality Conditions and Optimization Methods for Quadratic Knapsack Problems}, author={Zhi-You Wu and Y. Yang and F. Bai and M. Mammadov}, journal={Journal of Optimization Theory and Applications}, year={2011}, volume={151}, pages={241-259} }
The quadratic knapsack problem (QKP) maximizes a quadratic objective function subject to a binary and linear capacity constraint. Due to its simple structure and challenging difficulty, it has been studied intensively during the last two decades. This paper first presents some global optimality conditions for (QKP), which include necessary conditions and sufficient conditions. Then a local optimization method for (QKP) is developed using the necessary global optimality condition. Finally a… Expand
Topics from this paper
3 Citations
References
SHOWING 1-10 OF 21 REFERENCES
Exact Solution of the Quadratic Knapsack Problem
- Mathematics, Computer Science
- INFORMS J. Comput.
- 1999
- 164
Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
- Computer Science, Mathematics
- SIAM J. Optim.
- 2000
- 64
An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Mathematics, Computer Science
- Eur. J. Oper. Res.
- 2004
- 82
Sufficient Global Optimality Conditions for Non-convex Quadratic Minimization Problems With Box Constraints
- Mathematics, Computer Science
- J. Glob. Optim.
- 2006
- 48
A Mini-Swarm for the Quadratic Knapsack Problem
- Computer Science, Mathematics
- 2007 IEEE Swarm Intelligence Symposium
- 2007
- 22
- PDF