Skip to main content
SpringerLink
Log in

Location Problems in Telecommunications

  • Chapter
  • First Online:
Location Science

Abstract

Telecommunications is an important area of application in combinatorial optimization. A large class of problems encountered by telecommunications operators are related to location theory. The aim of this chapter is to review recent developments in the application of location models for the design of (wired) telecommunications networks. In particular, we cover the Concentrator Location Problem, the Connected Facility Location Problem, the Regenerator Location Problem and some Ring Location problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  • Alumur S, Kara BY (2008) Network hub location problems: the state of the art. Eur J Oper Res 190:1–21

    Article  Google Scholar 

  • Balakrishnan A, Magnanti T, Wong R (1995) A decomposition algorithm for local access telecommunications network expansion planning. Oper Res 43:58–76

    Article  Google Scholar 

  • Balakrishnan A, Magnanti T, Shulman A, Wong R (1991) Models for planning capacity expansion in local access telecommunication networks. Ann Oper Res 33:239–284

    Article  Google Scholar 

  • Bardossy M, Raghavan S (2010) Dual-based local search for the connected facility location and related problems. INFORMS J Comput 22:584–602

    Article  Google Scholar 

  • Bardossy MG, Raghavan S (2013) Robust optimization for the connected facility location problem. Electron Notes Discrete Math 44:149–154

    Article  Google Scholar 

  • Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math Program 98:49–71

    Article  Google Scholar 

  • Boffey TB (1989) Location problems arising in computer networks. J Oper Res Soc 40:347–354

    Article  Google Scholar 

  • Carroll P, Fortz B, Labbé M, McGarraghy S (2013) A branch-and-cut algorithm for the ring spur assignment problem. Networks 61:89–103

    Article  Google Scholar 

  • Ceselli A, Liberatore F, Righini G (2009) A computational evaluation of a general branch-and-price framework for capacitated network location problems. Ann Oper Res 167:209–251

    Article  Google Scholar 

  • Chen S, Ljubić I, Raghavan S (2010) The regenerator location problem. Networks 55:205–220

    Google Scholar 

  • Contreras I, Díaz J (2008) Scatter search for the single source capacitated facility location problem. Ann Oper Res 157:73–89

    Article  Google Scholar 

  • Contreras I, Fernández E (2012) General network design: a unified view of combined location and network design problems. Eur J Oper Res 219:680–697

    Article  Google Scholar 

  • Contreras I, Fernández E, Marín A (2009) Tight bounds from a path based formulation for the tree of hub location problem. Comput Oper Res 36(12):3117–3127

    Article  Google Scholar 

  • Contreras I, Fernández E, Marín A (2010) The tree of hubs location problem. Eur J Oper Res 202(2):390–400

    Article  Google Scholar 

  • Correia I, Gouveia L, Saldanha da Gama F (2010) Discretized formulations for capacitated location problems with modular distribution costs. Eur J Oper Res 204(2):237–244

    Article  Google Scholar 

  • Dias TCS, Sousa Filho GF, Macambira EM, Anjos L, Cabral L, Fampa MHC (2006) An efficient heuristic for the ring star problem. In: Àlvarez C, Serna M (eds) Experimental algorithms. Lecture notes in computer science, vol 4007. Springer, Berlin/Heidelberg, pp 24–35

    Chapter  Google Scholar 

  • Díaz J, Fernández E (2002) A branch-and-price algorithm for the single-source capacitated plant location. J Oper Res Soc 53:728–470

    Article  Google Scholar 

  • Duarte A, Martí R, Resende M, Silva R (2014) Improved heuristics for the regenerator location problem. Int Trans Oper Res 21:541–558

    Article  Google Scholar 

  • Eisenbrand F, Grandoni F, Rothvoß T, Schäfer G (2010) Connected facility location via random facility sampling and core detouring. J Comput Syst Sci 76:709–726

    Article  Google Scholar 

  • Flippo OE, Kolen AW, Koster AM, van de Leensel RL (2000) A dynamic programming algorithm for the local access telecommunication network expansion problem. Eur J Oper Res 127:189–202

    Article  Google Scholar 

  • Fortz B, Labbé M (2006) Design of survivable networks. In: Resende M, Pardalos P (eds) Handbook of optimization in telecommunications, Chap. 15 Springer, New York, pp 367–389

    Google Scholar 

  • Gendreau M, Potvin JY, Smires A, Soriano P (2006) Multi-period capacity expansion for a local access telecommunications network. Eur J Oper Res 172(3):1051–1066

    Article  Google Scholar 

  • Goldschmidt O, Laugier A, Olinick EV (2003) SONET/SDH ring assignment with capacity constraints. Discret Appl Math 129:99–128

    Article  Google Scholar 

  • Gollowitzer S, Ljubić I (2011) MIP models for connected facility location: a theoretical and computational study. Comput Oper Res 38:435–449

    Article  Google Scholar 

  • Gollowitzer S, Gendron B, Ljubić I (2013) A cutting plane algorithm for the capacitated connected facility location problem. Comput Optim Appl 55:647–674

    Article  Google Scholar 

  • Gourdin É, Klopfenstein O (2008) Multi-period capacitated location with modular equipments. Comput Oper Res 35:661–682

    Article  Google Scholar 

  • Gouveia L, Saldanha da Gama F (2006) On the capacitated concentrator location problem: a reformulation by discretization. Comput Oper Res 33:1242–1258

    Article  Google Scholar 

  • Holmberg K, Rönnqvist M, Yuan D (1999) An exact algorithm for the capacitated facility location problems with single sourcing. Eur J Oper Res 113:544–559

    Article  Google Scholar 

  • Kerivin H, Mahjoub A (2005) Design of survivable networks: a survey. Networks 46:1–21

    Article  Google Scholar 

  • Klincewicz JG (1998) Hub location in backbone/tributary network design: a review. Locat Sci 6:307–335

    Article  Google Scholar 

  • Labbé M, Yaman H (2006) Polyhedral analysis for concentrator location problems. Comput Optim Appl 34:377–407

    Article  Google Scholar 

  • Labbé M, Yaman H (2008) Solving the hub location problem in a star-star network. Networks 51:19–33

    Article  Google Scholar 

  • Labbé M, Laporte G, Rodríguez-Martín I, Salazar-González JJ (2004) The ring star problem: polyhedral analysis and exact algorithm. Networks 43:177–189

    Article  Google Scholar 

  • Labbé M, Laporte G, Rodríguez-Martín I, Salazar-González JJ (2005a) Locating median cycles in networks. Eur J Oper Res 160:457–470

    Article  Google Scholar 

  • Labbé M, Yaman H, Gourdin É (2005b) A branch and cut algorithm for hub location problems with single assignment. Math Program 102:371–405

    Article  Google Scholar 

  • Leitner M, Ljubić I, Sinnl M, Werner A (2013) On the two-architecture connected facility location problem. Electron Notes Discrete Math 41:359–366

    Article  Google Scholar 

  • Ljubić I (2007) A hybrid vns for connected facility location. Lect Notes Comput Sci 4771:157–169

    Article  Google Scholar 

  • Ljubić I, Putz P, Salazar-González JJ (2012) Exact approaches to the single-source network loading problem. Networks 59:89–106

    Article  Google Scholar 

  • Pióro M, Medhi D (2004) Routing, flow, and capacity design in communication and computer networks. In: The Morgan Kaufmann series in networking. Elsevier, San Francisco

    Google Scholar 

  • Pirkul H (1987) Efficient algorithms for the capacitated concentrator location problem. Comput Oper Res 14:197–208

    Article  Google Scholar 

  • Skorin-Kapov D, Skorin-Kapov J, Boljunčić V (2006) Location problems in telecommunications. In: Resende M, Pardalos P (eds) Handbook of optimization in telecommunications. Springer, New York, pp 517–544

    Chapter  Google Scholar 

  • Swamy C, Kumar A (2004) Primal-dual algorithms for connected facility location problems. Algorithmica 40:245–269

    Article  Google Scholar 

  • Yaman H (2005) Concentrator location in telecommunications networks. In: Combinatorial optimization, vol 16. Springer, New York

    Google Scholar 

Download references

Acknowledgements

The work of Bernard Fortz is supported by the Interuniversity Attraction Poles Program of the Belgian Science Policy Office.

Author information

Authors and Affiliations

  1. Département d’Informatique, Université libre de Bruxelles (ULB), Brussels, Belgium

    Bernard Fortz

Authors
  1. Bernard Fortz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bernard Fortz .

Editor information

Editors and Affiliations

  1. HEC Montréal, Montréal, Canada

    Gilbert Laporte

  2. Institute of Operations Research (IOR), Karlsruhe Institute of Technology, Karlsruhe, Germany

    Stefan Nickel

  3. DEIO-FCUL, University of Lisbon, Lisbon, Portugal

    Francisco Saldanha da Gama

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Fortz, B. (2015). Location Problems in Telecommunications. In: Laporte, G., Nickel, S., Saldanha da Gama, F. (eds) Location Science. Springer, Cham. https://doi.org/10.1007/978-3-319-13111-5_20

Download citation

Publish with us

Policies and ethics

Search

Navigation