On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems

DOI10.4064/am30-3-5zbMath1125.90401MaRDI QIDQ4829385

Diptesh Ghosh, Gerard Sierksma

Publication date: 29 November 2004

Published in: Applicationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/am30-3-5

zbMATH Keywords

complexity; sensitivity analysis; min-max; 0-1 combinatorial optimization problems

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90C31: Sensitivity, stability, parametric optimization

90C27: Combinatorial optimization