Show simple item record

dc.contributor.authorMahjoub, Ali Ridha
dc.contributor.authorDiarrassouba, Ibrahima
dc.contributor.authorGabrel, Virginie
dc.date.accessioned2010-11-15T14:59:59Z
dc.date.available2010-11-15T14:59:59Z
dc.date.issued2010
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/5059
dc.language.isoenen
dc.subjectk-edge-connected networken
dc.subject.ddc003en
dc.titleInteger Programming Formulations for the k-Edge-Connected 3-Hop-Constrained Network Design Problemen
dc.typeCommunication / Conférence
dc.description.abstractenIn 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.en
dc.description.sponsorshipprivateouien
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.conftitle24th European Conference on Operational Researchen
dc.relation.confdate2010-07
dc.relation.confcityLisbonneen
dc.relation.confcountryPortugalen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record