Design of survivable networks: A survey
H Kerivin, AR Mahjoub - Networks: An International Journal, 2005 - Wiley Online Library
For the past few decades, combinatorial optimization techniques have been shown to be
powerful tools for formulating and solving optimization problems arising from practical …
powerful tools for formulating and solving optimization problems arising from practical …
Benders decomposition for the hop-constrained survivable network design problem
Given a graph with nonnegative edge weights and node pairs Q, we study the problem of
constructing a minimum weight set of edges so that the induced subgraph contains at least K …
constructing a minimum weight set of edges so that the induced subgraph contains at least K …
The regenerator location problem
In this article, we introduce the regenerator location problem (RLP), which deals with a
constraint on the geographical extent of transmission in optical networks. Specifically, an …
constraint on the geographical extent of transmission in optical networks. Specifically, an …
Strong formulations for network design problems with connectivity requirements
TL Magnanti, S Raghavan - Networks: An International Journal, 2005 - Wiley Online Library
The network design problem with connectivity requirements (NDC) includes as special
cases a wide variety of celebrated combinatorial optimization problems including the …
cases a wide variety of celebrated combinatorial optimization problems including the …
Hop-constrained metric embeddings and their applications
A Filtser - 2021 IEEE 62nd Annual Symposium on Foundations …, 2022 - ieeexplore.ieee.org
In network design problems, such as compact routing, the goal is to route packets between
nodes using the (approximated) shortest paths. A desirable property of these routes is a …
nodes using the (approximated) shortest paths. A desirable property of these routes is a …
On formulations and methods for the hop-constrained minimum spanning tree problem
In this chapter we present a general framework for modeling the hopconstrained minimum
spanning tree problem (HMST) which includes formulations already presented in the …
spanning tree problem (HMST) which includes formulations already presented in the …
Labeled nearest neighbor search and metric spanners via locality sensitive orderings
A Filtser - arXiv preprint arXiv:2211.11846, 2022 - arxiv.org
Chan, Har-Peled, and Jones [SICOMP 2020] developed locality-sensitive orderings (LSO)
for Euclidean space. A $(\tau,\rho) $-LSO is a collection $\Sigma $ of orderings such that for …
for Euclidean space. A $(\tau,\rho) $-LSO is a collection $\Sigma $ of orderings such that for …
IP/MPLS-over-OTN-over-DWDM multilayer networks: an integrated three-layer capacity optimization model, a heuristic, and a study
Multilayer network design has received significant attention in current literature. Despite this,
the explicit modeling of IP/MPLS over OTN over DWDM in which the OTN layer is specifically …
the explicit modeling of IP/MPLS over OTN over DWDM in which the OTN layer is specifically …
Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation
A Konak - European Journal of Operational Research, 2012 - Elsevier
The network design problem with relays arises in telecommunications and distribution
systems where the payload must be reprocessed at intermediate stations called relays on …
systems where the payload must be reprocessed at intermediate stations called relays on …
The generalized regenerator location problem
In an optical network a signal can only travel a maximum distance d max before its quality
deteriorates to the point that it must be regenerated by installing regenerators at nodes of the …
deteriorates to the point that it must be regenerated by installing regenerators at nodes of the …