New neighborhood search structures for the capacitated minimum spanning tree problem

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2731

Full metadata record

DC Field	Value	Language
dc.contributor	Ahuja, Ravindra K., 1956-	-
dc.contributor	Orlin, James B., 1953-	-
dc.contributor	Sharma, Dushyant, 1975-	-
dc.date	2003-04-29T05:17:04Z	-
dc.date	2003-04-29T05:17:04Z	-
dc.date	1998	-
dc.date.accessioned	2013-06-04T16:15:17Z	-
dc.date.available	2013-06-04T16:15:17Z	-
dc.date.issued	2013-06-05	-
dc.identifier	#4040	-
dc.identifier	http://hdl.handle.net/1721.1/2731	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	by Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma.	-
dc.description	Cover title. "November, 1998."	-
dc.description	Includes bibliographical references (p. 24-25).	-
dc.format	25 p.	-
dc.format	2708099 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Sloan School of Management, Massachusetts Institute of Technology	-
dc.relation	Working paper (Sloan School of Management) ; WP 4040-98.	-
dc.subject	HD28 .M414 no.4040-98	-
dc.title	New neighborhood search structures for the capacitated minimum spanning tree problem	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI