Optimization in telecommunication networks

Stan Van Hoesel

Statistica Neerlandica, 2005, vol. 59, issue 2, 180-205

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.

Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1111/j.1467-9574.2005.00286.x

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:stanee:v:59:y:2005:i:2:p:180-205

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0039-0402

Access Statistics for this article

Statistica Neerlandica is currently edited by Miroslav Ristic, Marijtje van Duijn and Nan van Geloven

More articles in Statistica Neerlandica from Netherlands Society for Statistics and Operations Research
Bibliographic data for series maintained by Wiley Content Delivery ().