Efficient algorithms for solving the 2-layered network design problem. - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

Efficient algorithms for solving the 2-layered network design problem.

Benoit Lardeux
Arnaud Knippel
Jérôme Geffard
  • Fonction : Auteur

Résumé

We present here methods that optimaly design a network built on two layers with discrete costs. This case occurs when we globaly design a virtual network (IP) on a sparse physical network (WDM). The models used results from the projection of the flow variable formulation on the binary capacity installation variables. This document is especially focused in algorithms solving a sub-problem of 2-layered network design. Its formulation expressed with binary variables is close to the famous multiple choice multidimensionnal knapsack problem (MCMK). We give numerical results for two-layered network instances obtained with a global method using algoritms inspired from the MCMK form of the master problem and compare optimal and approximate solutions for different cost configurations.
Fichier non déposé

Dates et versions

hal-01529370 , version 1 (30-05-2017)

Identifiants

  • HAL Id : hal-01529370 , version 1

Citer

Benoit Lardeux, Arnaud Knippel, Jérôme Geffard. Efficient algorithms for solving the 2-layered network design problem.. International Network Optimization Conference, Oct 2003, Evry/Paris, France. pp.367-372. ⟨hal-01529370⟩
39 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More