EFFICIENT ALGORITHMS FOR SOLVING MULTICONSTRAINT ZERO-ONE KNAPSACK-PROBLEMS TO OPTIMALITY

被引：155

作者：

GAVISH, B ^{[1
]}

PIRKUL, H ^{[1
]}

机构：

[1] OHIO STATE UNIV,ACAD FAC ACCOUNTING,COLUMBUS,OH 43210

来源：

MATHEMATICAL PROGRAMMING | 1985年 / 31卷 / 01期

关键词：

D O I：

10.1007/BF02591863

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

MATHEMATICAL PROGRAMMING

引用

页码：78 / 105

页数：28

共 41 条

[11] FORMULATIONS AND ALGORITHMS FOR THE CAPACITATED MINIMAL DIRECTED TREE PROBLEM [J].

GAVISH, B .

JOURNAL OF THE ACM, 1983, 30 (01) :118-132

[12] OBTAINING BEST MULTIPLIERS FOR A LAGRANGEAN RELAXATION FOR INTEGER PROGRAMMING [J].

GAVISH, B .

COMPUTERS & OPERATIONS RESEARCH, 1978, 5 (01) :55-71

[13]

GAVISH B, 1983, MODELS COMPUTER FILE

[14]

GAVISH B, 1981, MULTICONSTRAINT 01 K

[15]

GAVISH B, 1980, OPTIMAL SOLUTION MET

[16]

Gavish H. P. B., 1982, MANAGEMENT DISTRIBUT, P215

[17] LAGRANGEAN RELAXATION APPLIED TO CAPACITATED FACILITY LOCATION PROBLEMS [J].

GEOFFRION, A ;

MCBRIDE, R .

AIIE TRANSACTIONS, 1978, 10 (01) :40-47

[18]

Geoffrion A., 1974, MATH PROGRAMMING STU, V2, DOI [10.1007/BFb0120690, DOI 10.1007/BFB0120686]

[19] THEORY AND COMPUTATION OF KNAPSACK FUNCTIONS [J].

GILMORE, PC ;

GOMORY, RE .

OPERATIONS RESEARCH, 1966, 14 (06) :1045-&

[20] SURROGATE CONSTRAINT DUALITY IN MATHEMATICAL PROGRAMMING [J].

GLOVER, F .

OPERATIONS RESEARCH, 1975, 23 (03) :434-451

← 1 2 3 4 5 →