Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem

Authors:
Dragan Uroševic´;Jack Brimberg;Nenad Mladenović
Affiliations:
Mathematical Institute, Serbian Academy of Sciences, Knez Mihajlova 35, Belgrade, Yugoslavia;Department of Business Administration, Royal Military College of Canada, Kingston, Ontario, Canada and GERAD, HEC, 3000 Ch. de la Cote-Sainte-Catherine, Montreal, H3T 2A7, Quebec, Canada;Mathematical Institute, Serbian Academy of Sciences, Knez Mihajlova 35, Belgrade, Yugoslavia and GERAD, HEC, 3000 Ch. de la Cote-Sainte-Catherine, Montreal, H3T 2A7, Quebec, Canada
Venue:
Computers and Operations Research
Year:
2004

Citing 2
Cited 9

Variable neighborhood search

Computers and Operations Research
Variable Neighborhood Decomposition Search

Journal of Heuristics

A new hybrid evolutionary algorithm for the huge k-cardinality tree problem

Proceedings of the 8th annual conference on Genetic and evolutionary computation
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints

Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Local and variable neighborhood search for the k-cardinality subgraph problem

Journal of Heuristics
Obtaining optimal k-cardinality trees fast

Journal of Experimental Algorithmics (JEA)
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints

Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
An approximate solution method based on tabu search for k-minimum spanning tree problems

International Journal of Knowledge Engineering and Soft Data Paradigms
Memetic algorithms for constructing binary covering arrays of strength three

EA'09 Proceedings of the 9th international conference on Artificial evolution
Combining ant colony optimization with dynamic programming for solving the k-cardinality tree problem

IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
A variable neighbourhood search algorithm for job shop scheduling problems

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization

Quantified Score

Hi-index	0.01

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. A number of heuristic methods have been developed recently to solve this NP-hard problem. In this paper a decomposition approach is developed and implemented within a successive approximation scheme known as variable neighborhood decomposition search. This approach obtains superior results over existing methods, and furthermore, allows larger problem instances(up to 5000 nodes) to be solved more efficiently.