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

DOI10.4064/am30-3-5zbMath1125.90401OpenAlexW2099599157MaRDI 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

complexitysensitivity analysismin-max0-1 combinatorial optimization problems

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)

This page was built for publication: On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems