An improved variable neighborhood search based solution to the k-cardinality tree problem
Dong Wei · Shandong kexue · 2011
This paper applied variable neighborhood search(VNS) algorithm to the solution of k-card problem.This paper also defined a new neighborhood structure for the solution space,and improved the algorithm.This increased the search speed of feasible solutions in the neighborhood,and improved the quality of the approximate solutions.This algorithm was compared with the present neighborhood structure based VNS algorithm.Experimental results show its effectiveness for the k-card problem.