Variable neighborhood search for the k-cardinality tree

Authors:
Nenad Mladenović;Dragan Urošević
Affiliations:
Mathematical Institute of Serbian Academy of Sciences and Arts, Knez Mihailova 35, 11000 Belgrade, Serbia and Montenegro and GERAD, H.E.C, 3000, chemin de la Côte-Sainte-Catherine, Montreal H ...;Mathematical Institute of Serbian Academy of Sciences and Arts, Knez Mihailova 35, 11000 Belgrade, Serbia and Montenegro
Venue:
Metaheuristics
Year:
2004

Citing 2
Cited 1

Variable neighborhood search for the degree-constrained minimum spanning tree problem

Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem

Operations Research

Local and variable neighborhood search for the k-cardinality subgraph problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

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.