A probabilistic tabu search algorithm for the generalized minimum spanning tree problem

A probabilistic tabu search algorithm for the...
Diptesh Ghosh, Diptesh Ghosh
A probabilistic tabu search algorithm for the generalized minimum spanning tree problem by Diptesh Ghosh, Diptesh Ghosh
Nearby Libraries

Only you can see this

Save Note
Last edited by MARC Bot
November 29, 2023 | History

A probabilistic tabu search algorithm for the generalized minimum spanning tree problem

This edition doesn't have a description yet. Can you add one?

Publish Date
Language
English

Book Details


Edition 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).

Published in
Ahmedabad
Series
Working paper ;, W.P. no. 2003-07-02, Working paper (Indian Institute of Management, Ahmedabad) ;, W.P. no. 2003-07-02.

Classifications

Library of Congress
Microfiche 2004/60558 (Q)

The Physical Object

Format
Microform
Pagination
8 leaves

Edition Identifiers

Open Library
OL3336732M
LCCN
2004327293
OCLC/WorldCat
60451355

Work Identifiers

Work ID
OL5764742W

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

Download catalog record: RDF / JSON / OPDS |

Wikipedia citation

Copy and paste this code into your Wikipedia page.

{{cite book|author=Diptesh Ghosh |date=2003 |title=A probabilistic tabu search algorithm for the generalized minimum spanning tree problem |publication-place=Ahmedabad |publisher=Indian Institute of Management |lccn=2004327293 |oclc=60451355 |ol=3336732M}}