APPROXIMATION ALGORITHMS FOR THE M-DIMENSIONAL 0-1 KNAPSACK-PROBLEM - WORST-CASE AND PROBABILISTIC ANALYSES

[1] AHO AV, 1974, DESING ANAL COMPUTER

[2] Chandra A. K., 1976, Theoretical Computer Science, V3, P293, DOI 10.1016/0304-3975(76)90048-7

[3] Erdos P., 1974, PROBABILISTIC METHOD

[4] GAREY MR, 1978, COMPUTERS INTRACTIBI

[5] APPROXIMATION ALGORITHMS FOR COMBINATORIAL PROBLEMS [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 9 (03) : 256 - 278

[6] Khachian L. G., 1979, SOV MATH DOKL, V20, P191

[7] KORTE B, 1980, 80163OR RHEIN F WILH

[8] LAWLER EL, 1977, 18TH P ANN S F COMP

[9] Oguz O., 1980, POLYNOMIAL TIME APPR

[10] APPROXIMATE ALGORITHMS FOR 0/1 KNAPSACK PROBLEM [J]. JOURNAL OF THE ACM, 1975, 22 (01) : 115 - 124

[1] AHO AV, 1974, DESING ANAL COMPUTER

[2] Chandra A. K., 1976, Theoretical Computer Science, V3, P293, DOI 10.1016/0304-3975(76)90048-7

[3] Erdos P., 1974, PROBABILISTIC METHOD

[4] GAREY MR, 1978, COMPUTERS INTRACTIBI

[5] APPROXIMATION ALGORITHMS FOR COMBINATORIAL PROBLEMS [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 9 (03) : 256 - 278

[6] Khachian L. G., 1979, SOV MATH DOKL, V20, P191

[7] KORTE B, 1980, 80163OR RHEIN F WILH

[8] LAWLER EL, 1977, 18TH P ANN S F COMP

[9] Oguz O., 1980, POLYNOMIAL TIME APPR

[10] APPROXIMATE ALGORITHMS FOR 0/1 KNAPSACK PROBLEM [J]. JOURNAL OF THE ACM, 1975, 22 (01) : 115 - 124