| Article ID: | iaor1995346 |
| Country: | Netherlands |
| Volume: | 13 |
| Issue: | 4 |
| Start Page Number: | 203 |
| End Page Number: | 211 |
| Publication Date: | May 1993 |
| Journal: | Operations Research Letters |
| Authors: | Megiddo Nimrod, Tamir Arie |
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.