haku: @author Anily, S. / yhteensä: 9
viite: 7 / 9
| Tekijä: | Anily, S. Federgruen, A. |
| Otsikko: | Structured partitioning problems. |
| Lehti: | Operations Research
1991 : JAN-FEB, VOL. 39:1, p. 130-149 |
| Asiasana: | OPTIMIZATION OPERATIONAL RESEARCH |
| Kieli: | eng |
| Tiivistelmä: | In many important combinatorial optimization problems, an optimal partition into groups needs to be determined for a finite collection of objects, each of which is characterized by a single attribute. The cost of a given partition is often separable in the groups and the cost often depends on the cardinality and some aggregate measure of the attribute values in the group. Upper bounds /capacities/ may be specified for the cardinalities of the groups and the number of groups in the partition may either be fixed or variable. Easily verifiable analytical properties of the group cost function are identified. It is shown that an optimal partition exists of one of three increasingly special structures, thus allowing increasingly simple solutions. |
SCIMA