Two-stage robust network flow and design under demand uncertainty

Operations Research

Volumn 55, Issue 4, 2007, Pages 662-673

  Atamtürk, Alper ^a   Zhang, Muhong ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

Network graphs: applications; Programming: integer

Indexed keywords

FLOW VARIABLES; ROBUST NETWORK FLOW;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; INTEGER PROGRAMMING; OPTIMIZATION; UNCERTAINTY ANALYSIS;

PROBLEM SOLVING;

EID: 38549084246     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1070.0428     Document Type: Article

References (31)

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