Author:
Beier Rene,Vöcking Berthold
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference19 articles.
1. E. Balas and E. Zemel. An algorithm for large zero-one knapsack problems.Operations Research, 28:1130–1154, 1980.
2. R. Beier, Probabilistic Analysis of Combinatorial Optimization Problems. Ph.D. thesis, Universität des Saarlandes, 2004.
3. R. Beier and B. Vöcking. Random knapsack in expected polynomial time. InProceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003), pages 232–241, San Diego, CA, 2003.
4. R. Beier and B. Vöcking. Probabilistic analysis of knapsack core algorithms. InProceedings of the 15th Annual Symposium on Discrete Algorithms (SODA 2004), pages 461–470, New Orleans, LA, 2004.
5. G. B. Dantzig. Discrete variable extremum problems.Operations Research, 5:266–277, 1957.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献