The mean-partition problem
檔案
- 000239729700002.pdf (165.2 KB, Adobe PDF)
日期
2006-09-01
類型
系所
期刊名稱
JOURNAL OF GLOBAL OPTIMIZATION
卷期與頁次
第 36 卷第 1 期,頁 21–31
ISSN
0925-5001
語言
英文
摘要
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.