Volume 45, Number 3, July-September 2011
|Page(s)||241 - 294|
|Published online||16 December 2011|
A survey on combinatorial optimization in dynamic environments∗
1 LAMSADE, CNRS UMR 7243 and Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775 Paris Cedex 16, France
2 Institut Universitaire de France
Received: 31 October 2011
Accepted: 14 November 2011
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.
Mathematics Subject Classification: 05C22 / 05C69 / 05C85 / 68Q10 / 68Q17 / 68Q25 / 68Q87 / 68W25 / 68W27
Key words: Approximation / reoptimization / hereditary problem / complexity / graph / on-line algorithms / probabilistic optimization
© EDP Sciences, ROADEF, SMAI 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.