A Partheno-Genetic Algorithm for Dynamic 0-1 Multidimensional Knapsack Problem
RAIRO-Oper. Res., 50 1 (2016) 47-66
Published online: 2015-10-07
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):
An efficient population-based simulated annealing algorithm for 0–1 knapsack problem
Nima Moradi, Vahid Kayvanfar and Majid RafieeEngineering with Computers 38 (3) 2771 (2022)
https://doi.org/10.1007/s00366-020-01240-3
Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems
Valentina Cacchiani, Manuel Iori, Alberto Locatelli and Silvano MartelloComputers & Operations Research 143 105693 (2022)
https://doi.org/10.1016/j.cor.2021.105693
Flexible Wolf Pack Algorithm for Dynamic Multidimensional Knapsack Problems
Husheng Wu and Renbin XiaoResearch 2020 (2020)
https://doi.org/10.34133/2020/1762107
Dynamic performance of a multi-ribbed belt based on an overlay constitutive model of carbon-black-filled rubber and experimental validation
Yumei Hu, Hao Zhu, W.D. Zhu, Changlong Li and Yangjun PiMechanical Systems and Signal Processing 95 252 (2017)
https://doi.org/10.1016/j.ymssp.2017.03.013
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
Simulation Experiment Exploration of Genetic Algorithm’s Convergence over the Relationship Advantage Problem
Yabo LuoMathematical Problems in Engineering 2016 1 (2016)
https://doi.org/10.1155/2016/4527402