• 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

On the Steiner 2-edge connected subgraph polytope

Mahjoub, Ali Ridha; Pesneau, Pierre (2008), On the Steiner 2-edge connected subgraph polytope, RAIRO, 42, 3, p. 259-283. http://dx.doi.org/10.1051/ro:2008022

Type
Article accepté pour publication ou publié
Date
2008
Journal name
RAIRO
Volume
42
Number
3
Publisher
EDP Sciences
Pages
259-283
Publication identifier
http://dx.doi.org/10.1051/ro:2008022
Metadata
Show full item record
Author(s)
Mahjoub, Ali Ridha
Pesneau, Pierre
Abstract (EN)
In this paper, we study the Steiner 2-edge connected subgraph polytope. We introduce a large class of valid inequalities for this polytope called the generalized Steiner F-partition inequalities, that generalizes the so-called Steiner F-partition inequalities. We show that these inequalities together with the trivial and the Steiner cut inequalities completely describe the polytope on a class of graphs that generalizes the wheels. We also describe necessary conditions for these inequalities to be facet defining, and as a consequence, we obtain that the separation problem over the Steiner 2-edge connected subgraph polytope for that class of graphs can be solved in polynomial time. Moreover, we discuss that polytope in the graphs that decompose by 3-edge cutsets. And we show that the generalized Steiner F-partition inequalities together with the trivial and the Steiner cut inequalities suffice to describe the polytope in a class of graphs that generalizes the class of Halin graphs when the terminals have a particular disposition. This generalizes a result of Barahona and Mahjoub [4] for Halin graphs. This also yields a polynomial time cutting plane algorithm for the Steiner 2-edge connected subgraph problem in that class of graphs.
Subjects / Keywords
Halin graph; Steiner 2-edge connected graph; Polytope

Related items

Showing items related by title and author.

  • 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
    Critical extreme points of the 2-edge connected subgraph polytope 
    Fonlupt, Jean; Mahjoub, Ali Ridha (2006) Article accepté pour publication ou publié
  • Thumbnail
    Critical extreme points of the 2-edge connected spanning subgraph polytope 
    Fonlupt, Jean; Mahjoub, Ali Ridha (1999) Communication / Conférence
  • 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
    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é
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