scispace - formally typeset
Open AccessJournal ArticleDOI

A branch-and-cut algorithm for two-level survivable network design problems

Inmaculada Rodríguez-Martín, +2 more
- 01 Mar 2016 - 
- Vol. 67, pp 102-112
TLDR
This paper approaches the problem of designing a two-level network protected against single-edge failures by giving integer programming formulations and valid inequalities for the different versions of the problem, solving them using a branch-and-cut algorithm, and discussing computational results.
About: 
This article is published in Computers & Operations Research.The article was published on 2016-03-01 and is currently open access. It has received 16 citations till now. The article focuses on the topics: Backbone network & Network planning and design.

read more

Figures
Citations
More filters
Journal ArticleDOI

A multi-objective evolutionary artificial bee colony algorithm for optimizing network topology design

Amani Saad, +2 more
- 01 Feb 2018 - 
TL;DR: A goal programming-based multi-objective artificial bee colony optimization (MOABC) algorithm to solve the problem of topological design of distributed local area networks (DLANs) and results indicate that EMOABC demonstrated superior performance than all the other algorithms.
Journal ArticleDOI

Emergency transportation network design problem: Identification and evaluation of disaster response routes

Nariman Nikoo, +2 more
- 01 Mar 2018 - 
TL;DR: In this paper, the authors proposed a branch-and-cut solution method to solve the problem of finding the optimal routes for emergency vehicles considering the length, the travel time and the number of paths as performance metrics of network vulnerability.
Journal ArticleDOI

p-Median based formulations with backbone facility locations

Pablo Adasme
- 01 Jun 2018 - 
TL;DR: New mixed integer linear programming models for the p-Median problem subject to ring, tree and star backbone topology constraints on the facility locations are proposed and variable neighborhood search (VNS) meta-heuristic algorithms are proposed, one for each topology.
Journal ArticleDOI

Fuzzy goal programming-based ant colony optimization algorithm for multi-objective topology design of distributed local area networks

Salman A. Khan, +1 more
- 01 Jul 2019 - 
TL;DR: This paper formulated the DLAN topology design problem as a multi-objective optimization problem considering five design objectives and formulated the proposed fuzzy goal programming-based ant colony optimization algorithm (GPACO), which was able to find solutions of higher quality.
Journal ArticleDOI

Systems under attack-survivability rather than reliability: Concept, results, and applications

Asma Ben Yaghlane, +1 more
- 01 May 2017 - 
TL;DR: This paper introduces the concept of system survivability under attack in analogy with system reliability, and provides the expected number of attacks for each system configuration based on the particular attack strategy both for single and multiple attacks.
References
More filters
Journal ArticleDOI

On survivable network polyhedra

Hervé Kerivin, +1 more
- 01 Feb 2005 - 
TL;DR: It is shown that when the underlying network is series-parallel and r(v) is even for all [email protected]?V, the polytope is completely described by the trivial constraints and the so-called cut constraints and a polynomial time algorithm is obtained for the survivable network design problem in that class of networks.
Journal ArticleDOI

The 2-Edge-Connected Subgraph Polyhedron

Dieter Vandenbussche, +1 more
- 01 Jun 2005 - 
TL;DR: The polyhedron P(G) defined by the convex hull of 2-edge-connected subgraphs of G where multiple copies of edges may be chosen is studied and it is shown that each vertex of P( G) is also a vertex of the LP relaxation.
Journal ArticleDOI

On the Steiner 2-edge connected subgraph polytope

Ali Ridha Mahjoub, +1 more
- 01 Jul 2008 - 
TL;DR: The generalized Steiner F-partition inequalities together with the trivial and the Steiner cut inequalities suffice to describe the polytope in a class of graphs that generalizes the class of Halin graphs when the terminals have a particular disposition.
Proceedings Article

Survivability in hierarchical telecommunications networks

Oya Ekin-Karasan, +4 more
TL;DR: In this article, the problem of designing a two-level telecommunications network at minimum cost is formulated as an integer program and a facial study of the associated polytope is proposed, where valid inequalities and sufficient conditions for these inequalities to be facet defining are given.
Journal ArticleDOI

Survivability in hierarchical telecommunications networks

Pierre Fouilhoux, +4 more
- 01 Jan 2012 - 
TL;DR: This article forms the survivable hierarchical telecommunications network design problem when the backbone is 2‐edge connected and when user nodes are linked to concentrators by a point‐to‐point access network as an integer linear program and presents a facial study of the associated polytope.
Related Papers (5)

The Tree of Hubs Location Problem

Ivan Contreras, +2 more
- 16 Apr 2010 - 

Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements

Kyungchul Park, +3 more
- 01 Mar 2000 - 

Using a hybrid of exact and genetic algorithms to design survivable networks

Elham Ghashghai, +1 more
- 01 Jan 2002 - 

Provisioning a virtual private network: a network design problem for multicommodity flow

Anupam Gupta, +4 more

Compact Models for Hop-Constrained Node Survivable Network Design: An Application to MPLS

Luis Borges Gouveia, +2 more
Frequently Asked Questions (1)
Q1. What are the contributions in "A branch-and-cut algorithm for two-level survivable network design problems" ?

This paper approaches the problem of designing a two-level network protected against single-edge failures. The authors consider two survivable structures in both network levels. The aim of the problem is to minimize the total cost. The authors give integer programming formulations and valid inequalities for the different versions of the problem, solve them using a branch-and-cut algorithm, and discuss computational results.