An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
- 1 January 1990
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 46 (1) , 321-328
- https://doi.org/10.1007/bf01585748
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Quasi-Newton Updates with BoundsSIAM Journal on Numerical Analysis, 1987
- Methods for Global Concave Minimization: A Bibliographic SurveySIAM Review, 1986
- Global minimization of large-scale constrained concave quadratic problems by separable programmingMathematical Programming, 1986
- An O(n) algorithm for quadratic knapsack problemsOperations Research Letters, 1984
- Multipoint methods for separable nonlinear networksPublished by Springer Nature ,1984
- A polynomially bounded algorithm for a singly constrained quadratic programMathematical Programming, 1980
- Validation of subgradient optimizationMathematical Programming, 1974
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972
- An Algorithm for the Solution of Mixed Integer Programming ProblemsManagement Science, 1966