Abstract
Combinatorial optimization problems are abundant in the telecommunications industry. In this paper, we present four real-world telecommunications applications where combinatorial optimization plays a major role. The first problem concerns the optimal location of modem pools for an internet service provider. The second problem deals with the optimal routing of permanent virtual circuits for a frame relay service. In the third problem, one seeks to optimally design a SONET ring network. The last problem comes up when planning a global telecommunications network.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Applegate, C. Lund, D. S. Johnson, S. Phillips, N. Reingold, M. G. C. Resende, and P. Winkler. A sonet ring design tool, 1997. Manuscript.
A.V. Arslan, R.W. Loose, and J.L. Strand. Transport Plan of Record, Issue 2. 0. Technical report, AT&T Network Services Division, Holmdel, NJ, January 1996.
G. R. Ash, R. H. Cardwell, and R. P. Murray. Design and optimization of networks with dynamic routing. The Bell System Technical Journal, 60: 1787–1820, 1981.
V. L. Bennett, D. J. Eaton, and R. L. Church. Selecting sites for rural health workers. Social Science Medicine, 16: 63–72, 1982.
R. Carraghan and P.M. Pardalos. An exact algorithm for the maximum clique problem. Operations Research Letters, 9: 375–382, 1990.
CCITT Blue Book, Fascicle ILS, Telephone Network and ISDN Quality of Service, Network Management and Traffic Engineering Recommendations.
C. H. Chung. Recent applications of the maximal covering location planning (M. C. L. P.) model. Journal of the European Operational Research Society, 37: 735–746, 1986.
R. Church and C. ReVelle. The maximal covering location problem. Papers of the Regional Science Association, 32: 101–118, 1974.
M. S. Daskin, P. C. Jones, and T. J. Lowe. Rationalizing tool selection in a flexble manufacturing system for sheet metal products. Operations Research, 38: 1104–1115, 1990.
F. P. Dwyer and J. R. Evans. A branch and bound algorithm for the list selection problem in direct mail advertising. Management Science, 27: 658–667, 1981.
D. J. Eaton, M. S. Daskin, D. Simmons, B. Bulloch, and G. Jansma. Determining medical service vehicle deployment in Austin, Texas. Interfaces, 15: 96–108, 1985.
M. Eisenberg. Engineering traffic networks for more than one busy hour. B. S. T. J., 546: 1–20, 1977.
A. K. Erlang. Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges. P. O. Elect. Engrs. J., 10: 189, 1917.
T. A. Feo and M. G. C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6: 109–133, 1995.
T.A. Feo and M.G.C. Resende. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8: 67–71, 1989.
Thomas A. Feo and Mauricio G. C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6: 109–133, 1995.
M.R. Garey and D.S. Johnson. Computers and intractability - A guide to the theory of NP-completeness. W.H. Freeman and Company, 1979.
David S. Johnson and Michael A. Trick, editors. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. DI-MACS Series on Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1996.
J. G. Klincewicz. Avoiding local optima in the p-hub location problem using tabu search and GRASP. Annals of Operations Research, 40: 283–302, 1992.
M. Minoux. Network synthesis and optimum network design problems: Models, solution methods and applications. Networks, 19: 313–360, 1989.
M. G. C. Resende, L. S. Pitsoulis, and P. M. Pardalos. Approximate solution of weighted MAX-SAT problems using GRASP. In D.-Z. Du, J. Gu, and P. M. Pardalos, editors, Satisfiability Problem: Theory and Applications, DIMACS Series on Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence, R.I., 1996.
M.B. Rosenwein and R.T. Wong. Physical ring generation for SONET ring networks. Technical memorandum AK0313500960328–01TM, AT&T Laboratories, Holmdel, NJ, March 1996.
D. Schilling, V. Jayaraman, and R. Barkhi. A review of covering problems in facility location. Location Science, 1: 25–55, 1993.
R. R. Stacey and D. Songhurst. Dynamic alternative routing in the british telecom trunk network. In Innovations in Switching Technology, Proceeding of the International Switching Symposium, New York, NY, 1987. IEEE Communications Society.
D. J. Sweeney, R. L. Mairose, and R. K. Martin. Strategic planning in bank location. In AIDS Proceedings, November 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Kluwer Academic Publishers
About this chapter
Cite this chapter
Resende, M.G.C. (2003). Combinatorial Optimization in Telecommunications. In: Pardalos, P.M., Korotkikh, V. (eds) Optimization and Industry: New Frontiers. Applied Optimization, vol 78. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0233-9_4
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0233-9_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7953-9
Online ISBN: 978-1-4613-0233-9
eBook Packages: Springer Book Archive