Problems encountered in fields like scheduling, assignment, vehicle routing are mostly NP- hard. These problems need efficient solution procedures. If confronted with an NP-hard …
EM Macambira - Annals of Operations Research, 2002 - Springer
The purpose of this article is to describe an efficient search heuristic for the Maximum Edge- weighted Subgraph (MEwS) problem. This problem requires to find a subgraph such that the …
This paper approaches the problem of designing a two-level network protected against single-edge failures. The problem simultaneously decides on the partition of the set of nodes …
S Van Hoesel - Statistica Neerlandica, 2005 - Wiley Online Library
Network design and network synthesis have been the classical optimization problems in telecommunication for a long time. In the recent past, there have been many technological …
T Thomadsen, T Stidsen - Telecommunication systems, 2005 - Springer
We consider the problem of designing hierarchical two layer ring networks. The top layer consists of a federal-ring which establishes connection between a number of node disjoint …
This article considers the problem of designing a two‐level network where the upper level consists of a backbone ring network connecting the so‐called hub nodes, and the lower …
B Fortz, M Labbé - Computational Optimization and Applications, 2004 - Springer
We study the problem of designing at minimum cost a two-connected network such that each edge belongs to a cycle using at most K edges. This problem is a particular case of the two …
A central design challenge facing network planners is how to select a cost-effective network configuration that can provide uninterrupted service despite edge failures. In this paper, we …
Network security and survivability are critical components of the global telecommunication infrastructure. However, due to a string of recent events, including the attacks on the World …