• 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

(1,2)-Survivable Networks: Facets and Branch&Cut

Kerivin, Hervé; Mahjoub, Ali Ridha; Nocq, Charles (2004), (1,2)-Survivable Networks: Facets and Branch&Cut, in Grötschel, Martin, The Sharpest Cut: the Impact of Manfred Padberg and his Work, Mathematical Programming Society : Philadelphia, p. 121-152

Type
Chapitre d'ouvrage
Date
2004
Book title
The Sharpest Cut: the Impact of Manfred Padberg and his Work
Book author
Grötschel, Martin
Publisher
Mathematical Programming Society
Published in
Philadelphia
ISBN
0-89871-552-0
Number of pages
380
Pages
121-152
Metadata
Show full item record
Author(s)
Kerivin, Hervé
Mahjoub, Ali Ridha
Nocq, Charles
Subjects / Keywords
Programming; Combinatorial optimization

Related items

Showing items related by title and author.

  • Thumbnail
    On the Polytope of the (1,2)-Survivable Network Design Problem 
    Mahjoub, Ali Ridha; Kerivin, Hervé; Didi Biha, Mohamed (2008) Article accepté pour publication ou publié
  • Thumbnail
    Separation of partition inequalities for the (1,2)-survivable network design problem 
    Kerivin, Hervé; Mahjoub, Ali Ridha (2002) 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
    k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut 
    Diarrassouba, Ibrahima; Mahjoub, Meriem; Mahjoub, Ali Ridha; Yaman, Hande (2016) Article accepté pour publication ou publié
  • Thumbnail
    The multilayer capacitated survivable IP network design problem: valid inequalities and branch-and-cut 
    Fouilhoux, Pierre; Klopkenstein, Olivier; Mahjoub, Ali Ridha; Borne, S. (2009) Communication / Conférence
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