| Article ID: | iaor20011952 |
| Country: | United States |
| Volume: | 47 |
| Issue: | 6 |
| Start Page Number: | 531 |
| End Page Number: | 540 |
| Publication Date: | Sep 2000 |
| Journal: | Naval Research Logistics |
| Authors: | Rothblum Uriel G., Hwang Frank K., Onn Shmuel |
We consider a class of partitioning problems where the partitioned set is a finite set of real numbers and the objective function of a partition is a function of the vector whose coordinates are the sums of the elements in each part of the given partition (the number of such parts is assumed given). We obtain an explicit solution of such partitioning problem with polynomial complexity bounds.