Capacitated Network Design with Uncertain Demand

References

• Bienstock D., Chopra S., Günlük O., Tsai C.-Y. Minimum cost capacity installation for multicommodity network flows. Mathematical Programming (1998) 81:177–200Crossref, Google Scholar
• Bienstock D., Günlük O. Capacitated network design. Polyhedral structure and computation. INFORMS Journal on Computing (1996) 8:243–259Link, Google Scholar
• Birge J. R., Louveaux F. V.Introduction to Stochastic Programming (1997) (Springer-Verlag, New York) Google Scholar
• Dempster M. A. H., Medova E. A., Thompson R. T. A stochastic programming approach to network planning. Tele-traffic Contributions for the Information Age. Proceedings of the 15th International Teletraffic Congress—ITC 15 (1997) 329–339Crossref, Google Scholar
• Günlük O., Pochet Y. Mixing mixed-integer inequalities. Mathematical Programming (2001) 90:429–457Crossref, Google Scholar
• Günlük O. A branch-and-cut algorithm for capacitated network design. Mathematical Programming (1999) 86:17–39Crossref, Google Scholar
• Higle J. L., Sen S. Stochastic decomposition: an algorithm for two-stage linear programs with recourse. Mathematics of Operations Research (1991) 16:650–669Link, Google Scholar
• Iri M. On an extension of the max-flow min-cut theorem to multicommodity flows. Journal of the Operations Research Society of Japan (1971) 13:129–135Google Scholar
• Laporte G., Louveaux F. V. The integer L-shaped method for stochastic integer programs with complete recourse. Operations Research Letters (1993) 13:133–142Crossref, Google Scholar
• Magnanti T. L., Mirchandani P., Vachani R. The convex hull of two core capacitated network design problems. Mathematical Programming (1993) 60:233–250Crossref, Google Scholar
• Magnanti T. L., Mirchandani P., Vachani R. Modeling and solving the two-facility capacitated network loading problem. Operations Research (1995) 43:142–157Link, Google Scholar
• Medova E. A. Chance-constrained stochastic programming for integrated services network management. Annals of Operations Research (1998) 81:213–229Crossref, Google Scholar
• Mirchandani P. Projections of the capacitated network loading problem. European Journal of Operational Research (2000) 122:534–560Crossref, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (Wiley Interscience, New York) Crossref, Google Scholar
• Onaga K., Kakusho O. On feasibility conditions of multicom-modity flows in networks. IEEE Transactions in Circuit Theory CT-18 (1971) 4:425–429Crossref, Google Scholar
• Riis M., Andersen K. A. On using stochastic programming to plan the multiperiod capacity expansion ofone connection in telecommunications. (2000) . Working Paper 2000/2, Department of Operations Research, University ofAarhus, Aarhus, DenmarkGoogle Scholar
• Rockafellar R. T., Wets R. J.-B. Scenarios and policy aggre- gation in optimization under uncertainty. Mathematics of Operations Research (1991) 16:119–147Link, Google Scholar
• Ruszczynski A. A regularized decomposition method for minimizing a sum of polyhedral functions. Mathematical Programming (1986) 35:309–333Crossref, Google Scholar
• Sen S., Doverspike R. D., Cosares S. Network planning with random demand. Telecommunication Systems (1994) 3:11–30Crossref, Google Scholar
• Van Slyke R. M., Wets R. J. L-shaped linear programs with applications to optimal control and stochastic linear programming. SIAM Journal of Applied Mathematics (1969) 17:638–663Crossref, Google Scholar
• Wollmer R. D. Two stage linear programming under uncertainty with 0-1 integer first stage variables. Mathematical Programming (1980) 19:279–288Crossref, Google Scholar