A probabilistic tabu search algorithm for the generalized minimum spanning tree problem
By: Diptesh Ghosh.
Contributors: Indian Institute of Management, Ahemdabad.
Series: Working paper ;; W.P. no. 2003-07-02; Working paper (Indian Institute of Management, Ahmedabad) ;; W.P. no. 2003-07-02.
Publisher: Indian Institute of Management
Published: 2003
Place of publication: Ahmedabad
Language: eng
Format: Microform
Subjects: Algorithms.; Trees (Graph theory)
Notes: Microfiche. New Delhi : Library of Congress Office ; Washington, D.C. : Library of Congress Photoduplication Service, 2005. 1 microfiche. Master microform held by: DLC.
Includes bibliographical references (leaves 7-8).