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

DOI10.4064/AM30-3-5zbMATH Open1125.90401OpenAlexW2099599157MaRDI QIDQ4829385FDOQ4829385

Authors: 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

Recommendations

• Some Basics on Tolerances
• scientific article; zbMATH DE number 969937
• The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
• A note on robustness tolerances for combinatorial optimization problems
• On the complexity of postoptimality analysis of \(0/1\) programs

zbMATH Keywords

sensitivity analysiscomplexitymin-max0-1 combinatorial optimization problems

Mathematics Subject Classification ID

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

Cited In (3)

• A note on robustness tolerances for combinatorial optimization problems
• Some Basics on Tolerances
• The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4829385)