A survey on combinatorial optimization in dynamic environments
Boria, Nicolas; Paschos, Vangelis (2011), A survey on combinatorial optimization in dynamic environments, RAIRO, 45, 3, p. 241-294. http://dx.doi.org/10.1051/ro/2011114
TypeArticle accepté pour publication ou publié
Cambridge University Press
MetadataShow full item record
Abstract (EN)This survey presents major results and issues related to the study of NPO problems in dynamic environments, that is, in settings where instances are allowed to undergo some modifications over time. In particular, the survey focuses on two complementary frameworks. The first one is the reoptimization framework, where an instance I that is already solved undergoes some local perturbation. The goal is then to make use of the information provided by the initial solution to compute a new solution. The second framework is probabilistic optimization, where the instance to optimize is not fully known at the time when a solution is to be proposed, but results from a determined Bernoulli process. Then, the goal is to compute a solution with optimal expected value.
Subjects / KeywordsApproximation; reoptimization; hereditary problem; complexity; graph; on-line algorithms; probabilistic optimization
Showing items related by title and author.
Boria, Nicolas; Paschos, Vangelis (2011) Document de travail / Working paper
Review of Jon Lee's book "A First Course in Combinatorial Optimization", CambridgeTexts in Applied Mathematics Paschos, Vangelis (2006) Article accepté pour publication ou publié
Bellalouna, Monia; Murat, Cécile; Paschos, Vangelis (1995) Article accepté pour publication ou publié
Combinatorial optimization Volume 2, Paradigms of Combinatorial Optimization: problems and new approaches Paschos, Vangelis (2010) Ouvrage