Title of article
A Tabu Search Heuristic for the Steiner Tree Problem
Author/Authors
Gendreau، Michel نويسنده , , Larochelle، Jean-Francois نويسنده , , Sanso، Brunilde نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
-161
From page
162
To page
0
Abstract
In this paper, a method for obtaining large diameter 6 graphs by replacing some vertices of a Moore bipartite diameter 6 graph with complete K(n) graphs is proposed. These complete graphs are joined to each other and to the remaining nonmodified graphs by means of new edges and by using a special diameter 2 graph. The degree of the graph so constructed coincides with the original one. © 1999 John Wiley& Sons, Inc. Networks 34: 154-161, 1999
Keywords
Steiner , tabu , graphs , diversification
Journal title
NETWORKS
Serial Year
1999
Journal title
NETWORKS
Record number
13496
Link To Document