• 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

Two Edge-Disjoint Hop-Constrained Paths: Valid Inequalities and Branch-and-Cut

Huygens, David; Labbé, Martine; Mahjoub, Ali Ridha; Pesneau, Pierre (2005), Two Edge-Disjoint Hop-Constrained Paths: Valid Inequalities and Branch-and-Cut, International Network Optimization Conference INOC 2005, 2005-03, Lisbonne, Portugal

Type
Communication / Conférence
Date
2005
Conference title
International Network Optimization Conference INOC 2005
Conference date
2005-03
Conference city
Lisbonne
Conference country
Portugal
Pages
581-586
Metadata
Show full item record
Author(s)
Huygens, David
Labbé, Martine
Mahjoub, Ali Ridha
Pesneau, Pierre
Subjects / Keywords
Paths

Related items

Showing items related by title and author.

  • 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
    On the k edge-disjoint 2-hop-constrained paths polytope 
    Dahl, Geir; Huygens, David; Mahjoub, Ali Ridha; Pesneau, Pierre (2006) Article accepté pour publication ou publié
  • Thumbnail
    Two edge hop-constrained paths and polyhedra 
    Pesneau, Pierre; Mahjoub, Ali Ridha; Huygens, David (2004) Article accepté pour publication ou publié
  • Thumbnail
    Two-edge connected subgraph with bounded rings problem: Polyhedral results and Branch-and-Cut 
    Pesneau, Pierre; Mahjoub, Ali Ridha; McCormick, S. Thomas; Fortz, bernard (2006) Article accepté pour publication ou publié
  • Thumbnail
    Valid Inequalities and Branch-and-Cut Algorithm for the Constrained-Routing and Spectrum Assignment Problem 
    Diarrassouba, Ibrahima; Hadhbi, Youssouf; Mahjoub, Ali Ridha (2021) Document de travail / Working paper
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