Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/3637
Full metadata record
DC FieldValueLanguage
dc.contributor.authorUsha, M-
dc.date.accessioned2012-05-01T14:34:44Z-
dc.date.available2012-05-01T14:34:44Z-
dc.date.issued1998-
dc.identifier.citation112p,iiien_US
dc.identifier.urihttp://hdl.handle.net/10263/3637-
dc.descriptionThis thesis is under supervision of Prof.T S Arthanarien_US
dc.language.isoenen_US
dc.publisherIndian Statistical Institute,Calcuttaen_US
dc.relation.ispartofseriesISI Phd thesis;TH119-
dc.subjectGraph theoryen_US
dc.subjectTraveling salesman problemen_US
dc.subjectLinear programmingen_US
dc.subjectPolytopesen_US
dc.subjectCombinatorial optimizationen_US
dc.titleSymmetric traveling salesman problem:some new insighten_US
dc.typeThesisen_US
Appears in Collections:Theses

Files in This Item:
File Description SizeFormat 
TH119.pdf3.64 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.