CONTINUOUS MAXIMIN KNAPSACK-PROBLEMS WITH GLB CONSTRAINTS

被引：9

作者：

EISELT, HA

机构：

来源：

MATHEMATICAL PROGRAMMING | 1986年 / 36卷 / 01期

关键词：

D O I：

10.1007/BF02591994

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：114 / 121

页数：8

共 10 条

[1] AN O(N) ALGORITHM FOR THE MULTIPLE-CHOICE KNAPSACK LINEAR PROGRAM [J].

DYER, ME .

MATHEMATICAL PROGRAMMING, 1984, 29 (01) :57-63

[2]

EISELT HA, 1984, 1984 P ASAC C MAN SC, P6

[3] O(N LOG N) ALGORITHM FOR LP KNAPSACKS WITH GUB CONSTRAINTS [J].

GLOVER, F ;

KLINGMAN, D .

MATHEMATICAL PROGRAMMING, 1979, 17 (03) :345-361

[4]

Ibaraki T., 1978, Journal of the Operations Research Society of Japan, V21, P59

[5] ON MIN-MAX INTEGER ALLOCATION PROBLEMS [J].

ICHIMORI, T .

OPERATIONS RESEARCH, 1984, 32 (02) :449-450

[6]

Johnson E. L., 1981, Operations Research Letters, V1, P18, DOI 10.1016/0167-6377(81)90019-5

[7] APPLICATION OF PROGRAMS WITH MAXIMIN OBJECTIVE FUNCTIONS TO PROBLEMS OF OPTIMAL RESOURCE-ALLOCATION [J].

KAPLAN, S .

OPERATIONS RESEARCH, 1974, 22 (04) :802-807

[8] LINEAR MAX-MIN PROGRAMMING [J].

POSNER, ME ;

WU, CT .

MATHEMATICAL PROGRAMMING, 1981, 20 (02) :166-172

[9] MULTIPLE-CHOICE KNAPSACK PROBLEM [J].

SINHA, P ;

ZOLTNERS, AA .

OPERATIONS RESEARCH, 1979, 27 (03) :503-533

[10] THE LINEAR MULTIPLE-CHOICE KNAPSACK-PROBLEM [J].

ZEMEL, E .

OPERATIONS RESEARCH, 1980, 28 (06) :1412-1423

← 1 →