Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/9890
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGhosh, Diptesh
dc.contributor.authorSierksma, G.
dc.date.accessioned2010-10-22T04:37:54Z
dc.date.available2010-10-22T04:37:54Z
dc.date.copyright2003
dc.date.issued2003-10-22T04:37:54Z
dc.identifier.urihttp://hdl.handle.net/11718/9890
dc.descriptionGhosh, Diptesh and Sierksma, G. (2003),On the complexity of determining tolerances for epsilon-optimal solutions to min-max combinatorial optimization problem, Applications Mathematicae., Vol. 30, No. 3, pp. 305-313en
dc.language.isoenen
dc.subjectTolerancesen
dc.subjectEpsilon-Optimal Solutionsen
dc.titleOn the complexity of determining tolerances for epsilon-optimal solutions to min-max combinatorial optimization problemen
dc.typeArticleen
Appears in Collections:Journal Articles

Files in This Item:
There are no files associated with this item.


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