Linear time algorithms for some separable quadratic programming problems
- 31 May 1993
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 13 (4) , 203-211
- https://doi.org/10.1016/0167-6377(93)90041-e
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre ProblemSIAM Journal on Computing, 1986
- Linear programming in O(n × 3d) timeInformation Processing Letters, 1986
- An O(n) algorithm for quadratic knapsack problemsOperations Research Letters, 1984
- An O(n) algorithm for the multiple-choice knapsack linear programMathematical Programming, 1984
- An O(n) algorithm for the linear multiple choice knapsack problem and related problemsInformation Processing Letters, 1984
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984