Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
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.