IDEAS home Printed from https://ideas.repec.org/a/bla/stanee/v59y2005i2p180-205.html
   My bibliography  Save this article

Optimization in telecommunication networks

Author

Listed:
  • Stan Van Hoesel

Abstract

Network design and network synthesis have been the classical optimization problems in telecommunication for a long time. In the recent past, there have been many technological developments such as digitization of information, optical networks, Internet, and wireless networks. These developments have led to a series of new optimization problems. This manuscript gives an overview of the developments in solving both classical and modern telecom optimization problems. The classical (still actual) network design and synthesis problems are described with an emphasis on the latest developments on modelling and solving them. Mathematical theorems will be related to the models described. This includes Menger's disjoint paths theorem, the Ford–Fulkerson max‐flow‐min‐cut theorem, and also Gomory–Hu trees and the Okamura‐Seymour cut‐condition Finally, we describe recent optimization problems such as routing, wavelength assignment, and grooming in optical networks.

Suggested Citation

  • Stan Van Hoesel, 2005. "Optimization in telecommunication networks," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 59(2), pages 180-205, May.
    • Handle: RePEc:bla:stanee:v:59:y:2005:i:2:p:180-205
    DOI: 10.1111/j.1467-9574.2005.00286.x
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/j.1467-9574.2005.00286.x
    Download Restriction: no
    File URL: https://libkey.io/10.1111/j.1467-9574.2005.00286.x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Hoesel Stan van & Kraaij Anton F. van der & Mannino Carlo & Bouhtou Mustapha & Oriolo Gianpaolo, 2003. "Polynomial cases of the tarification problem," Research Memorandum 063, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    2. Bruinshoofd, W.A. & Kool, C.J.M., 2002. "The determinants of corporate liquidity in the Netherlands," Research Memorandum 013, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Y Shim & S A Gabriel & A Desai & P Sahakij & S Milner, 2008. "A fast heuristic method for minimizing traffic congestion on reconfigurable ring topologies," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(4), pages 521-539, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Müller, R.J. & Gui, H. & Vohra, R., 2004. "Dominant strategy mechanisms with multidimensional types," Research Memorandum 046, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    2. van Hoesel, Stan, 2008. "An overview of Stackelberg pricing in networks," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1393-1402, September.
    3. Grigoriev, A. & van Hoesel, C.P.M. & van der Kraaij, A.F. & Uetz, M.J. & Bouhtou, M., 2004. "Pricing network edges to cross a river," Research Memorandum 009, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    4. Ardita Todri & Francesco Scalera, 2016. "“Getting Big by Thinking Small”: An Empirical Analysis from Trading SME’s," International Journal of Business and Management, Canadian Center of Science and Education, vol. 11(8), pages 1-1, July.
    5. Luce Brotcorne & Martine Labbé & Patrice Marcotte & Gilles Savard, 2008. "Joint Design and Pricing on a Network," Operations Research, INFORMS, vol. 56(5), pages 1104-1115, October.
    6. Quang Minh Bui & Bernard Gendron & Margarida Carvalho, 2022. "A Catalog of Formulations for the Network Pricing Problem," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2658-2674, September.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:stanee:v:59:y:2005:i:2:p:180-205. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0039-0402 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.