Sciweavers

23 search results - page 2 / 5
» A branch-and-cut approach for minimum cost multi-level netwo...
Sort
View
HIS
2009
13 years 3 months ago
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
Bin Hu, Günther R. Raidl
ICALP
2005
Springer
13 years 10 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
GLOBECOM
2008
IEEE
13 years 5 months ago
Efficient Power-Aware Network Provisioning for All-Optical Multicasting in WDM Mesh Networks
Optimal network provisioning is the process of equipping the network with the devices and resources needed to support all traffic demands while minimizing the network cost. Optical...
Ashraf M. Hamad, Ahmed E. Kamal
COR
2008
142views more  COR 2008»
13 years 4 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
CDC
2010
IEEE
152views Control Systems» more  CDC 2010»
12 years 11 months ago
Optimal network topology design in multi-agent systems for efficient average consensus
The problem considered in the present article is optimal design of network topologies in multi-agent systems in order to make communication on the network as efficient as possible ...
Mohammad Rafiee, Alexandre M. Bayen