An edition of A probabilistic tabu search algorithm for the generalized minimum spanning tree problem (2003)

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

by Diptesh Ghosh

A probabilistic tabu search algorithm for the ...

Diptesh Ghosh, Diptesh Ghosh

Locate

My Reading Lists:

Use this Work

Create a new list

Check nearby libraries

WorldCat

Buy this book

Last edited by Open Library Bot

December 5, 2010 | History

Edit

An edition of A probabilistic tabu search algorithm for the generalized minimum spanning tree problem (2003)

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

Edition	Availability
1 A probabilistic tabu search algorithm for the generalized minimum spanning tree problem 2003, Indian Institute of Management Microform in English	aaaa Locate

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

ID Numbers

Open Library: OL3336732M
LCCN: 2004327293
OCLC/WorldCat: 60451355

Source records

Library of Congress MARC record
harvard_bibliographic_metadata record

Community Reviews (0)

Feedback?

No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Created December 10, 2009
2 revisions

Download catalog record: RDF / JSON

December 5, 2010	Edited by Open Library Bot	Added subjects from MARC records.
December 10, 2009	Created by WorkBot	add works page

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

by Diptesh Ghosh