Algorithms for the solution of quadratic knapsack problems
- 1 July 1991
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 152, 69-91
- https://doi.org/10.1016/0024-3795(91)90267-z
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- Quasi-Newton Updates with BoundsSIAM Journal on Numerical Analysis, 1987
- Convex quadratic programming with one constraint and bounded variablesMathematical Programming, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- An O(n) algorithm for quadratic knapsack problemsOperations Research Letters, 1984
- Computing a Trust Region StepSIAM Journal on Scientific and Statistical Computing, 1983
- Optimal scaling of balls and polyhedraMathematical Programming, 1982
- An algorithm for nonconvex programming problemsMathematical Programming, 1976
- Duality in quadratic programmingQuarterly of Applied Mathematics, 1960