The complexity of approximation reoptimization algorithms for discrete optimization

DOI10.1007/978-3-319-68640-0_16zbMath1398.90209OpenAlexW2772999787MaRDI QIDQ1797554

Victor A. Mikhailyuk

Publication date: 22 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-68640-0_16

zbMATH Keywords

approximationdiscrete optimizationpostoptimality analysis

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Approximation methods and heuristics in mathematical programming (90C59)

This page was built for publication: The complexity of approximation reoptimization algorithms for discrete optimization