An integer programming approach to routing in daisy networks
Johanna Becker, Zsolt Csizmadia, Jérôme Galtier, Alexandre Laugier, Jácint Szabó, László Szegő · Networks · 2006
Abstract We are concerned with routing problems arising in special kinds of SDH 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. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 47(2), 116–121 2006