Please use this identifier to cite or link to this item:
https://hdl.handle.net/10216/96882| Author(s): | Joao Pedro Pedroso Kubo, M |
| Title: | Heuristics and exact methods for number partitioning |
| Issue Date: | 2010 |
| Abstract: | Number partitioning is a classical NP-hard combinatorial optimization problem, whose solution is challenging for both exact and approximative methods. This work presents a new algorithm for number partitioning, based on ideas drawn from tree search, breadth first search, and beam search. A new set of benchmark instances for this problem is also proposed. The behavior of the new method on this and other testbeds is analyzed and compared to other well known heuristics and exact algorithms. |
| Subject: | Ciência de computadores, Ciências da computação e da informação Computer science, Computer and information sciences |
| Scientific areas: | Ciências exactas e naturais::Ciências da computação e da informação Natural sciences::Computer and information sciences |
| DOI: | 10.1016/j.ejor.2009.04.027 |
| URI: | https://hdl.handle.net/10216/96882 |
| Document Type: | Artigo em Revista Científica Internacional |
| Rights: | restrictedAccess |
| Appears in Collections: | FCUP - Artigo em Revista Científica Internacional |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 49295.pdf Restricted Access | Artigo | 481.46 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.