Sartaj Sahni
- 1 {:{OROWITZ, E., AND SAtINI, S, Computing partitions with apphcations to the knapsack problem. J ACM 21, 2 (April 1974), 277-292 Google Scholar
- 2 {NOARG~Or,A, G P, AND KORS~, J F A reduction algorithm for zero-one single knapsack problems. Manage Sc~ 20, 4 (Dec. 1973), 460-463.Google Scholar
- 3 JoHNsoN, D. Approximation algorithms for combinatorial problems. Proc. Fifth Annual ACM Symposium on Theory of Computing, April 1973, pp. 38-49. Google Scholar
- 4 KARP, R Reduclbfllty among combinatorial problems. In Complexity of Computer Computatwns, R E Miller and J. W. Thatcher, Eds, Plenum Press, N Y., 1972, pp 85-104Google Scholar
- 5 KOLESAR, P.J. A branch and bound algorithm for the knapsack problem. Manage. Sc~. 18 (1967), 723-735Google Scholar
- 6 NEMHAI~SER, G, ~L., AND GARFINKEL, 1~. Integer Programmzng. Wiley, New York, 1972.Google Scholar
- 7 N~MHAVS~a, G. L., ~ND ULLmAN, Z. Discrete dynamic programming and capital allocation. Manage. Sc~. i5, 9 (May 1969), 494-505Google Scholar
- 8 SA~NI, S Some related problems from network flows, game theory and integer programming. Proceedings of the 13th Annual IEEE Symposium on Switching and Automata Theory, Oct 1972, pp 130-138.Google Scholar
- 9 SA~.NI, S On the knapsack and other computatmnally related problems Ph D dins., Cornell U., Ithaca. N Y. 1973.Google Scholar
Index Terms
- Approximate Algorithms for the 0/1 Knapsack Problem
Recommendations
Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
The 0-1 quadratic knapsack problem consists of maximizing a quadratic objective function subject to a linear capacity constraint. To exactly solve large instances of this problem with a tree search algorithm (e.g., a branch and bound method), the ...
Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
<P>It is well-known that many instances of the 0-1 knapsack problem can be effectively solved to optimality also for very large values of n the number of binary variables, while other instances cannot be solved for n equal to only a few hundreds. We ...
Using a Mixed Integer Programming Tool for Solving the 0-1 Quadratic Knapsack Problem
In this paper we will consider the 0-1 quadratic knapsack problem (QKP). Our purpose is to show that using a linear reformulation of this problem and a standard mixed integer programming tool, it is possible to solve the QKP efficiently in terms of ...
Comments