Deployment of mobile switching centers in a telecommunications network: A stochastic programming approach

Telecommunication Systems

Volumn 26, Issue 1, 2004, Pages 93-109

  Riis, Morten ^a,b   Skriver, Anders J V ^b   Lodahl, Jørn ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b TDC ^*  (Denmark)

Author keywords

Network planning; Stochastic programming; Telecommunication

Indexed keywords

CUSTOMER SATISFACTION; DECISION MAKING; MATHEMATICAL MODELS; MOBILE TELECOMMUNICATION SYSTEMS; PROBLEM SOLVING; STOCHASTIC PROGRAMMING;

DANISH MOBILE COMMUNICATION NETWORK; MIXED-INTEGER RECOURSE; MOBILE SWITCHING CENTERS (MSC); NETWORK PLANNING;

TELECOMMUNICATION NETWORKS;

EID: 3543131854     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:TELS.0000029022.63021.09     Document Type: Article

References (20)

1. A. Balakrishnan, T. Magnanti and R. Wong, A dual-ascent procedure for large-scale uncapacitated network design, Operations Research 37 (1989) 716-740.
2. D. Bienstock, S. Chopra, O. Günlük and C.-Y. Tsai, Minimum cost capacity installation for multi-commodity network flows, Mathematical Programming 81 (1998) 177-200.
3. D. Bienstock an O. Günlük, Capacitated network design. Polyhedral structure and computation, INFORMS Journal on Computing 8(3) (1996) 243-259.
4. C. Carøe and R. Schulte, Dual decomposition in stochastic integer programming, Operations Research Letters 24 (1999) 37-45.
5. S.-G. Chang and B. Gavish, Telecommunications network topological design and capacity expansion: Formulations and algorithms, Telecommunication Systems 1 (1993) 99-131.
6. G. Dahl and M. Stoer, A cutting plane algorithm for multicommodity survivable network design problems, INFORMS Journal on Computing 10(1) (1998) 1-11.
7. M. Dempster, E. Medova and R. Thompson, A stochastic programming approach to network planning, in: Teletraffic Contributions for the Information Age, Proc. of the 15th Internat. Teletraffic Congress - ITC 15, eds. V. Ramaswami and P. Wirth (Elsevier Science, Amsterdam, 1997) pp. 329-339.
8. O. Günlük, A branch-and-cut algorithm for capacitated network design, Mathematical Programming 86(1999) 17-39.
9. K. Jörnsten, M. Näsberg and P. Smeds, Variable splitting - a new Lagrangian relaxation approach to some mathematical programming models, Research Report LiTH-MAT-R-85-04, Department of Mathematics, Linköbing Institute of Technology (1985).
10. E. Medova, Chance-constrained stochastic programming for integrated services network management, Annals of Operations Research 81 (1998) 213-229.
11. A. Merchant and B. Sengupta, Assignment of cells to switches in PCS networks, IEEE/ACM Transactions on Networking 3(5) (1995) 521-526.
12. J. Mulvey and A. Ruszczyński, A new scenario decomposition method for large-scale stochastic optimization, Operations Research 43 (1995) 477-490.
13. G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization (Wiley-Interscience, New York, 1998).
14. M. Padberg and G. Rinaldi, A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Review 33(1) (1991) 60-100.
15. M. Riis and K. Andersen, Capacitated network design with uncertain demand, INFORMS Journal on Computing 14(3) (2002) 247-260.
16. M. Riis and J. Lodahl, A bicriteria stochastic programming model for capacity expansion in telecommunications, Mathematical Methods of Operations Research 56(1) (2002) 83-100.
17. R. Rockafellar and R.-B. Wets, Scenarios and policy aggregation in optimization under uncertainty, Mathematics of Operations Research 16 (1991) 119-147.
18. D. Saha, A. Mukherjee and P. Bhattacharya, A simple heuristic for assignment of cells to switches in a PCS network, Wireless Personal Communications 12 (2000) 209-224.
19. S. Sen, R. Doverspike and S. Cosares, Network planning with random demand, Telecommunication Systems 3 (1994) 11-30.
20. E. Tzifa, V. Demestichas, M. Theologou and M. Anagnostou, Design of the access network segment of future mobile communications systems, Wireless Personal Communications 11 (1999) 247-268.