Name
Abstract | ||
|---|---|---|
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 脳 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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/s10898-006-9025-0 | J. Global Optimization |
Keywords | Field | DocType |
Partition Problems,Combinatorial Optimization,Means | Partition problem,Discrete mathematics,Mathematical optimization,Combinatorics,Finite set,Disjoint sets,P-matrix,Matrix (mathematics),Convex hull,Convex polytope,Partition (number theory),Mathematics | Journal |
Volume | Issue | ISSN |
36 | 1 | 0925-5001 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fei-Hwang Chang | 1 | 3 | 0.72 |
| Frank K. Hwang | 2 | 0 | 0.34 |
| Uriel G. Rothblum | 3 | 595 | 125.62 |