The complexity of approximation reoptimization algorithms for discrete optimization

DOI10.1007/978-3-319-68640-0_16MaRDI QIDQ1797554zbMATH OpenOpenAlexFDO

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

Recommendations

• Reoptimization of constraint satisfaction problems with approximation resistant predicates
• On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems
• Reoptimization of NP-Hard Problems
• Complexity and approximation in reoptimization
• Approximation to the reoptimization optimal sublinear algorithms of bounded-degree problems of a general feasibility

Cited in

(6)

• Improving the complexities of approximation algorithms for optimization problems
• General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
• Approximation to the reoptimization optimal sublinear algorithms of bounded-degree problems of a general feasibility
• On the Hardness of Reoptimization with Multiple Given Solutions
• scientific article; zbMATH DE number 5799870 (Why is no real title available?)
• On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems

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

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