The capacitated m two node survivable star problem
In this paper, we address the problem of network design with redundant connections, often faced by operators of telephone and internet services. The network connects customers with one master node and is built by taking into account the rules that shape its construction, such as number of customers,...
Main Authors: | Bayá Gabriel, Mauttone Antonio, Robledo Franco |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Belgrade
2017-01-01
|
Series: | Yugoslav Journal of Operations Research |
Subjects: | |
Online Access: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2017/0354-02431600015B.pdf |
Similar Items
-
A greedy randomized adaptive search procedure application to solve the travelling salesman problem
by: Alvaro Neuenfeldt Júnior, et al.
Published: (2019-12-01) -
A heuristic algorithm for a multi-product four-layer capacitated location-routing problem
by: Mohsen Hamidi, et al.
Published: (2014-01-01) -
Greedy randomized adaptive search procedure for traveling salesman problem
by: Lee, Seung Ho
Published: (2006) -
Two Neighbourhood-based Approaches for the Set Covering Problem
by: Eduardo Meca Castro
Published: (2019-02-01) -
RETRACTED: An Efficient Metaheuristic Approach for the Multi-Period Technician Routing and Scheduling Problem
by: A. Khattara, et al.
Published: (2019-10-01)