|標題:||The mean-partition problem|
Hwang, Frank K.
Rothblum, Uriel G.
Department of Applied Mathematics
|關鍵字:||partition problems;combinatorial optimization;means|
|摘要:||In mean-partition problems the goal is to partition a finite set of elements, each associated with a d-vector, into p disjoint parts so as to optimize an objective, which depends on the averages of the vectors that are assigned to each of the parts. Each partition is then associated with a d x p matrix whose columns are the corresponding averages and a useful approach in studying the problem is to explore the mean-partition polytope, defined as the convex hull of the set of matrices associated with feasible partitions.|
|期刊:||JOURNAL OF GLOBAL OPTIMIZATION|
|Appears in Collections:||Articles|
Files in This Item: