Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Rodrigo Recoba"'
Publikováno v:
International Transactions in Operational Research. 25:523-543
In this study, a two-node-connected star problem (2NCSP) is introduced. We are given a simple graph and internal and external costs for each link of the graph. The goal is to find the minimum-cost spanning subgraph, where the core is two-node-connect
Publikováno v:
Hybrid Metaheuristics ISBN: 9783319396354
A generalization of the Ring Star Problem, called Two-Node-connected Star Problem (2NCSP), is here addressed. We are given an undirected graph, pendant-costs and core-costs. The goal is to find the minimum-cost spanning graph, where the core is a two
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14c01a2ab841c5c22faac5ac67189740
https://doi.org/10.1007/978-3-319-39636-1_8
https://doi.org/10.1007/978-3-319-39636-1_8
Autor:
Recoba, Rodrigo1 recoba@fing.edu.uy, Robledo, Franco1 frobledo@fing.edu.uy, Romero, Pablo1 promero@fing.edu.uy, Viera, Omar1 viera@fing.edu.uy
Publikováno v:
International Transactions in Operational Research. Mar2018, Vol. 25 Issue 2, p523-543. 21p. 12 Diagrams, 4 Charts.
Publikováno v:
Hybrid Metaheuristics (9783319396354); 2016, p104-117, 14p
Publikováno v:
Hybrid Metaheuristics (9783319396354); 2016, pI-XII, 12p
Autor:
Maria J. Blesa, Christian Blum, Angelo Cangelosi, Vincenzo Cutello, Alessandro Di Nuovo, Mario Pavone, El-Ghazali Talbi
This book constitutes the refereed proceedings of the 10th International Workshop on Hybrid Metaheuristics, HM 2016, held in Plymouth, UK, in June 2016. The 15 revised full papers presented were carefully reviewed and selected from 43 submissions. Th