Zobrazeno 1 - 2
of 2
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b66529875fc11290ea0b2fd5162b956f
https://doi.org/10.1111/itor.12362
https://doi.org/10.1111/itor.12362
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
