The Bounded-shape Sum-partition and the Single-shape Mean-partition Problems in One-dimension
博士 === 國立交通大學 === 應用數學系所 === 93 === The optimal partition problem considers the partition of n objects into p nonempty parts, and finding a partition(optimal partition) to maximize the objective function F:R^p-->R. A brute force method is to compare the values of objective function F(pi) for each...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/61878763207580339205 |