LINEAR-TIME ALGORITHMS FOR SOME SEPARABLE QUADRATIC-PROGRAMMING PROBLEMS

Authors
MEGIDDO N TAMIR A
Citation
N. Megiddo et A. Tamir, LINEAR-TIME ALGORITHMS FOR SOME SEPARABLE QUADRATIC-PROGRAMMING PROBLEMS, Operations research letters, 13(4), 1993, pp. 203-211
Citations number
11
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science
Journal title
Operations research letters → ACNP
ISSN journal
01676377
Volume
13
Issue
4
Year of publication
1993
Pages
203 - 211
Database
ISI
SICI code
0167-6377(1993)13:4<203:LAFSSQ>2.0.ZU;2-2
Abstract
A large class of separable quadratic programming problems is presented . The problems in the class can be solved in linear time. The class in cludes the separable convex quadratic transportation problem with a fi xed number of sources and separable convex quadratic programming with nonnegativity constraints and a fixed number of linear equality constr aints.