Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/570
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGoldengorin, Boris-
dc.contributor.authorGhosh, Diptesh-
dc.contributor.authorGerard, Sierksma-
dc.date.accessioned2009-12-12T09:58:18Z-
dc.date.available2009-12-12T09:58:18Z-
dc.date.copyright2004-04-
dc.date.issued2009-12-12T09:58:18Z-
dc.identifier.urihttp://hdl.handle.net/11718/570-
dc.description.abstractThis paper describes data correcting algorithms. It provides the theory behind the algorithms and presents the implementation details and computational experience with these algorithms on the asymmetric traveling salesperson problem, the problem of maximizing submodular functions, and the simple plant location problem.en
dc.language.isoenen
dc.relation.ispartofseriesWP;1808-
dc.subjectCombanatorial analysisen
dc.subjectMathematical optimizationen
dc.subjectAlgorithmen
dc.titleData correcting algorithms for combinatorial optimizationen
dc.typeWorking Paperen
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP 2004_1808.pdf2.19 MBAdobe PDFView/Open


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