LINEAR-TIME ALGORITHMS FOR SOME SEPARABLE QUADRATIC-PROGRAMMING PROBLEMS

作     者：MEGIDDO, N TAMIR, A 

作者机构：TEL AVIV UNIVSCH MATH SCIIL-69978 TEL AVIVISRAEL 

出 版 物：《OPERATIONS RESEARCH LETTERS》 (运筹学快报)

年 卷 期：1993年第13卷第4期

页      面：203-211页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Office of Naval Research  ONR  (N00014-91-C-0026) 

主　　题：QUADRATIC PROGRAMMING SEPARABLE 

摘      要：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.