The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The quadratic knapsack problem-a survey
Discrete Applied Mathematics
Linear time algorithms for some separable quadratic programming problems
Operations Research Letters
Operations Research Letters
Quadratic resource allocation with generalized upper bounds
Operations Research Letters
Linear programming with variable matrix entries
Operations Research Letters
On a discrete nonlinear and nonseparable knapsack problem
Operations Research Letters
Structured sparsity via alternating direction methods
The Journal of Machine Learning Research
| Hi-index | 0.00 |
An algorithm is presented which solves bounded quadratic optimization problems with n variables and one linear constraint in at most O(n) steps. The algorithm is based on a parametric approach combined with well-known ideas for constructing efficient algorithms. It improves an O(n log n) algorithm which has been developed for a more restricted case of the problem.