The capacitated m two node survivable star problem

The problem addressed in this paper attempts to efficiently solve a network design with redundant connections, often used by telephone operators and internet services. This network connects customers with one master node and sets some rules that shape its construction, such as number of customers, n...

Full description

Bibliographic Details

Main Author:	Bayá Mantani, Gabriel (author)
Other Authors:	Mauttone, Antonio (author), Robledo, Franco (author)
Format:	report
Language:	English
Published:	2015
Subjects:	Topological network design Survivability Greedy randomized adataptive search procedure (GRASP) Variable neigborhood search (VNS) Metaheuristics
Online Access:	http://hdl.handle.net/20.500.12008/5160
Tags:	Add Tag No Tags, Be the first to tag this record!