• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

A Hybrid Optimization Approach For the Steiner k-Connected Network Design Problem

Diarrassouba, Ibrahima; Labidi, M. K.; Mahjoub, Ali Ridha (2018), A Hybrid Optimization Approach For the Steiner k-Connected Network Design Problem, Electronic Notes in Discrete Mathematics, 64, p. 305-314. 10.1016/j.endm.2018.02.005

Type
Article accepté pour publication ou publié
Date
2018
Journal name
Electronic Notes in Discrete Mathematics
Volume
64
Publisher
Elsevier
Pages
305-314
Publication identifier
10.1016/j.endm.2018.02.005
Metadata
Show full item record
Author(s)
Diarrassouba, Ibrahima
Laboratoire de Mathématiques Appliquées du Havre [LMAH]
Labidi, M. K.
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Mahjoub, Ali Ridha
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
In this paper, we consider the Steiner k-Edge-Connected Network Design Problem (SkESNDP). The problem finds its applications in the design of survivable telecommunications networks. We propose a parallel hybrid algorithm which aims to produce good solutions for large scale instances of the problem. Our approach is based on a Lagrangian relaxation of a flow-based integer programming formulation of the problem, a greedy and a genetic algorithms.
Subjects / Keywords
Lagrangian relaxation; large scale; genetic algorithm; hybridization; parallel computing; SkESNDP

Related items

Showing items related by title and author.

  • Thumbnail
    A parallel hybrid optimization algorithm for some network design problems 
    Diarrassouba, Ibrahima; Labidi, Mohamed Khalil; Mahjoub, Ali Ridha (2019) Article accepté pour publication ou publié
  • Thumbnail
    Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem 
    Diarrassouba, Ibrahima; Gabrel, Virginie; Mahjoub, Ali Ridha; Gouveia, Luis; Pesneau, Pierre (2016) Article accepté pour publication ou publié
  • Thumbnail
    Integer Programming Formulations for the k-Edge-Connected 3-Hop-Constrained Network Design Problem 
    Mahjoub, Ali Ridha; Diarrassouba, Ibrahima; Gabrel, Virginie (2010) Communication / Conférence
  • Thumbnail
    The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut 
    Mahjoub, Meriem; Diarrassouba, Ibrahima; Mahjoub, Ali Ridha; Taktak, Raouia (2017) Article accepté pour publication ou publié
  • Thumbnail
    Hose Workload based Exact Algorithm for the Optimal Design of Virtual Private Networks 
    Diarrassouba, Ibrahima; Youssef, Habib; Mahjoub, Ali Ridha; Lourimi, Ali (2013) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo