TY  - JOUR
AU  - Diptesh Ghosh
AU  - Gerard Sierksma
TI  - On the complexity of determining tolerances
 for $\varepsilon $-optimal solutions to
 min-max combinatorial optimization problems
JO  - Applicationes Mathematicae
PY  - 2003
SP  - 305
EP  - 313
VL  - 30
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.4064/am30-3-5/
DO  - 10.4064/am30-3-5
LA  - en
ID  - 10_4064_am30_3_5
ER  -