Synthesis of 2-Commodity Flow Networks

13 years 5 months ago
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.
Refael Hassin, Asaf Levin
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2001
Where IPCO
Authors Refael Hassin, Asaf Levin
Comments (0)