• 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

The k edge-disjoint 3-hop-constrained paths polytope

Bendali, Fatiha; Mahjoub, Ali Ridha; Mailfert, Jean; Diarrassouba, Ibrahima (2010), The k edge-disjoint 3-hop-constrained paths polytope, Discrete Optimization, 7, 4, p. 222-233. http://dx.doi.org/10.1016/j.disopt.2010.05.001

Type
Article accepté pour publication ou publié
Date
2010
Journal name
Discrete Optimization
Volume
7
Number
4
Publisher
Elsevier
Pages
222-233
Publication identifier
http://dx.doi.org/10.1016/j.disopt.2010.05.001
Metadata
Show full item record
Author(s)
Bendali, Fatiha
Mahjoub, Ali Ridha
Mailfert, Jean
Diarrassouba, Ibrahima
Abstract (EN)
Given a graph G with two distinguished nodes s and t, a cost on each edge of G and two fixed integers k≥2, L≥2, the k edge-disjoint L-hop-constrained paths problem is to find a minimum cost subgraph of G such that between s and t there are at least k edge-disjoint paths of length at most L. In this paper we consider this problem from a polyhedral point of view. We give an integer programming formulation for the problem and discuss the associated polytope. In particular, we show that when L=3 and k≥2, the linear relaxation of the associated polytope, given by the trivial, the st-cut and the so-called L-path-cut inequalities, is integral. As a consequence, we obtain a polynomial time cutting plane algorithm for the problem when L=2,3 and k≥1. This generalizes the results of Huygens et al. (2004) [1] for k=2 and L=2,3 and those of Dahl et al. (2006) [2] for L=2 and k≥2. This also proves a conjecture in [1].
Subjects / Keywords
Survivable network; Edge-disjoint paths; Hop-constrained paths; Flow; Polytope; Facet

Related items

Showing items related by title and author.

  • 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
    A Branch-and-Cut algorithm for the k-edge connected subgraph problem 
    Mailfert, Jean; Mahjoub, Ali Ridha; Didi Biha, Mohamed; Ibrahima, Diarrassouba; Bendali, Fatiha (2010) Article accepté pour publication ou publié
  • Thumbnail
    Un algorithme de coupes et branchements pour le problème du sous graphe k-arête connexe 
    Bendali, Fatiha; Ibrahima, Diarrassouba; Didi Biha, Mohamed; Mahjoub, Ali Ridha; Mailfert, Jean (2006) Communication / Conférence
  • Thumbnail
    Two Edge-Disjoint Hop-Constrained Paths: Valid Inequalities and Branch-and-Cut 
    Huygens, David; Labbé, Martine; Mahjoub, Ali Ridha; Pesneau, Pierre (2005) Communication / Conférence
  • Thumbnail
    Compositions of Graphs and the Triangle-Free Subgraph Polytope 
    Bendali, Fatiha; Mailfert, Jean; Mahjoub, Ali Ridha (2002) 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