An approximate binary search algorithm for the multiple-choice knapsack problem

Information Processing Letters

Volumn 67, Issue 5, 1998, Pages 261-265

  Gens, George ^a   Levner, Eugene ^b  

^a Automation Research Institute   (Russian Federation)

^b HOLON INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Algorithms; Approximate algorithms; Approximate binary search; Knapsack problem

Indexed keywords

APPROXIMATION THEORY; BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; FUNCTIONS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

APPROXIMATE BINARY SEARCH; KNAPSACK PROBLEM;

ALGORITHMS;

EID: 0347662019     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00115-x     Document Type: Article

References (11)

1. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
2. G.V. Gens, E.V. Levner, Computational complexity of approximation algorithms for combinatorial problems, in: J. Becvar (Ed.), Mathematical Foundations of Computer Science 1979, Lecture Notes in Computer Sci., Vol. 74, Springer, Berlin, 1979, pp. 292-300.
3. G.V. Gens, E.V. Levner, Fast approximation algorithm for job sequencing with deadlines, Discrete Appl. Math. 3 (1981) 313-318.
4. T. Ibaraki, T. Hasegawa, K. Teranaka, J. Iwase, The multiple choice knapsack problem, J. Oper. Res. Soc. Japan 21 (1978) 59-95.
5. K. Iwano, S. Misono, S. Tezuka, S. Fujishige, A new scaling algorithm for the maximum mean cut problem, IBM Research Report RT 0049, Tokyo, Japan, 1990.
6. E. Lawler, Fast approximation algorithms for knapsack problems, Math. Oper. Res. 4 (1979) 339-356.
7. S. Martello, P. Toth, Knapsack Problems. Algorithms and Computational Implementations, Wiley, Chichester, 1990,
8. S. Martello, P. Toth, A note on 0.5-bounded greedy algorithm for the 0/1 knapsack problem, Inform. Process. Lett. 44 (1992) 221-222.
9. S.T. McCormick, Approximate binary search algorithms for mean cuts and cycles, Oper. Res. Lett. 14 (1993) 129-132.
10. J.B. Orlin, R.K Ahuja, New scaling algorithms for the assignment and minimum mean cycle problems, Math. Programming 54 (1992) 41-56.
11. E. Zemel, A linear time algorithm for searching ranked functions, Algorithmica 2 (1987) 81-90.