The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Apr. 19, 2016
Filed:
Dec. 06, 2013
International Business Machines Corporation, Armonk, NY (US);
Michael D. Moffitt, Austin, TX (US);
International Business Machines Corporation, Armonk, NY (US);
Abstract
Multi-way partitioning is dramatically improved based on 'weakest-link' optimality. The set of numbers to be partitioned is subjected to pairwise decomposition with a first partition having a candidate subset (P={S}), and a lower cost bound cis set equal to a maximum cost of this subset. A recursive call is then invoked to resolve the subproblem of the second partition (P={S, S, . . . , S}). If each second candidate subset in the second partition has a cost which is less than or equal to the lower cost bound, then the first partition is returned with the second partition as an optimal solution regardless of whether the second partition is an optimal decomposition. Additional efficiency may be achieved by excluding any subset having a cost which is greater than or equal to the best cost so far. Dominated and symmetric solutions can also be excluded.