Article ID: | iaor20011484 |
Country: | Netherlands |
Volume: | 124 |
Issue: | 1 |
Start Page Number: | 63 |
End Page Number: | 76 |
Publication Date: | Jul 2000 |
Journal: | European Journal of Operational Research |
Authors: | Arbib Claudio, Rossi Fabrizio |
Keywords: | programming: integer |
We address a design problem that arises when a circular architecture is adopted to move resources in a system. In many of such architectures the demand directed from one node to another affects all the intermediate nodes, involving costs which increase both with the number of nodes and with the demand volume. We consider an application to network design and propose a model for designing a minimum cost hierarchical ring network. The problem is formalized as that of partitioning a set of nodes into