On the complexity of determining tolerances for epsilon-optimal solutions to min-max combinatorial optimization problem

dc.contributor.author	Ghosh, Diptesh
dc.contributor.author	Sierksma, G.
dc.date.accessioned	2010-10-22T04:37:54Z
dc.date.available	2010-10-22T04:37:54Z
dc.date.copyright	2003
dc.date.issued	2003-10-22T04:37:54Z
dc.identifier.uri	http://hdl.handle.net/11718/9890
dc.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	en
dc.language.iso	en	en
dc.subject	Tolerances	en
dc.subject	Epsilon-Optimal Solutions	en
dc.title	On the complexity of determining tolerances for epsilon-optimal solutions to min-max combinatorial optimization problem	en
dc.type	Article	en

Files in this item

Files	Size	Format	View
There are no files associated with this item.