Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/758
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGhosh, Diptesh-
dc.date.accessioned2010-01-16T10:48:40Z-
dc.date.available2010-01-16T10:48:40Z-
dc.date.copyright2002-06-
dc.date.issued2010-01-16T10:48:40Z-
dc.identifier.urihttp://hdl.handle.net/11718/758-
dc.description.abstractIn this paper we concern ourselves with the problem of finding near optimal solutions to function that are not amenable to solution by analytic means. This means that given a function and a parameter ? away from the optimal value of the function. We show how this technique can be applied to combinational experience with this algorithm on benchmark asymmetric traveling salesperson problems.en
dc.language.isoenen
dc.relation.ispartofseriesW.P.;1703-
dc.subjectData correctingen
dc.subjectCombinatorial Optimizationen
dc.subjectAsymmetric traveling salesperson problemsen
dc.titleData correcting: a methodology for obtaining near-optimal solutionsen
dc.typeWorking Paperen
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP 2002_1703.pdf922.76 kBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.