AN O(N) ALGORITHM FOR THE MULTIPLE-CHOICE KNAPSACK LINEAR PROGRAM

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

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

[3] DYER M, UNPUB SIAM J COMPUTI

[4] DYER ME, 1981, 2 VARIABLE LINEAR PR

[5] DYER ME, 1981, GEOMETRICAL APPROACH

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

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

[8] Megiddo N., 1982, 23rd Annual Symposium on Foundations of Computer Science, P329, DOI 10.1109/SFCS.1982.24

[9] MEGIDDO N, 1982, UNPUB SOLVING LINEAR

[10] Rockafellar R.T., 1970, CONVEX ANAL

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

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

[3] DYER M, UNPUB SIAM J COMPUTI

[4] DYER ME, 1981, 2 VARIABLE LINEAR PR

[5] DYER ME, 1981, GEOMETRICAL APPROACH

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

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

[8] Megiddo N., 1982, 23rd Annual Symposium on Foundations of Computer Science, P329, DOI 10.1109/SFCS.1982.24

[9] MEGIDDO N, 1982, UNPUB SOLVING LINEAR

[10] Rockafellar R.T., 1970, CONVEX ANAL