Heuristics and exact methods for number partitioning

European Journal of Operational Research

Volumn 202, Issue 1, 2010, Pages 73-81

  Pedroso, João Pedro ^a   Kubo, Mikio ^b  

^a UNIVERSITY OF PORTO   (Portugal)

^b TOKYO UNIVERSITY OF MARINE SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Combinatorial optimization; Heuristics; Number partitioning problem; Tree search

Indexed keywords

APPROXIMATIVE METHOD; BEAM SEARCH; BREADTH-FIRST SEARCH; COMBINATORIAL OPTIMIZATION PROBLEMS; EXACT ALGORITHMS; EXACT METHODS; HEURISTICS; NP-HARD; NUMBER PARTITIONING PROBLEM; TREE SEARCH;

COMBINATORIAL OPTIMIZATION; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY;

HEURISTIC METHODS;

EID: 70349750161     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.04.027     Document Type: Article

References (25)

1. Alidaee B., Glover F., Kochenberger G.A., and Rego C. A new modeling and solution approach for the number partitioning problem. Journal of Applied Mathematics and Decision Sciences 9 2 (2005) 113-121
2. Bauke, H., Franz, S., Mertens, S., 2004. Number partitioning as a random energy model. Journal of Statistical Mechanics: Theory and Experiment 2004 (04), P04003. .
3. Berretta R., Cotta C., and Moscato P. Enhancing the performance of memetic algorithms by using a matching-based recombination algorithm. In: Sousa J.P., and Resende M.G.C. (Eds). Metaheuristics: Computer Decision-Making (2004), Kluwer Academic Publishers, Norwell, MA, USA 65-90
4. Boettcher S., and Mertens S. Analysis of the Karmarkar-Karp differencing algorithm. European Physics Journal B (2008) 131-140
5. Coffman Jr. E.G., and Lueker G.S. Probabilistic Analysis of Packing and Partitioning Algorithms (1991), John Wiley and Sons
6. De Raedt H., Michielsen K., De Raedt K., and Miyashita S. Number partitioning on a quantum computer. Physics Letters A 290 5-6 (2001) 227-233
7. Ercegovac, M., Kirovski, D., Potkonjak, M., 1999. Low-power behavioral synthesis optimization using multiple precision arithmetic. In: DAC'99: Proceedings of the 36th ACM/IEEE Conference on Design Automation. ACM, New York, NY, USA, pp. 568-573.
8. Ferreira F.F., and Fontanari J.F. Probabilistic analysis of the number partitioning problem. Journal of Physics A 31 (1998) 3417-3428
9. Fu Y. The use and abuse of statistical mechanics in computational complexity. In: Stein D. (Ed). Lectures in the Sciences of Complexity vol. 1 (1989), Addison-Wesley Publishing Company, Reading, MA 815-826
10. Garey M.R., and Johnson D.S. Computers and Intractability (1979), W.H. Freeman, New York
11. Gent I.P., and Walsh T. Analysis of heuristics for number partitioning. Computational Intelligence 14 3 (1998) 430-451
12. Haouari M., Gharbi A., and Jemmali M. Tight bounds for the identical parallel machine scheduling problem. International Transactions in Operational Research 13 6 (2006) 529-548
13. Haouari M., and Jemmali M. Tight bounds for the identical parallel machine-scheduling problem: Part II. International Transactions in Operational Research 15 1 (2008) 19-34
14. Johnson D.S., Aragon C.R., McGeoch L.A., and Schevon C. Optimization by simulated annealing: An experimental evaluation: Part II. Graph coloring and number partitioning. Operational Research 39 3 (1991) 378-406
15. Karmarkar, N., Karp, R., 1982. The differencing method of set partitioning. Tech. Rep. UCB/CSD 82/113, University of California - Berkeley, Computer Science Division.
16. Karmarkar N., Karp R.M., Lueker G.S., and Odlyzko A.M. Probabilistic analysis of optimum partitioning. Journal of Applied Probability 23 (1986) 626-645
17. Korf R.E. A complete anytime algorithm for number partitioning. Artificial Intelligence 106 2 (1998) 181-203
18. Merkle R., and Hellman M. Hiding information and signatures in trapdoor knapsack. IEEE Transactions on Information Theory 24 5 (1978) 525-530
19. Mertens S. Phase transition in the number partitioning problem. Physical Review Letters 81 20 (1998) 4281-4284
20. Mertens S. The easiest hard problem: Number partitioning. In: Percus A., Istrate G., and Moore C. (Eds). Computational Complexity and Statistical Physics (2006), Oxford University Press, New York 125-139
21. Pedroso, J.P., 2008. Tree search for Number Partitioning: An implementation in the Python language. Internet repository, version 1.0. .
22. Pinedo M. Scheduling: Theory Algorithms and Systems (1995), Prentice-Hall, Englewood Cliffs
23. Pochet Y., and Wolsey L.A. Production Planning by Mixed Integer Programming (2006), Springer
24. Ruml W., Ngo J.T., Marks J., and Shieber S.M. Easily searched encodings for number partitioning. Journal of Optimization Theory and Applications 89 2 (1996) 251-291
25. Yakir B. The differencing algorithm LDM for partitioning: A proof of a conjecture of Karmarkar and Karp. Mathematics of Operations Research 21 1 (1996) 85-99