Survivable mobile phone network architectures: Models and solution methods

IEEE Communications Magazine

Volumn 36, Issue 3, 1998, Pages 88-93

  Alevras, Dimitris ^a,b,e,f   Grötschel, Martin ^b,g,h,i,j   Jonas, Peter ^c,k,l   Paul, Ulrich ^d,l,m,n,o   Wessäly, Roland ^b,p  

^a IBM   (United States)

^b ZUSE INSTITUTE BERLIN   (Germany)

^c E Plus Mobilfunk   (Germany)

^d Otelo ^*

^e NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^f NEW YORK UNIVERSITY   (United States)

^g RUHR UNIVERSITY BOCHUM   (Germany)

^h UNIVERSITY OF BONN   (Germany)

ⁱ UNIVERSITY OF AUGSBURG   (Germany)

^j Technische Universität

^k TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

^l E Plus Mobilfunk GmbH   (Germany)

^m UNIVERSITY OF PADERBORN   (Germany)

ⁿ DEUTSCHE TELEKOM LABORATORIES   (Germany)

^o Otelo Communications GmbH and Co   (Germany)

^p TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

more..

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS;

SOFTWARE PACKAGE DISCNET;

MOBILE TELEPHONE EXCHANGES;

EID: 0032024872     PISSN: 01636804     EISSN: None     Source Type: Journal    
DOI: 10.1109/35.663332     Document Type: Article

References (16)

1. M. Minoux, "Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements," P. Hansen, ed.. Studies on Graphs and Discrete Programming, North-Holland, 1981, pp. 269-77.
2. A. Lisser, R. Sarkissian, and J.-P. Vial, "Optimal Joint Synthesis of Base and Reserve Telecommunications Network," Tech. rep., Univ. Geneva, Oct. 1995.
3. D. Bienstock and O. Günlük, "Computational Experience with a Difficult Mixed-Integer Multicommodity Flow Problem," Math. Programming, vol. 68, 1995, pp. 213-37.
4. T. L. Magnanti, P. Mirchandani, and R. Vachani, "The Convex Hull of Two Core Capacitated Network Design Problems," Math. Programming, vol. 60, 1993, pp. 233-50.
5. T. L. Magnanti, P. Mirchandani, and R. Vachani, "Modeling and Solving the Two-Facility Capacitated Network Loading Problem," Ops. Res., vol. 43, no. 1, 1995, pp. 142-56.
6. G. Dahl and M. Stoer, "MULTISUN - Mathematical Model and Algorithms,: Tech. rep. TF-R-46/92, Televerkets Forskningsinstitut, Norway, 1992.
7. M. Stoer and G. Dahl, "A Polyhedral Approach to Multicommodity Survivable Network Design," Numerische Mathematik, vol. 68, 1994, pp. 149-67.
8. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, New York: Wiley, 1988.
9. M. Padberg, Linear Optimization and Extensions, Berlin: Springer-Verlag, 1995.
10. M. Grötschel, C. L. Monma, and M. Stoer, "Computational Results with a Cutting Plane Algorithm for Design Communications Networks with Low-Connectivity Constraints," Ops. Res., vol. 40, no. 2, 1992, pp. 309-30.
11. M. Grötschel, C. L. Monma, and M. Stoer, "Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints," SIAM J. Optimization, vol. 2, no. 3, 1992, pp. 474-504.
12. M. Stoer, "Design of Survivable Networks,: Lecture Notes in Mathematics, No. 1531, Berlin: Springer-Verlag, 1992.
13. D. Alevras, M. Grötschel, and R. Wessäly, "Dimensioning of Survivable Telecommunications Networks," Preprint SC-96-49, Berlin: Konrad-Zuse-Zentrum, 1996.
14. M. Iri, "On an Extension of the Maximum-Flow Minimum-Cut Theorem to Multicommodity Flows," J. Ops. Res. Soc Japan, vol. 13, 1971, pp. 129-35.
15. K. Onaga and O. Kakusho, "On Feasibility Conditions of Multicommodity Flows in Networks," Trans. Circuit Theory, vol. 18, 1971, pp. 425-29.
16. S. Martello and P. Toth, "Knapsack Problems," Algorithms and Computer Implementations, Chichester, UK: Wiley, 1990.