| Article ID: | iaor2002944 |
| Country: | China |
| Volume: | 12 |
| Issue: | 7 |
| Start Page Number: | 544 |
| End Page Number: | 547 |
| Publication Date: | Jul 2000 |
| Journal: | Journal of Computer Aided Design and Computer Graphics |
| Authors: | Hao Zhifeng |
| Keywords: | knapsack problem, Partition problem |
The partition problem is fundamental to many VLSI-CAD applications. This paper is concerned with the partial-partition problem, the general partition problems and the 0–1 knapsack problem, and a new fast algorithm is proposed. The core of the algorithm is constructing the target function by a quasi-physical method.