Multicommodity Network Flow Models and Algorithms in Telecommunications - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2006

Multicommodity Network Flow Models and Algorithms in Telecommunications

Pierre Bonami
  • Fonction : Auteur
Michel Minoux
  • Fonction : Auteur
  • PersonId : 846863

Résumé

We present an overview of mathematical optimization models and solution algorithms related to optimal network design and dimensioning in telecommunications. All the models discussed are expressed in terras of minimum cost multicommodity network flows with appropriate choice of link (or node) cost functions. Various special cases related to practical applications are examined, including the linear case, the linear with fixed cost case, and the case of general discontinuous nondecreasing cost functions. It is also shown how the generic models presented can accommodate a variety of constraints frequently encountered in applications, such as, among others, constraints on the choice of routes, robustness and survivability constraints. Finally we provide an overview of recent developments in solution algorithms, emphasizing those approaches capable of finding provably exact solutions, which are essentially based on general mixed integer programming techniques, relaxation, cutting-plane generation techniques and branch & cut.

Dates et versions

hal-01486916 , version 1 (10-03-2017)

Identifiants

Citer

Pierre Bonami, Michel Minoux. Multicommodity Network Flow Models and Algorithms in Telecommunications. Handbook of Optimization in Telecommunications, Kluwer Acad Publ., pp.163-184, 2006, 978-0-387-30662-9. ⟨10.1007/978-0-387-30165-5_7⟩. ⟨hal-01486916⟩
74 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More