• 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

Integer Programming Formulations for the k-Edge-Connected 3-Hop-Constrained Network Design Problem

Thumbnail
Date
2010
Dewey
Recherche opérationnelle
Sujet
k-edge-connected network
Conference name
24th European Conference on Operational Research
Conference date
07-2010
Conference city
Lisbonne
Conference country
Portugal
URI
https://basepub.dauphine.fr/handle/123456789/5059
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Mahjoub, Ali Ridha
Diarrassouba, Ibrahima
Gabrel, Virginie
Type
Communication / Conférence
Abstract (EN)
In this paper, we study the k-edge-connected network design problem with bounded paths. We introduce new integer programming formulations for this problem. Then we study the polytopes associated with these formulations and introduce some classes of valid inequalities as well as conditions for these inequalities to define facets. Using these results, we devise Branch-and-Cut and Branch-and-Cut-and-Price algorithms for the problem and give some computational results.

  • 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.