k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut
| buir.contributor.author | Yaman, Hande | |
| dc.citation.epage | 28 | en_US |
| dc.citation.issueNumber | 1-2 | en_US |
| dc.citation.spage | 5 | en_US |
| dc.citation.volumeNumber | 73 | en_US |
| dc.contributor.author | Diarrassouba, I. | en_US |
| dc.contributor.author | Mahjoub, M. | en_US |
| dc.contributor.author | Mahjoub, A. R. | en_US |
| dc.contributor.author | Yaman, Hande | en_US |
| dc.date.accessioned | 2019-02-21T16:01:20Z | |
| dc.date.available | 2019-02-21T16:01:20Z | |
| dc.date.issued | 2018 | en_US |
| dc.department | Department of Industrial Engineering | en_US |
| dc.description.abstract | Given a graph with weights on the edges, a set of origin and destination pairs of nodes, and two integers L ≥ 2 and k ≥ 2, the k-node-disjoint hop-constrained network design problem is to find a minimum weight subgraph of G such that between every origin and destination there exist at least k node-disjoint paths of length at most L. In this paper, we consider this problem from a polyhedral point of view. We propose an integer linear programming formulation for the problem for L ∈{2,3} and arbitrary k, and investigate the associated polytope. We introduce new valid inequalities for the problem for L ∈{2,3,4}, and give necessary and sufficient conditions for these inequalities to be facet defining. We also devise separation algorithms for these inequalities. Using these results, we propose a branch-and-cut algorithm for solving the problem for both L = 3 and L = 4 along with some computational results. | |
| dc.identifier.doi | 10.1007/s12243-017-0622-3 | |
| dc.identifier.issn | 0003-4347 | |
| dc.identifier.uri | http://hdl.handle.net/11693/49820 | |
| dc.language.iso | English | |
| dc.publisher | Springer-Verlag France | |
| dc.relation.isversionof | https://doi.org/10.1007/s12243-017-0622-3 | |
| dc.source.title | Annales des Telecommunications/Annals of Telecommunications | en_US |
| dc.subject | Branch-and-cut | en_US |
| dc.subject | Facets | en_US |
| dc.subject | K-node-disjoint hop-constrained paths | en_US |
| dc.subject | Polytope | en_US |
| dc.subject | Separation | en_US |
| dc.subject | Survivable network | en_US |
| dc.subject | Valid inequalities | en_US |
| dc.title | k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- knode_disjoint_hop-constrained_survivable_networks_polyhedral_analysis_and_branch_and_cut.pdf
- Size:
- 3.74 MB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version