A hybrid algorithm based on simulated annealing and tabu search for k-minimum spanning tree problems
Abstract: In this paper we consider the k-minimum spanning tree problem that generalizes the famous minimum weight spanning tree problem which is one of the major classes of combinatorial optimization ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results