Synthesis of 2-Commodity Flow Networks

References

• Gomory R. E., Hu T. C. Multi-terminal network flows. J. Soc. Indust. Appl. Math. (1961) 9:551–570Crossref, Google Scholar
• Gomory R. E., Hu T. C. Synthesis of a communication network. J. Soc. Indust. Appl. Math. (1964) 12:348–369Crossref, Google Scholar
• Hu T. C.Integer Programming and Network Flows (1969) (Addison Wesley Publishing, Reading, MA) Google Scholar
• Ouveysi I., Wirth A. On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic. Eur. J. Oper. Res. (1999a) 117:30–44Crossref, Google Scholar
• Ouveysi I., Wirth A. Fast heuristics for protection networks for dynamic routing. J. Oper. Res. Soc. (1999b) 50:262–267Crossref, Google Scholar
• Sastry T. A characterization of the two-commodity network design problem. Networks (2000) 36:9–16Crossref, Google Scholar
• Sridhar S., Chandrasekaran R. Integer solution to synthesis of communication networks. Math. Oper. Res. (1992) 17:581–585Link, Google Scholar
• Tham Y. K. Network design for simultaneous traffic flow requirements. IEICE Trans. Commun. (1997) E80-B:930–938Google Scholar