Synthesis of 2-Commodity Flow Networks

We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 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.

• Type: Conference
• Year: 2001
• Where: IPCO
• Authors: Refael Hassin, Asaf Levin
• Keywords: Fractional Optimal Solution, Integer-capacities Optimal Solution, IPCO 2001, IPCO 2007, Optimal Solution