The mean-partition problem

檔案

日期

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chang, F.-H., Hwang, F. K., & Rothblum, U. G. (2006). The mean-partition problem. JOURNAL OF GLOBAL OPTIMIZATION, 36(1), 21–31. https://doi.org/10.1007/s10898-006-9025-0

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/11891