TY - JOUR
T1 - Synthesis of 2-commodity flow networks
AU - Hassin, Refael
AU - Levin, Asaf
PY - 2004/5
Y1 - 2004/5
N2 - 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.
AB - 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.
KW - Combinatorial optimization
KW - Network design
KW - Survivable networks
UR - http://www.scopus.com/inward/record.url?scp=4043101027&partnerID=8YFLogxK
U2 - 10.1287/moor.1030.0075
DO - 10.1287/moor.1030.0075
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:4043101027
SN - 0364-765X
VL - 29
SP - 280
EP - 288
JO - Mathematics of Operations Research
JF - Mathematics of Operations Research
IS - 2
ER -