THE LINEAR MULTIPLE-CHOICE KNAPSACK-PROBLEM

[1] BALAS E, 1980, OPER RES, V28, P1132

[2] BENTLEY JL, 1978, INFORMATION PROCESSI, P7

[3] BENTLEY JL, 1976, ALGORITHMS COMPLEXIT

[4] FAST SELECTION ALGORITHM AND THE PROBLEM OF OPTIMUM DISTRIBUTION OF EFFORT [J]. JOURNAL OF THE ACM, 1979, 26 (01) : 58 - 64

[5] O(N LOG N) ALGORITHM FOR LP KNAPSACKS WITH GUB CONSTRAINTS [J]. MATHEMATICAL PROGRAMMING, 1979, 17 (03) : 345 - 361

[6] Graham R. L., 1972, Information Processing Letters, V1, P132, DOI 10.1016/0020-0190(72)90045-2

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

[8] IBARAKI T, 1978, APPROXIMATE ALGORITH

[9] JOHNSON DB, 1978, SIAM J COMPUT, V7

[10] NAUSS RM, 1975, 01 KNAPSACK PROBLEM

[1] BALAS E, 1980, OPER RES, V28, P1132

[2] BENTLEY JL, 1978, INFORMATION PROCESSI, P7

[3] BENTLEY JL, 1976, ALGORITHMS COMPLEXIT

[4] FAST SELECTION ALGORITHM AND THE PROBLEM OF OPTIMUM DISTRIBUTION OF EFFORT [J]. JOURNAL OF THE ACM, 1979, 26 (01) : 58 - 64

[5] O(N LOG N) ALGORITHM FOR LP KNAPSACKS WITH GUB CONSTRAINTS [J]. MATHEMATICAL PROGRAMMING, 1979, 17 (03) : 345 - 361

[6] Graham R. L., 1972, Information Processing Letters, V1, P132, DOI 10.1016/0020-0190(72)90045-2

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

[8] IBARAKI T, 1978, APPROXIMATE ALGORITH

[9] JOHNSON DB, 1978, SIAM J COMPUT, V7

[10] NAUSS RM, 1975, 01 KNAPSACK PROBLEM