A bicriteria stochastic programming model for capacity expansion in telecommunications

Mathematical Methods of Operations Research

Volumn 56, Issue 1, 2008, Pages 83-100

  Riis, Morten ^a   Lodahl, Jørn ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b SONOFON   (Denmark)

Author keywords

Bicriteria optimization; Capacity expansion; Integer programming; Stochastic programming; Telecommunications

Indexed keywords

EID: 0036692662     PISSN: 14322994     EISSN: 14325217     Source Type: Journal    
DOI: 10.1007/s001860200201     Document Type: Article

References (18)

1. Bienstock D, Chopra S, Günlük O, Tsai C-Y (1998) Minimum cost capacityinstallation for multicommoditynetwork flows. Mathematical Programming 81:177–200
2. Bienstock D, Günlük O (1996) Capacitated network design. Polyhedral structure and computation. INFORMS Journal on Computing 8(3):243–259
3. Birge JR, Louveaux FV (1997) Introduction to stochastic programming. Springer-Verlag, New York
4. Dahl G, Stoer M (1998) A cutting plane algorithm for multicommodity survivable network design problems. INFORMS Journal on Computing 10(1):1–11
5. Dempster MAH, Medova EA, Thompson RI (1997) A stochastic programming approach to network planning. Teletraffic Contributions for the Information Age. Proceedings of the 15th International Teletraffic Congress – ITC151:329–339
6. Günlük O (1999) A branch-and-cut algorithm for capacitated network design. Mathematical Programming 86:17–39
7. Iri M (1971) On an extension of the max-flow min-cut theorem to multicommodity flows. Journal of the Operations Research Society of Japan 13:129–135
8. Kall P, Wallace SW (1994) Stochastic programming. John Wiley and Sons, Chichester, UK
9. Medova EA (1998) Chance-constrained stochastic programming for integrated services network management. Annals of Operations Research 81:213–229
10. MirHassani SA, Lucas C, Mitra G, Messina E, Poojari CA (2000) Computational solution of capacity planning models under uncertainty. Parallel Computing 26:511–538
11. Onaga K, Kakusho O (1971) On feasibility conditions of multicommodity flows in networks. IEEE Transactions in Circuit Theory CT-18 4:425–429
12. Prékopa A (1995) Stochastic programming. Kluwer Academic Publishers, Dordrecht, Netherlands
13. Riis M, Andersen KA (2000) Capacitated network design with uncertain demand. To appear in INFORMS Journal on Computing
14. Riis M, Skriver AJV, Lodahl J (2001a) Network planning in telecommunications: A stochastic programming approach. Working Paper 2001/2, University of Aarhus, Department of Operations Research, Available at http://home.imf.au.dk/riis/
15. Riis M, Schultz R (2001b) Applying the minimum risk criterion in stochastic recourse programs. Working Paper 2001/3, University of Aarhus, Department of Operations Research. Available at http://home.imf.au.dk/riis/
16. Rios M, Marianov V, Gutierrez M (2000) Survivable capacitated network design problem: new formulation and Lagrangean relaxation. Journal of the Operational Research Society 51:574–582
17. Sen S, Doverspike RD, Cosares S (1994) Network planning with random demand. Telecommunication Systems 3:11–30
18. Steuer RE (1986) Multiple criteria optimization: Theory, computation and application. Wiley, New York