TY  - BOOK
AU  - Ghosh, Diptesh
TI  - Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem by Diptesh Ghosh (Working Paper, No. 2003-07-02/1765)
U1  - WP 2003-07-02 (1765) 
PY  - 2003///
CY  - Ahmedabad
PB  - Indian Institute of Management 
KW  - Probabilistic number theory
N2  - In this paper we present a probabilistic tabu search algorithm for the generalized minimum spanning tree problem. The basic idea behind the algorithm is to use preprocessing operations to arrive at a probability value for each vertex which roughly corresponds to its probability of being included in an optimal solution, and to use such probability values to shrink the size of the neighborhood of solutions to manageable proportions. We report results from computational experiments that demonstrate the superiority of this method over the generic tabu search method
ER  -