Premium
Explicit solution of partitioning problems over a 1‐dimensional parameter space
Author(s) -
Hwang Frank K.,
Onn Shmuel,
Rothblum Uriel G.
Publication year - 2000
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(200009)47:6<531::aid-nav6>3.0.co;2-k
Subject(s) - partition (number theory) , class (philosophy) , set (abstract data type) , mathematics , finite set , function (biology) , space (punctuation) , partition function (quantum field theory) , mathematical optimization , polynomial , graph partition , discrete mathematics , combinatorics , computer science , graph , artificial intelligence , operating system , mathematical analysis , physics , quantum mechanics , evolutionary biology , biology , programming language
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