Corpus ID: 28746445

Robust capacitated trees and networks with uniform demands

@article{Bentz2018RobustCT,
  title={Robust capacitated trees and networks with uniform demands},
  author={C{\'e}dric Bentz and Marie-Christine Costa and Pierre-Louis Poirion and Thomas Ridremont},
  journal={ArXiv},
  year={2018},
  volume={abs/1801.04696}
}
  • Cédric Bentz, Marie-Christine Costa, +1 author Thomas Ridremont
  • Published in ArXiv 2018
  • Mathematics, Computer Science
  • 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… CONTINUE READING
    2
    Twitter Mentions

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 23 REFERENCES

    V

    JH

    • DZ. Du, JM. Smith
    • Rubinstein, Advances in Steiner trees (Vol.6), Springer Science & Business Media,
    • 2013
    VIEW 1 EXCERPT

    Optimizing the Design of a Wind Farm Collection Network

    Survivable Networks

    • Chi-Geun Han
    • Computer Science
    • Encyclopedia of Optimization
    • 2009
    VIEW 1 EXCERPT