標題: The mean-partition problem
作者: Chang, Fei-Hwang
Hwang, Frank K.
Rothblum, Uriel G.
應用數學系
Department of Applied Mathematics
關鍵字: partition problems;combinatorial optimization;means
公開日期: 1-Sep-2006
摘要: 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.
URI: http://dx.doi.org/10.1007/s10898-006-9025-0
http://hdl.handle.net/11536/11891
ISSN: 0925-5001
DOI: 10.1007/s10898-006-9025-0
期刊: JOURNAL OF GLOBAL OPTIMIZATION
Volume: 36
Issue: 1
起始頁: 21
結束頁: 31
Appears in Collections:Articles


Files in This Item:

  1. 000239729700002.pdf