Single source single-commodity stochastic network design
Stochastics affects the optimal design of a network. This paper examines the single-source single-commodity stochastic network design problem. We characterize the optimal designs under demand uncertainty and compare with the deterministic counterparts to outline the basic structural differences. We do this partly as a basis for developing better algorithms than are available today, partly to simply understand what constitutes robust network designs.
KeywordsSingle-commodity network design Stochastic Correlation Robustness
- Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows—theory, algorithms, and applications. Prentice-Hall, Englewood CliffsGoogle Scholar
- Gansner ER, North SC (2000) An open graph visualization system and its applications to software engineering. Softw Pract Experience 30(11): 1203–1233. doi:10.1002/1097-024X(200009)30:11<1203::AID-SPE338>3.0.CO;2-N CrossRefGoogle Scholar
- Kaut M, Wallace SW (2007) Evaluation of scenario-generation methods for stochastic programming. Pacific J Optim 3(2): 257–271Google Scholar
- Kuah GK, Perl J (1989) The feeder-bus network-design problem. J Oper Res Soc 40(8): 751–767Google Scholar