Greedy algorithms for the minimization knapsack problem: Average behavior-Reference-Cited by-同舟云学术

Greedy algorithms for the minimization knapsack problem: Average behavior

Published:2008-02 Issue:1 Volume:47 Page:14-24
ISSN:1064-2307
Container-title:Journal of Computer and Systems Sciences International
language:en
Short-container-title:J. Comput. Syst. Sci. Int.

Author:

Diubin G. N.,Korbut A. A.

Publisher

Pleiades Publishing Ltd

Subject

Applied Mathematics,Computer Networks and Communications,Computer Vision and Pattern Recognition,Information Systems,Theoretical Computer Science,Control and Systems Engineering,Software

Link

http://link.springer.com/content/pdf/10.1134/S1064230708010036.pdf

Reference20 articles.

1. S. S. Skiena, “Who Is Interested in Algorithms and Why?-Lessons from the Stony Brook Algorithms Repository,” in Proceedings of the Second Workshop on Algorithm Engineering (WAE’98), Saarbrücken, Germany, 1998, pp. 204–212.

2. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems (Springer, Berlin, 2004).

3. M. R. Garey and D. S. Johnson, Computers and Intractability: The Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979; Mir, Moscow 1982.

4. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, 1982; Mir, Moscow, 1985).

5. H. Kellerer and U. Pferschy, “A New Fully Polynomial Approximation Scheme for the Knapsack Problem,” J. Combinatorial Optimiz. 3, 59–71 (1999).

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An integrated and personalized traveler information and incentive scheme for energy efficient mobility systems;Transportation Research Part C: Emerging Technologies;2020-04

2. An Integrated and Personalized Traveler Information and Incentive Scheme for Energy Efficient Mobility Systems;Transportation Research Procedia;2019