Variable Neighborhood Search for the K-Cardinality Tree
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.
KeywordsGraphs k-cardinality tree Variable neighborhood search Optimization.
Unable to display preview. Download preview PDF.
- M. Fischetti, H. Hamacher, K. Jornsten, and F. Maffioli. Weighted k-cardinalityGoogle Scholar
- trees: Complexity and ‘polyhedral structure. Networks, 24: 11–21, 1994.Google Scholar
- L.R. Foulds and H.W. Hamacher. A new integer programming approach to (restricted) facilities layout problems allowing flexible facility shapes. Technical Report 1992–3, University of Waikato, 1992.Google Scholar
- H. Hamacher, K. Jornsten, and F. Maffioli. Weighted k-cardinality trees. Technical Report 91.023, Politecnico di Milano, 1991.Google Scholar