Abstract
We investigate network planning and design under volatile conditions of link failures and traffic overload. Our model is a non- simultaneous 2-commodity problem. We characterize the feasible solu- tions and using this characterization we reduce the size of the LP pro- gram. For the case that all non-zero requirements are equal we present a closed fractional optimal solution, a closed integer (where the capacities of the solution network are integer) optimal solution and we investigate the integral case for which an integer 2-commodity flow must exist for every pair of requirements.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R.E. Gomory and T.C. Hu, “Multi-terminal network flows”, J. SIAM 9, 551–570, 1961.
R.E. Gomory and T.C. Hu, “Synthesis of a communication network”, J. SIAM, 12, 348–369, 1964.
T.C. Hu, Integer Programming and Network Flows, Addison Wesley Publishing, 1969.
I. Ouveysi and A. Wirth, “On design of a survivable network architecture for dynamic routing: optimal solution strategy and an efficient heuristic”, European Journal of Operational Research, 117,30–44, 1999.
I. Ouveysi and A. Wirth, “Fast heuristics for protection networks for dynamic routing”, Journal of the operational research society, 50, 262–267, 1999.
T. Sastry, “A characterization of the two-commodity network design problem”, Networks, 36, 9–16, 2000.
S. Sridhar and R. Chandrasekaran, “Integer solution to synthesis of communication networks”, Mathematics of Operation Research, 17, 581–585, 1992.
Y. K. Tham, “Network design for simultaneous trac flow requirements”, IEICE Trans. Commun., E80-B, 930–938, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hassin, R., Levin, A. (2001). Synthesis of 2-Commodity Flow Networks. In: Aardal, K., Gerards, B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2001. Lecture Notes in Computer Science, vol 2081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45535-3_18
Download citation
DOI: https://doi.org/10.1007/3-540-45535-3_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42225-9
Online ISBN: 978-3-540-45535-6
eBook Packages: Springer Book Archive