Some constrained partitioning problems and majorization

Geir Dahl

doi:10.1016/S0377-2217(03)00256-X

Some constrained partitioning problems and majorization

2004-10-01

1

PRE

AI

DOI：10.1016/S0377-2217(03)00256-X

原文链接

原文求助

摘要

En 中文

We consider some constrained partitioning problems for a finite set of objects of different types. We look for partitions that are size- and type-similar, and, in addition, for a pair of such partitions that are very different in a certain sense. The motivation stems from a problem involving the partitioning of a set of students into smaller groups. We give these problems precise mathematical formulations and investigate these problems using the notion of majorization. A special case of one of the problems leads to a result concerning the packing of matchings in a bipartite graph. (C) 2003 Elsevier B.V. All rights reserved.

Keyword:

combinatorial optimization

partitioning

majorization

matching

Some constrained partitioning problems and majorization

摘要

AI总结

期刊

机构

引用论文