George Markowsky
J. Math. Anal. Appl.
A large class of separable quadratic programming problems is presented. The problems in the class can be solved in linear time. The class includes the separable convex quadratic transportation problem with a fixed number of sources and separable convex quadratic programming with nonnegativity constraints and a fixed number of linear equality constraints. © 1993.
George Markowsky
J. Math. Anal. Appl.
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
J. LaRue, C. Ting
Proceedings of SPIE 1989