Article ID: | iaor1993801 |
Country: | United States |
Volume: | 39 |
Issue: | 1 |
Start Page Number: | 130 |
End Page Number: | 149 |
Publication Date: | Jan 1991 |
Journal: | Operations Research |
Authors: | Anily S., Federgruen A. |
Keywords: | sets |
In many important combinatorial optimization problems, such as bin packing, allocating customer classes to queueing facilities, vehicle routing, multi-item inventory replenishment and combined routing/inventory control, an optimal partition into groups needs to be determined for a finite collection of objects; each is characterized by a single attribute. The cost is often separable in the groups and the group cost often depends on the cardinality and some aggregate measure of the attributes, such as the sum or the maximum element. An upper bound (