Author:
Fuksz Levente,Pop Petrica C.
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Arguello, M.F., Feo, T.A., Goldschmidt, O.: Randomized methods for the number partitioning problem. Computers & Operations Research 23(2), 103–111 (1996)
2. Berretta, R.E., Moscato, P., Cotta, C.: Enhancing a memetic algorithms’ performance using a matching-based recombination algorithm: results on the number partitioning problem. In: Resende, M.G.C., Souza, J. (eds.) Metaheuristics: Computer Decision-Making. Kluwer (2004)
3. Coffman, E., Lueker, G.S.: Probabilistic Analysis of Packing and Partitioning Algorithms. John Wiley & Sons, New York (1991)
4. Lecture Notes in Computer Science;D. Corne,1996
5. A Guide to the Theory of NP-Completeness;M.R. Garey,1997
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献