Integer Programming Formulations for the k-Edge-Connected 3-Hop-Constrained Network Design Problem
Mahjoub, Ali Ridha; Diarrassouba, Ibrahima; Gabrel, Virginie (2010), Integer Programming Formulations for the k-Edge-Connected 3-Hop-Constrained Network Design Problem, 24th European Conference on Operational Research, 2010-07, Lisbonne, Portugal
Type
Communication / ConférenceDate
2010Conference title
24th European Conference on Operational ResearchConference date
2010-07Conference city
LisbonneConference country
PortugalMetadata
Show full item recordAbstract (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.Subjects / Keywords
k-edge-connected networkRelated items
Showing items related by title and author.
-
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é
-
Pesneau, Pierre; Mahjoub, Ali Ridha; Labbé, Martine; Huygens, David (2007) Article accepté pour publication ou publié
-
Diarrassouba, Ibrahima; Labidi, M. K.; Mahjoub, Ali Ridha (2018) Article accepté pour publication ou publié
-
Mahjoub, Meriem; Diarrassouba, Ibrahima; Mahjoub, Ali Ridha; Taktak, Raouia (2017) Article accepté pour publication ou publié
-
Mahjoub, Ali Ridha; Kutucu, Hakan; Diarrassouba, Ibrahima (2013) Article accepté pour publication ou publié