A FAST ALGORITHM FOR THE LINEAR MULTIPLE-CHOICE KNAPSACK-PROBLEM

被引：9
作者：
DUDZINSKI, K
WALUKIEWICZ, S
机构：
来源：
OPERATIONS RESEARCH LETTERS | 1984年 / 3卷 / 04期
关键词：
D O I：
10.1016/0167-6377(84)90027-0
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：205 / 209
页数：5
相关论文
共 7 条
[1]  
Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2]  
BALAS E, 1980, OPER RES, V28, P1132
[3]   AN O(N) ALGORITHM FOR THE MULTIPLE-CHOICE KNAPSACK LINEAR PROGRAM [J].
DYER, ME .
MATHEMATICAL PROGRAMMING, 1984, 29 (01) :57-63
[4]   THE COMPLEXITY OF SELECTION AND RANKING IN X + Y AND MATRICES WITH SORTED COLUMNS [J].
FREDERICKSON, GN ;
JOHNSON, DB .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1982, 24 (02) :197-208
[5]  
Johnson E. L., 1981, Operations Research Letters, V1, P18, DOI 10.1016/0167-6377(81)90019-5
[6]   MULTIPLE-CHOICE KNAPSACK PROBLEM [J].
SINHA, P ;
ZOLTNERS, AA .
OPERATIONS RESEARCH, 1979, 27 (03) :503-533
[7]   THE LINEAR MULTIPLE-CHOICE KNAPSACK-PROBLEM [J].
ZEMEL, E .
OPERATIONS RESEARCH, 1980, 28 (06) :1412-1423
1