An Exact Algorithm for Robust Network Design

@inproceedings{Buchheim2011AnEA,
  title={An Exact Algorithm for Robust Network Design},
  author={Christoph Buchheim and Frauke Liers and Laura Sanit{\`a}},
  booktitle={INOC},
  year={2011}
}
Modern life heavily relies on communication networks that operate efficiently. A crucial issue for the design of communication networks is robustness with respect to traffic fluctuations, since they often lead to congestion and traffic bottlenecks. In this paper, we address an NP-hard single commodity robust network design problem, where the traffic demands change over time. For k different times of the day, we are given for each node the amount of singlecommodity flow it wants to send or to… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 11 CITATIONS

Single-commodity robust network design problem: Complexity, instances and heuristic solutions

VIEW 10 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Target Cuts from Relaxed Decision Diagrams

  • INFORMS Journal on Computing
  • 2019
VIEW 1 EXCERPT
CITES BACKGROUND

Decomposition Methods and Network Design Problems

VIEW 2 EXCERPTS
CITES BACKGROUND & METHODS

The cut condition for robust network design

  • Electronic Notes in Discrete Mathematics
  • 2012
VIEW 1 EXCERPT
CITES METHODS

Similar Papers