Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/9890
Title: On the complexity of determining tolerances for epsilon-optimal solutions to min-max combinatorial optimization problem
Authors: Ghosh, Diptesh
Sierksma, G.
Keywords: Tolerances;Epsilon-Optimal Solutions
Issue Date: 22-Oct-2003
Description: Ghosh, 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-313
URI: http://hdl.handle.net/11718/9890
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.