On the Computational Complexity of Reoptimization 2 Scientific Work 2 . 1 Summary

  • Published 2008

Abstract

In algorithmics and operations research, we deal with many optimization problems whose solutions are of importance in everyday applications. Unfortunately, most of these problems are computationally hard, and so we use different approaches like heuristics, approximation algorithms, and randomization in order to compute good (not necessarily optimal… (More)

Topics

  • Presentations referencing similar topics