Heuristics and exact methods for number partitioning

Please use this identifier to cite or link to this item: https://hdl.handle.net/10216/96882

Full metadata record

DC Field	Value	Language
dc.creator	Joao Pedro Pedroso
dc.creator	Kubo, M
dc.date.accessioned	2026-06-09T01:32:50Z	-
dc.date.available	2026-06-09T01:32:50Z	-
dc.date.issued	2010
dc.identifier.issn	0377-2217
dc.identifier.other	sigarra:49295
dc.identifier.uri	https://hdl.handle.net/10216/96882	-
dc.description.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.
dc.language.iso	eng
dc.rights	restrictedAccess
dc.subject	Ciência de computadores, Ciências da computação e da informação
dc.subject	Computer science, Computer and information sciences
dc.title	Heuristics and exact methods for number partitioning
dc.type	Artigo em Revista Científica Internacional
dc.contributor.uporto	Faculdade de Ciências
dc.identifier.doi	10.1016/j.ejor.2009.04.027
dc.identifier.authenticus	P-003-7RK
dc.subject.fos	Ciências exactas e naturais::Ciências da computação e da informação
dc.subject.fos	Natural sciences::Computer and information sciences
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