Show simple item record

dc.contributor.authorBoria, Nicolas
HAL ID: 21013
ORCID: 0000-0002-0548-4257
dc.contributor.authorPaschos, Vangelis
dc.date.accessioned2012-03-22T10:19:54Z
dc.date.available2012-03-22T10:19:54Z
dc.date.issued2011
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/8555
dc.language.isoenen
dc.subjectApproximationen
dc.subjectreoptimizationen
dc.subjecthereditary problemen
dc.subjectcomplexityen
dc.subjectgraphen
dc.subjecton-line algorithmsen
dc.subjectprobabilistic optimizationen
dc.subject.ddc003en
dc.titleA survey on combinatorial optimization in dynamic environmentsen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenThis 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.en
dc.relation.isversionofjnlnameRAIRO
dc.relation.isversionofjnlvol45en
dc.relation.isversionofjnlissue3en
dc.relation.isversionofjnldate2011
dc.relation.isversionofjnlpages241-294en
dc.relation.isversionofdoihttp://dx.doi.org/10.1051/ro/2011114en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherCambridge University Pressen
dc.subject.ddclabelRecherche opérationnelleen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record