The Survivable Network Design Problems with High Node-Connectivity Constraints
Author | : Meriem Mahjoub |
Publisher | : |
Total Pages | : 132 |
Release | : 2017 |
ISBN-10 | : OCLC:1041705898 |
ISBN-13 | : |
Rating | : 4/5 ( Downloads) |
Download or read book The Survivable Network Design Problems with High Node-Connectivity Constraints written by Meriem Mahjoub and published by . This book was released on 2017 with total page 132 pages. Available in PDF, EPUB and Kindle. Book excerpt: Given a weighted undirected graph and an integer k, the k-node-connected subgraph problem is to find a minimum weight subgraph which contains k-node-disjoint paths between every pair of nodes. We introduce new classes of valid inequalities and discuss their facial aspect. We also devise separation routines, investigate the structural properties of the linear relaxation and discuss some reduction operations that can be used in a preprocessing phase for the separation. Using these results, we devise a Branch-and-Cut algorithm and present some computational results. Then we present a new extended formulation for the the k-node-connected subgraph problem, along with a Branch-and-Cut-and-Price algorithm for solving the problem.Next, we investigate the hop-constrained version of the problem. The k node-disjoint hop-constrained network design problem is to find a minimum weight subgraph such that between every origin and destination there exist at least k node-disjoint paths of length at most L. We propose an integer linear programming formulation for L=2,3 and investigate the associated polytope. We introduce valid inequalities and devise separation algorithms. Then, we propose a B\&C algorithm for solving the problem along with some computational results.