[1] |
Garfinkel, R. S.; Nemhauser, G. L., Integer Programming (1972), John Wiley and Sons: John Wiley and Sons New York · Zbl 0271.90028 |
[2] |
Ibarra, O. H.; Kim, C. E., Fast approximation algorithms for the knapsack and sum of subset problems, J. Assoc. Comput. Mach., 22, 463-468 (1975) · Zbl 0345.90049 |
[3] |
Johnson, D. S., Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9, 256-278 (1974) · Zbl 0296.65036 |
[4] |
Karp, R. M., Reducibility among combinatorial problems, (Miller, R. E.; Thatcher, J. W., Complexity of Computer Computations (1972), Plenum Press: Plenum Press N.Y), 85-104 · Zbl 0366.68041 |
[5] |
Liu, C. L., Introduction to Combinatorial Mathematics (1968), McGraw-Hill: McGraw-Hill N.Y · Zbl 0188.03801 |
[6] |
Lueker, G. S., Two polynomial complete problems in non-negative integer programming, (Computer Science Report TR-178 (March 1975), Princeton University) |
[7] |
Sahni, S., Approximate Algorithms for the 0/1 Knapsack Problem, J. Assoc. Comput. Mach., 22, 115-124 (1975) · Zbl 0362.90066 |
[8] |
Yue, P. C.; Wong, C. K., Storage cost considerations in secondary index selection, Int. J. Comp. Inf. Sci., 4, 307-327 (1975) · Zbl 0309.68032 |