A complete anytime algorithm for number partitioning.
Given previous termanext term set of previous termnumbers,next term the two-way previous termnumber partitioningnext term problem is to divide them into two subsets, so that the sum of the previous termnumbersnext term in each subset are as nearly equal as possible. The problem is NP-previous termco...
| Published in: | Artificial intelligence. 106, 2 (1998). |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Subjects: |