Robust capacity assignment in telecommunications

Computational Management Science

Volumn 3, Issue 4, 2006, Pages 285-305

  Ouorou, Adam ^a  

^a France Télécom Division RandD   (France)

Author keywords

Capacity assignment in telecommunications; Cutting plane methods; Robust optimization

Indexed keywords

EID: 33747699038     PISSN: 1619697X     EISSN: 16196988     Source Type: Journal    
DOI: 10.1007/s10287-006-0019-7     Document Type: Article

References (18)

1. Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math Oper Res 23(4):769-805
2. Ben-Tal A, Nemirovski A (2001) Lectures on modern convex optimization: analysis, algorithms and engineering applications, MPS-SIAM series on optimization
3. Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52(1): 35-53
4. Birge JR, Louveaux F(1998) Introduction to stochastic programming. Springer, Berlin Heidelberg New York
5. Bonatti M, Gaivoronski A, Lemonche P, Polese P (1994) Summary of some traffic engineering studies carried out within RACE project R1044. Eur Trans Telecommun 5(2):79-90
6. Darlington J, Pantelides CC, Rustem B, Tanyi BA (2000) Decreasing the sensitivity of open-loop optimal solutions in decision making under uncertainty. Eur J Oper Res 121:343-362
7. Elzinga J, Moore TG(1975) A central cutting plane algorithm for the convex programming problem. Math Program 8:134-145
8. Goffin J-L, Vial J-Ph(2002)Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method. Optim Methods Softw 17(5): 805-867
9. Hiriart-Urruty J-B, Lemaréchal C (1993) Convex analysis and minimization algorithms. Springer, Berlin Heidelberg New York
10. Kelley JE (1960) The cutting plane method for solving convex programs. J Soc Ind Appl Math VIII (4):703-712
11. Kennington J, Lewis K, Olinick E, Ortynski A, Spiride G(2002) Robust solutions for DWDM routing and provisioning problem: Models and algorithms. Technical Report 01-EMIS-03, Southern Methodist University, Dallas (to appear in Optical Network Magazine)
12. Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Nonconvex optimization and its applications, vol 14. Kluwer, New York
13. Lisser A, Ouorou A, Vial J-Ph, Gondzio J (1999) Capacity planning under uncertain demand in telecommunications networks. Technical Note, France Télécom R&D
14. Mulvey JM, Vanderbei RJ, Zenios SA (1995)Robust optimization of large-scale systems. Oper Res 43: 264-281
15. Nemhauser GL, Widhelm WB (1971) A modified linear program for columnar methods in mathematical programming. Oper Res 19: 1051-1060
16. Paraskevopoulos D, Karakitsos E, Rustem B(1991)Robust capacity planning under uncertainty. Manage Sci 37: 787-800
17. Rustem B, Howe M (2002) Algorithms for worst-case design and applications to management. Princeton University Press, Princeton
18. Sen S, Doverspike R, Cosares S (1994) Network planning with random demand. Telecommun Syst 3:11-30