| Article ID: | iaor2007373 |
| Country: | United States |
| Volume: | 47 |
| Issue: | 2 |
| Start Page Number: | 116 |
| End Page Number: | 121 |
| Publication Date: | Mar 2006 |
| Journal: | Networks |
| Authors: | Becker Johanna, Csizmadia Zsolt, Laugier Alexandre, Galtier Jrme, Szab Jcint, Szeg Lszl |
| Keywords: | programming: integer |
We are concerned with routing problems arising in special kinds of synchronous digital hierarchy networks, called daisy networks. Beside the capacity constraints, some disjoint edge-sets of the network, called arcs, are also prescribed. Our goal is to find a routing of the demands satisfying the capacities with the additional constraint that whenever a path (with value 1) enters an arc then it uses capacity 1 on all edges of that arc. We consider two types of arc-systems and give algorithms and computational results of integer programming formulations.