Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJoão Pedro Pedrosoen
dc.contributor.authorMikio Kuboen
dc.description.abstractNumber 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 branch-and-bound, 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 test beds is analyzed and compared to other well known heuristics and exact algorithms.en
dc.titleHeuristics and Exact Methods for Number Partitioningen
Appears in Collections:CESE - Articles in International Journals

Files in This Item:
File Description SizeFormat 
  Restricted Access
609.07 kBAdobe PDFView/Open Request a copy

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.