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
3 Citations
Density-Based Sensor Selection for RSS Target Localization
  • 2
R-Storm: Resource-Aware Scheduling in Storm
  • 139
  • PDF

References

SHOWING 1-10 OF 21 REFERENCES
The quadratic knapsack problem - a survey
  • 168
Exact Solution of the Quadratic Knapsack Problem
  • 164
Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
  • 64
Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
  • 42
An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
  • 82
Lagrangean methods for the 0-1 Quadratic Knapsack Problem
  • 55
Linear programming for the 0–1 quadratic knapsack problem
  • 88
On the supermodular knapsack problem
  • 49
A Mini-Swarm for the Quadratic Knapsack Problem
  • 22
  • PDF
...
1
2
3
...