This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via Google Scholar Google Scholar Articles by Hassin, R. Articles by Levin, A. Search for Related Content

Synthesis of 2-Commodity Flow Networks

Department of Statistics and Operations Research, Tel Aviv University, Tel Aviv 69978, Israel
Department of Statistics and Operations Research, Tel Aviv University, Tel Aviv 69978, Israel
hassin{at}post.tau.ac.il
levinas{at}post.tau.ac.il

We investigate network design under volatile conditions of link failures and traffic overload. Our model is a nonsimultaneous 2-commodity problem. We characterize the feasible solutions and, using this characterization, we reduce the size of the linear program. For 0/1 requirements we present a closed fractional optimal solution, a closed integer-capacities optimal solution, and 7/6-approximation for the case in which integer 2-commodity flows are required.

Key Words: combinatorial optimization; network design; survivable networks
History: Received: January 11, 2001; revision received: February 13, 2002;revision received: June 16, 2003;