Complexity and Approximation in Reoptimization - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Complexity and Approximation in Reoptimization

(1) , (2, 3) , (4)
1
2
3
4

Abstract

In this survey the following model is considered. We assume that an instance I of a computationally hard optimization problem has been solved and that we know the optimum solution of such instance. Then a new instance I′ is proposed, obtained by means of a slight pertur- bation of instance I. How can we exploit the knowledge we have on the solution of instance I to compute a (approximate) solution of instance I′ in an efficient way? This computation model is called reoptimization and is of practical interest in various circumstances. In this article we first discuss what kind of performance we can expect for specific classes of problems and then we present some classical optimization problems (i.e. Max Knapsack, Min Steiner Tree, Scheduling) in which this approach has been fruitfully applied. Subsequently, we address vehicle routing prob- lems and we show how the reoptimization approach can be used to obtain good approximate solution in an efficient way for some of these problems.
Fichier principal
Vignette du fichier
cahier_281.pdf (225.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00906941 , version 1 (20-11-2013)

Identifiers

  • HAL Id : hal-00906941 , version 1

Cite

Giorgio Ausiello, Vincenzo Bonifaci, Bruno Escoffier. Complexity and Approximation in Reoptimization. 2008. ⟨hal-00906941⟩
102 View
287 Download

Share

Gmail Facebook Twitter LinkedIn More