Back to Search
Start Over
Synthesis of 2-Commodity Flow Networks.
- Source :
- Mathematics of Operations Research; May2004, Vol. 29 Issue 2, p280-288, 9p
- Publication Year :
- 2004
-
Abstract
- We investigate network design under volatile conditions of link failures and trafic 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0364765X
- Volume :
- 29
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- Mathematics of Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- 13467043
- Full Text :
- https://doi.org/10.1287/moor.1030.0075