Probabilistic Analysis of Knapsack Core Algorithms

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 461-470

  Beier, Rene ^a   Vöcking, Berthold ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CORRELATION METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; POISSON DISTRIBUTION; POLYNOMIALS; PROBABILITY; PROBABILITY DENSITY FUNCTION; PROBLEM SOLVING; RANDOM PROCESSES; THEOREM PROVING;

INTEGER LINEAR PROGRAM (ILP); KNAPSACK CORE ALGORITHMS;

ALGORITHMS;

EID: 1842592049     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. E. Balas and E. Zemel. An algorithm for large zero-one knapsack problems. Operations Research, Vol. 28, pp. 1130-1154, 1980.
2. R. Beier and B. Vöcking. Random Knapsack in Expected Polynomial Time. Proceedings of the 35th ACM Symposium on Theory of Computing (STOC), 232-241, 2003.
3. G. B. Dantzig. Discrete Variable Extremum Problems. Operations Research, Vol 5, pp. 266-277, 1957.
4. M. E. Dyer and A. M. Frieze. Probabilistic Analysis of the Multidimensional Knapsack Problem. Mathematics of Operations Research 14(1), 162-176, 1989.
5. A. M. Frieze. On the Lagarias-Odlyzko algorithm for the Subset-Sum Problem. SIAM J. Comput. 15(2), 536-539, 1986.
6. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1979.
7. S. Martello, D. Pisinger and P. Toth. New Trends in Exact Algorithms for the 0/1 Knapsack Problem. European Journal of Operational Research, Vol. 123, pp. 325-332, 2000.
8. S. Martello and P. Toth. Knapsack Problems - Algorithms and Computer Implementations. Wiley, 1990.
9. A. Goldberg and A. Marchetti-Spaccamela. On Finding the Exact Solution to a Zero-One Knapsack Problem. Proceedings of the 16th ACM Symposium on Theory of Computing (STOC), 359-368, 1984.
10. E. Horowitz and S. Sahni. Computing Partitions with Applications to the Knapsack Problem, J. of the ACM, Vol. 21, 277-292, 1974.
11. G. S. Lueker. On the Average Difference Between the Solutions to Linear and Integer Knapsack Problems. Applied Probability - Computer Science, The Interface, Vol. 1, Birkhäuser 1982.
12. G. S. Lueker. Exponentially Small Bounds on the Expected Optimum of the Partition and Subset Sum Problems. Random Structures and Algorithms, 12, 51-62, 1998.
13. G. Nemhauser and Z. Ullmann. Discrete Dynamic Programming and Capital Allocation. Management Science, 15(9), 494-505, 1969.
14. D. Pisinger. Algorithms for Knapsack Problems. Ph.D. thesis, DIKU, University of Copenhagen, 1995.
15. D. Pisinger and P. Toth. Knapsack Problems. In D-Z. Du, P. Pardalos (ed.), Handbook of Combinatorial Optimization, vol. 1, Kluwer Academic Publishers, 299-428, 1998.