• 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

Integer Programming Formulations for the k-Edge-Connected 3-Hop-Constrained Network Design Problem

Mahjoub, Ali Ridha; Diarrassouba, Ibrahima; Gabrel, Virginie (2010), Integer Programming Formulations for the k-Edge-Connected 3-Hop-Constrained Network Design Problem, 24th European Conference on Operational Research, 2010-07, Lisbonne, Portugal

Type
Communication / Conférence
Date
2010
Conference title
24th European Conference on Operational Research
Conference date
2010-07
Conference city
Lisbonne
Conference country
Portugal
Metadata
Show full item record
Author(s)
Mahjoub, Ali Ridha
Diarrassouba, Ibrahima
Gabrel, Virginie
Abstract (EN)
In this paper, we study the k-edge-connected network design problem with bounded paths. We introduce new integer programming formulations for this problem. Then we study the polytopes associated with these formulations and introduce some classes of valid inequalities as well as conditions for these inequalities to define facets. Using these results, we devise Branch-and-Cut and Branch-and-Cut-and-Price algorithms for the problem and give some computational results.
Subjects / Keywords
k-edge-connected network

Related items

Showing items related by title and author.

  • 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
    The Two-Edge Connected Hop-Constrained Network Design Problem : Valid Inequalities and Branch-and-Cut 
    Pesneau, Pierre; Mahjoub, Ali Ridha; Labbé, Martine; Huygens, David (2007) Article accepté pour publication ou publié
  • Thumbnail
    A Hybrid Optimization Approach For the Steiner k-Connected Network Design Problem 
    Diarrassouba, Ibrahima; Labidi, M. K.; Mahjoub, Ali Ridha (2018) Article accepté pour publication ou publié
  • 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
    Two Node-Disjoint Hop-Constrained Survivable Network Design and Polyhedra 
    Mahjoub, Ali Ridha; Kutucu, Hakan; Diarrassouba, Ibrahima (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