Two-Stage Robust Network Flow and Design Under Demand Uncertainty

References

• Atamtürk A. Strong formulations of robust mixed 0-1 programming. Math. Programming (2006) 108:235–250Crossref, Google Scholar
• Averbakh I. Minmax regret solutions for minmax optimization problems with uncertainty. Oper. Res. (2000) 27:57–65Google Scholar
• Averbakh I. On the complexity of a class for combinatorial optimization problems with uncertainty. Math. Programming (2001) 90:263–272Crossref, Google Scholar
• Ben-Tal A., Nemirovski A. Robust convex optimization. Math. Oper. Res. (1998) 23:769–805Link, Google Scholar
• Ben-Tal A., Nemirovski A. Robust solutions of linear programming problems contaminated with uncertain data. Math. Programming (2000) 88:411–424Crossref, Google Scholar
• Ben-Tal A., Goryashko A., Guslitzer E., Nemirovski A. Adjustable robust solutions of uncertain linear programs. Math. Programming (2004) 99:351–376Crossref, Google Scholar
• Bertsimas D., Sim M. Robust discrete optimization and network flows. Math. Programming (2003) 98:49–71Crossref, Google Scholar
• Bertsimas D., Sim M. The price of robustness. Oper. Res. (2004) 52:35–53Link, Google Scholar
• Bertsimas D., Sim M. Tractable approximations to robust conic optimization problems. Math. Programming (2006) 107:5–36Crossref, Google Scholar
• Bertsimas D., Simchi-Levi D. A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. (1996) 44:286–304Link, Google Scholar
• Bertsimas D., Thiele A. A robust optimization approach to inventory theory. Oper. Res. (2006) 54:150–168Link, Google Scholar
• Bienstock D., Özbay N. Computing robust basestock levels. (2005) . CORC Technical Report TR-2005-09, Columbia University, New YorkGoogle Scholar
• Birge J. R., Louveaux F.Introduction to Stochastic Programming (1997) (Springer, Berlin, Germany) Google Scholar
• Chen X., Sim M., Sun P., Zhang J. A linear-decision based approximation approach to stochastic programming. Oper. Res. (2006) . ForthcomingGoogle Scholar
• El Ghaoui L., Oustry F., Lebret H. Robust solutions to uncertain semidefinite programs. SIAM J. Optim. (1998) 9:33–52Crossref, Google Scholar
• Erdoğan E., Iyengar G. Ambiguous chance constrained problems and robust optimization. Math. Programming (2006) 107:37–61Crossref, Google Scholar
• Erera A. L., Morales J. C., Savelsbergh M. W. P. Robust optimization for empty repositioning problems. (2005) . Unpublished manuscriptGoogle Scholar
• Faigle U., Kern W. Computational complexity of some maximum average weight problems with precedence constraints. Oper. Res. (1994) 42:688–693Link, Google Scholar
• Gale D. A theorem of flows in networks. Pacific J. Math. (1957) 7:1073–1082Crossref, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman and Company, New York) Google Scholar
• Goldfarb D., Iyengar G. Robust portfolio selection problems. Math. Oper. Res. (2003) 28:1–38Link, Google Scholar
• Hoffman A. Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. Proc. Sympos. Appl. Math. (1960) 10American Mathematical Society, Providence, RI:113–128Crossref, Google Scholar
• Kouvelis P., Yu G.Robust Discrete Optimization and Its Applications (1997) (Kluwer Academic Publishers, Norwell, MA) Crossref, Google Scholar
• Lim A. E. B., Shanthikumar J. G. Relative entropy, exponential utility, and robust dynamic pricing. Oper. Res. (2007) 55:198–214Link, Google Scholar
• Ordóñez F., Zhao J. Robust capacity expansion of transit networks. Networks (2004) . ForthcomingGoogle Scholar
• Prékopa A., Boros E. On the existence of a feasible flow in a stochastic transportation network. Oper. Res. (1991) 39:119–129Link, Google Scholar
• Soyster A. L. Convex programming with set-inclusive constraints and applications in exact linear programming. Oper. Res. (1973) 21:1154–1157Link, Google Scholar
• Thiele A. Robust linear optimization with recourse. (2005) . Unpublished manuscriptGoogle Scholar
• Wallace S. W., Wets R. J.-B. Preprocessing in stochastic programming: The case of uncapacitated networks. ORSA J. Comput. (1989) 1:252–270Link, Google Scholar
• Wallace S. W., Wets R. J.-B. The facets of the polyhedral set determined by the Gale-Hoffman inequalities. Math. Programming (1993) 62:215–222Crossref, Google Scholar
• Wallace S. W., Wets R. J.-B. Preprocessing in stochastic programming: The case of capacitated networks. ORSA J. Comput. (1995) 7:44–62Link, Google Scholar