• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Steiner 2-edge connected subgraph polytopes on series-parallel graphs

Thumbnail
Date
1997
Dewey
Recherche opérationnelle
Sujet
Series-parallel graphs; Connected subgraphs; Polytopes
Journal issue
SIAM Journal on Discrete Mathematics
Volume
10
Number
3
Publication date
1997
Article pages
505-514
Publisher
SIAM
DOI
http://dx.doi.org/10.1137/S0895480193259813
URI
https://basepub.dauphine.fr/handle/123456789/3916
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Baïou, Mourad
Mahjoub, Ali Ridha
Type
Article accepté pour publication ou publié
Abstract (EN)
Given a graph G=(V,E) with weights on its edges and a set of specified nodes $S\subseteq V$, the Steiner 2-edge survivable network problem is to find a minimum weight subgraph of G such that between every two nodes of S there are at least two edge-disjoint paths. This problem has applications to the design of reliable communication and transportation networks. In this paper, we give a complete linear description of the polytope associated with the solutions to this problem when the underlying graph is series-parallel. We also discuss related polyhedra.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.