Explicit solution of partitioning problems over a 1‐dimensional parameter space
研究了一类划分问题，其中被划分的集合是有限实数集，目标函数是各部分元素和的函数，并给出了具有多项式复杂度的显式解。
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. © John Wiley & Sons, Inc. Naval Research Logistics 47: 531–540, 2000