A POLYNOMIALLY BOUNDED ALGORITHM FOR A SINGLY CONSTRAINED QUADRATIC PROGRAM

被引：91

作者：

HELGASON, R

KENNINGTON, J

LALL, H

机构：

来源：

MATHEMATICAL PROGRAMMING | 1980年 / 18卷 / 03期

关键词：

D O I：

10.1007/BF01588328

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：338 / 343

页数：6

共 10 条

[1]

ALI A, UNPUBLISHED

[2]

BITRAN GR, 1979, SURVEY MATH PROGRAMM, V1, P357

[3] THE THEORY OF SEARCH - OPTIMUM DISTRIBUTION OF SEARCH EFFORT [J].

CHARNES, A ;

COOPER, WW .

MANAGEMENT SCIENCE, 1958, 5 (01) :44-50

[4]

Held M., 1974, Mathematical Programming, V6, P62, DOI 10.1007/BF01580223

[5] EFFECTIVE SUBGRADIENT PROCEDURE FOR MINIMAL COST MULTICOMMODITY FLOW PROBLEMS [J].

KENNINGTON, J ;

SHALABY, M .

MANAGEMENT SCIENCE, 1977, 23 (09) :994-1004

[6]

Lawler EL., 2001, COMBINATORIAL OPTIMI

[7] ALLOCATION OF EFFORT RESOURCES AMONG COMPETING ACTIVITIES [J].

LUSS, H ;

GUPTA, SK .

OPERATIONS RESEARCH, 1975, 23 (02) :360-366

[8]

MCCALLUM CJ, ALGORITHM CERTAIN QU

[9] ALLOCATION PROBLEM WITH MULTISTAGE CONSTRAINTS [J].

SANATHANAN, L .

OPERATIONS RESEARCH, 1971, 19 (07) :1647-+

[10] A PROBLEM IN OPTIMUM ALLOCATION [J].

SRIKANTAN, KS .

OPERATIONS RESEARCH, 1963, 11 (02) :265-273

← 1 →