Abstract
A reoptimization problem, given two similar instances of an optimization problem and a good solution to the first instance, asks for a solution to the second. In this paper we propose general approximation algorithms applicable to a wide class of reoptimization problems.
Cite
CITATION STYLE
APA
Zych-Pawlewicz, A. (2018). Reoptimization of NP-hard problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11011 LNCS, pp. 477–494). Springer Verlag. https://doi.org/10.1007/978-3-319-98355-4_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free