Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
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.
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007