Network design with node connectivity constraints

Authors:
Héctor Cancela;Franco Robledo;Gerardo Rubino
Affiliations:
Universidad de la República, Uruguay;Universidad de la República, Uruguay;IRISA, Campus de Beaulieu 35042, CEDEX, Rennes, France
Venue:
LANC '03 Proceedings of the 2003 IFIP/ACM Latin America conference on Towards a Latin American agenda for network research
Year:
2003

Citing 3
Cited 1

Generalized Steiner problem in series-parallel networks

Journal of Algorithms
Steiner problem in networks: a survey

Networks
Two-edge connected spanning subgraphs and polyhedra

Mathematical Programming: Series A and B

A cellular ant colony optimisation for the generalised Steiner problem

International Journal of Innovative Computing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Generalized Steiner Problem with Node-Connectivity constraints (GSPNC) consists of determining of a minimum cost subnetwork of a given network where some pairs of nodes are required to satisfy node-connectivity requirements. The GSPNC has applications to the design of low-cost communications networks which can survive failures in the servers as well as in the connection lines. The GSPNC is known to be NP-Complete. In this paper, we introduce an algorithm based on GRASP (Greedy Randomized Adaptive Search Procedure), an effective combinatorial optimization metaheuristic. Experimental results are obtained over a set of problem instances with different characteristics and connectivity requirements, obtaining in all these cases optimal or near-optimal results.