A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A Theory and Algorithms for Combinatorial Reoptimization

2017
*
Algorithmica
*

Many real-life applications involve systems that change dynamically over time. Thus, throughout the continuous operation of such a system, it is required to compute solutions for new problem instances, derived from previous instances. Since the transition from one solution to another incurs some cost, a natural goal is to have the solution for the new instance close to the original one (under a certain distance measure). In this paper we develop a general model for combinatorial reoptimization,

doi:10.1007/s00453-017-0274-8
fatcat:arlnvrogqfeitk7qcnnvreqsyu