|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||Variable neighborhood search for the k-cardinality tree||Series/Report no.:||Applied Optimization||Volume:||86||First page:||481||Last page:||500||Related Publication(s):||Metaheuristics: Computer Decision-Making||Issue Date:||2003||Rank:||M14||ISBN:||978-1-4419-5403-9||DOI:||10.1007/978-1-4757-4137-7_23||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.
|Keywords:||Graphs | k-cardinality tree | Variable neighborhood search | Optimization||Publisher:||Springer Link|
Show full item record
checked on Sep 26, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.