Average behavior of greedy algorithms for the minimization knapsack problem: General coefficient distributions-Reference-Cited by-同舟云学术

Average behavior of greedy algorithms for the minimization knapsack problem: General coefficient distributions

Published:2008-09 Issue:9 Volume:48 Page:1521-1535
ISSN:0965-5425
Container-title:Computational Mathematics and Mathematical Physics
language:en
Short-container-title:Comput. Math. and Math. Phys.

Author:

Diubin G. N.,Korbut A. A.

Publisher

Pleiades Publishing Ltd

Subject

Computational Mathematics

Link

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

Reference13 articles.

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

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

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

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

5. B. Korte, “Kombinatorische Optimierung und algorithmische Prinzipien,” Okonomische Prognose-, Entscheidungs-und Gleichgewichtsmodelle (VCH, Weinheim, 1986), pp. 286–341.

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

1. The risk of algorithm transparency: How algorithm complexity drives the effects on the use of advice;Production and Operations Management;2022-06-29

2. On Combinatorial Properties of the Knapsack Problem;Computational Mathematics and Mathematical Physics;2019-08

3. Generating Functions in the Knapsack Problem;Doklady Mathematics;2018-07