|
 
|
[BCH16] On the edge capacitated Steiner tree problem.
Rapport Scientifique : Date de dépot: 2016/07/05, Nb pages 31. http://arxiv.org/abs/1607.07082, (Tech. Rep.: CEDRIC-16-3770)Mots clés: Mixed-integer programming, bilevel programming, survivable networks
Résumé:
Article soumis pour publication. We are interested in the design of survivable capacitated rooted Steiner networks. Given a graph G=(V,E), capacity and cost functions on E, a root r, a subset T of V of terminals and an integer k, we search for a minimum cost subset E' of E$, covering T and r, such that the network induced by E' is k-survivable: after the removal of any k edges, there still exists a feasible flow from r to T. We also consider the possibility of protecting a given number of edges. We propose three different formulations: a cut-set, a flow and a bi-level formulation where the second-level is a min-max problem (with an attacker and a defender). We propose algorithms for each problem formulation and compare their efficiency.
BibTeX
| @techreport { | |||
| BCH16, | |||
| title | = | "{On the edge capacitated Steiner tree problem.}", | |
| author | = | "C. Bentz and M.-C. Costa and A. Hertz", | |
| number | = | "{CEDRIC-16-3770}", | |
| institution | = | "{CEDRIC laboratory, CNAM-Paris, France}", | |
| date | = | {05-07-2016}, | |
| pages | = | "31. http://arxiv.org/abs/1607.07082", | |
| } | |||
