Robust network optimization under polyhedral demand uncertainty is N P-hard

Discrete Applied Mathematics

Volumn 158, Issue 5, 2010, Pages 597-603

  Minoux, M ^a  

^a SORBONNE UNIVERSITÉ   (France)

Author keywords

Multicommodity flows; Network flows; Network optimization; Polyhedral uncertainty; Robust optimization

Indexed keywords

COMPLEXITY ISSUES; DEMAND UNCERTAINTY; LINEAR PROGRAMS; LOGISTIC NETWORKS; MINIMUM COST; MULTI-COMMODITY; MULTI-COMMODITY FLOW; NETWORK FLOWS; NETWORK OPTIMIZATION; NP-HARDNESS; POWER DISTRIBUTION NETWORK; RIGHT-HAND SIDES; ROBUST NETWORK; ROBUST OPTIMIZATION;

DISTRIBUTED PARAMETER NETWORKS;

OPTIMIZATION;

EID: 75449106353     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2009.09.025     Document Type: Article

References (27)

1. Ahuja R.K., Magnanti R., and Orlin J.B. Network Flows (1993), Prentice Hall
2. Atamtürk A., and Zhang M. Two-stage robust network flow and design under demand uncertainty. Operations research 55 4 (2007) 662-673
3. Benders J.F. Partitioning procedures for solving mixed variables programming problems. Numerische Mathematik 4 (1962) 238-252
4. Ben-Ameur W., and Kerivin H. Routing of uncertain traffic demands. Optimization and Engineering 3 (2005) 283-313
5. Ben-Tal A., and Nemirovski A. Robust solutions of uncertain linear programs. Operation Research Letters 25 (1999) 1-13
6. Ben-Tal A., and Nemirovski A. Robust optimization -methodology and applications. Mathematical Programming 92 (2002) 453-480
7. Bertsimas D., and Sim M. Robust discrete optimization and network flows. Mathematical Programming B 98 (2003) 49-71
8. Bertsimas D., and Sim M. The price of robustness. Operations Research 52 1 (2004) 35-53
9. Gale D. A theorem on flows in networks. Pacific Journal of Mathematics 7 (1957) 1073-1082
10. Garey M.R., and Johnson D.S. Computers and intractability. A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Co., San Francisco
11. Grötschel M., Lovász L., and Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 2 (1981) 169-197
12. E. Guslitser, Uncertainty immunized solutions in linear programming, Master's thesis, Minerva Optimization Center, Technion, 2002. http://iew3.technion.ac.il/Labs/Opt/index.php?4
13. Gutiérrez G., Kouvelis P., and Kurawarwala A. A robustness approach to uncapacitated network design problems. EJOR 94 2 (1996) 362-376
14. Kouvelis P., and Yu G. Robust Discrete Optimization and its Applications (1997), Kluwer, Norwell, MA
15. Laguna M. Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty. Management Science 44 11 (1998) 5101-5110
16. Lomonosov M. Combinatorial approaches to multiflow problems. Discrete Applied Mathematics 11 (1985) 1-93
17. Malcom S., and Zenios S. Robust optimization for power systems capacity expansion under uncertainty. Journal ORSA 45 9 (1994) 1040-1049
18. Magnanti T., and Wong R. Network design and transportation planning: models and algorithms. Transportation Science 18 1 (1984) 1-55
19. Minoux M. Discrete cost multicommoditity network optimization problems and exact solution methods. Annals of Operations Research 106 (2001) 19-46
20. Minoux M. Optimum network design models and algorithms in transportation and communication. International Journal of Logistics, Research and Applications 6 1-2 (2003) 5-15
21. Minoux M. Robust linear programming with right-hand-side uncertainty, duality and applications. In: Floudas L.A., and Pardalos P.M. (Eds). Encyclopedia of Optimization. 2nd edition (2008), Kluwer 3317-3327
22. Minoux M. On robust maximum flow with polyhedral uncertainty sets. Optimization Letters 3 3 (2009) 367-376
23. M. Minoux, On 2-stage robust LP with RHS uncertainty: Complexity results and applications (submitted for publication)
24. Ordoñez F., and Zhao J. Robust capacity expansion of network flows. Networks (2007) 136-145
25. A. Ouorou, J.Ph. Vial, A model for robust capacity planning for telecommunication networks under demand uncertainty, in: Proceedings 6th Int. Workshop DRCN 2007, La Rochelle, France
26. Petrou G., Lemaréchal C., and Ouorou A. An approach to robust network design in telecommunications. RAIRO 41 4 (2007) 411-426
27. Prekopa A., and Boros E. On the existence of a feasible flow in a stochastic transportation network. Operations Research 39 (1991) 119-129