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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
