John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
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.
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
Matthew A Grayson
Journal of Complexity
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON