| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Mladenović, Nenad | - |
| dc.contributor.author | Urošević, Dragan | - |
| dc.date.accessioned | 2020-07-03T09:58:09Z | - |
| dc.date.available | 2020-07-03T09:58:09Z | - |
| dc.date.issued | 2003 | - |
| dc.identifier.isbn | 978-1-4419-5403-9 | - |
| dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/3753 | - |
| dc.description.abstract | The minimum k-cardinality tree problem on graph G consists in finding a subtree of G with exactly k edges whose sum of weights is minimum. In this paper we propose variable neighborhood search heuristic for solving it. We also analyze different shaking strategies and their influence on the final solution. New methods are compared favorably with other heuristics from the literature. | - |
| dc.publisher | Springer Link | - |
| dc.relation.ispartofseries | Applied Optimization | - |
| dc.subject | Graphs | k-cardinality tree | Variable neighborhood search | Optimization | - |
| dc.title | Variable neighborhood search for the k-cardinality tree | - |
| dc.type | Book Chapter | - |
| dc.relation.publication | Metaheuristics: Computer Decision-Making | - |
| dc.identifier.doi | 10.1007/978-1-4757-4137-7_23 | - |
| dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
| dc.relation.firstpage | 481 | - |
| dc.relation.lastpage | 500 | - |
| dc.relation.volume | 86 | - |
| dc.description.rank | M14 | - |
| item.openairetype | Book Chapter | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
| item.cerifentitytype | Publications | - |
| item.grantfulltext | none | - |
| item.fulltext | No Fulltext | - |
| crisitem.author.orcid | 0000-0001-6655-0409 | - |
| crisitem.author.orcid | 0000-0003-3607-6704 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.