A survey on combinatorial optimization in dynamic environments
RAIRO-Oper. Res., 45 3 (2011) 241-294
Published online: 2011-12-16
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
New Algorithms for Steiner Tree Reoptimization
Davide BilòAlgorithmica 86 (8) 2652 (2024)
https://doi.org/10.1007/s00453-024-01243-2
Connecting with Computability
Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen and Maria KoscheLecture Notes in Computer Science, Connecting with Computability 12813 38 (2021)
https://doi.org/10.1007/978-3-030-80049-9_4
Robust Reoptimization of Steiner Trees
Keshav Goyal and Tobias MömkeAlgorithmica 82 (7) 1966 (2020)
https://doi.org/10.1007/s00453-020-00682-x
Reoptimization of minimum latency problem revisited: don’t panic when asked to revisit the route after local modifications
Wenkai Dai and Yongjie YangJournal of Combinatorial Optimization 37 (2) 601 (2019)
https://doi.org/10.1007/s10878-018-0317-3
Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices
Pascal Schroeder, Imed Kacem and Günter SchmidtRAIRO - Operations Research 53 (2) 559 (2019)
https://doi.org/10.1051/ro/2018064
Big data algorithms beyond machine learning
Matthias MnichKI - Künstliche Intelligenz 32 (1) 9 (2018)
https://doi.org/10.1007/s13218-017-0517-5
Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization
Adil Baykasoğlu and Fehmi B. OzsoydanInformation Sciences 420 159 (2017)
https://doi.org/10.1016/j.ins.2017.08.058
10392 162 (2017)
https://doi.org/10.1007/978-3-319-62389-4_14
Hardness of Reoptimization of the Problem of Calculating the Chromatic Number of a Graph with a Given Set of Optimal Solutions
V. A. MikhailyukCybernetics and Systems Analysis 52 (3) 371 (2016)
https://doi.org/10.1007/s10559-016-9837-y
A note on the traveling salesman reoptimization problem under vertex insertion
Jerome MonnotInformation Processing Letters 115 (3) 435 (2015)
https://doi.org/10.1016/j.ipl.2014.11.003
Reoptimization in machine scheduling
Nicolas Boria and Federico Della CroceTheoretical Computer Science 540-541 13 (2014)
https://doi.org/10.1016/j.tcs.2014.04.004
406 (2013)
https://doi.org/10.1109/ICAdLT.2013.6568493