An integer programming approach to routing in daisy networks

DOI10.1002/NET.20104MaRDI QIDQ5469130zbMATH OpenOpenAlexFDO

Authors Johanna Becker, Zsolt Csizmadia, Jérôme Galtier, Jácint Szabó, László Szegő, A. Laugier

Publication date 16 May 2006

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20104

zbMATH Keywords

integer programmingmulticommodity flowrouting problemSDH networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Integer programming (90C10)

Recommendations

• An Integer Programming Algorithm for Routing Optimization in IP Networks
• An integer programming algorithm for routing optimization in IP networks
• Routing Through Virtual Paths in Layered Telecommunication Networks
• The non-disjoint m-ring-star problem: polyhedral results and SDH/SONET network design
• Integer programming models for the routing and spectrum allocation problem

Cited in

(1)

• Integer programming approach to the data traffic paths recovering problem

This page was built for publication: An integer programming approach to routing in daisy networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5469130)