Robust capacitated trees and networks with uniform demands *

Abstract : We are interested in the design of robust (or resilient) capacitated rooted Steiner networks in case of terminals with uniform demands. Formally, we are given a graph, capacity and cost functions on the edges, a root, a subset of nodes called terminals, and a bound k on the number of edge failures. We first study the problem where k = 1 and the network that we want to design must be a tree covering the root and the terminals: we give complexity results and propose models to optimize both the cost of the tree and the number of terminals disconnected from the root in the worst case of an edge failure, while respecting the capacity constraints on the edges. Second, we consider the problem of computing a minimum-cost survivable network, i.e., a network that covers the root and terminals even after the removal of any k edges, while still respecting the capacity constraints on the edges. We also consider the possibility of protecting a given number of edges. We propose three different formulations: a cut-set based formulation, a flow based one, and a bilevel one (with an attacker and a defender). We propose algorithms to solve each formulation and compare their efficiency.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01681373
Contributor : Thomas Ridremont <>
Submitted on : Friday, January 12, 2018 - 4:40:40 PM
Last modification on : Wednesday, July 3, 2019 - 10:48:04 AM

Files

EJCO2017VMC2etCBetTRsept21_v1....
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01681373, version 1
  • ARXIV : 1801.04696

Citation

Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont. Robust capacitated trees and networks with uniform demands *. 2017. ⟨hal-01681373⟩

Share

Metrics

Record views

62

Files downloads

26