Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem
| hal.structure.identifier | Laboratoire de Mathématiques Appliquées du Havre [LMAH] | |
| dc.contributor.author | DIARRASSOUBA, Ibrahima | |
| hal.structure.identifier | Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE] | |
| dc.contributor.author | GABREL, V. | |
| hal.structure.identifier | Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE] | |
| dc.contributor.author | MAHJOUB, A. R. | |
| hal.structure.identifier | Centro de Investigação Operacional [CIO] | |
| dc.contributor.author | GOUVEIA, L. | |
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| dc.contributor.author | PESNEAU, Pierre | |
| dc.date.accessioned | 2024-04-04T03:15:10Z | |
| dc.date.available | 2024-04-04T03:15:10Z | |
| dc.date.issued | 2016-03 | |
| dc.identifier.issn | 0028-3045 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/194128 | |
| dc.description.abstractEn | In this article, we study the k-edge-connected L-hop-constrained network design problem. Given a weighted graph G = (V,E), a set D of pairs of nodes, two integers L ≥ 2 and k ≥ 2, the problem consists in finding a minimum weight subgraph of G containing at least k edge-disjoint paths of length at most L between every pair {s, t } ∈ D. We consider the problem in the case where L = 2, 3 and |D| ≥ 2. We first discuss integer programming formulations introduced in the literature. Then, we introduce new integer programming formulations for the problem that are based on the transformation of the initial undirected graph into directed layered graphs. We present a theoretical comparison of these formulations in terms of LP-bound. Finally, these formulations are tested using CPLEX and compared in a computational study for k = 3, 4, 5. | |
| dc.language.iso | en | |
| dc.publisher | Wiley | |
| dc.title.en | Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem | |
| dc.type | Article de revue | |
| dc.identifier.doi | 10.1002/net.21667 | |
| dc.subject.hal | Informatique [cs]/Recherche opérationnelle [cs.RO] | |
| bordeaux.journal | Networks | |
| bordeaux.page | pp. 148-169 | |
| bordeaux.volume | 67 | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.issue | 2 | |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-01281958 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-01281958v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Networks&rft.date=2016-03&rft.volume=67&rft.issue=2&rft.spage=pp.%20148-169&rft.epage=pp.%20148-169&rft.eissn=0028-3045&rft.issn=0028-3045&rft.au=DIARRASSOUBA,%20Ibrahima&GABREL,%20V.&MAHJOUB,%20A.%20R.&GOUVEIA,%20L.&PESNEAU,%20Pierre&rft.genre=article |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||