Synthesis of 2-commodity flow networks

Synthesis of 2-commodity flow networks

0.00 Avg rating0 Votes
Article ID: iaor20072038
Country: United States
Volume: 29
Issue: 2
Start Page Number: 280
End Page Number: 288
Publication Date: May 2004
Journal: Mathematics of Operations Research
Authors: ,
Keywords: combinatorial optimization
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.