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:
Michel Vasquez, Jin-Kao Hao
RAIRO-Oper. Res., 35 4 (2001) 415-438
Published online: 2002-08-15
This article has been cited by the following article(s):
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
Fred Glover
European Journal of Operational Research 230 (2) 212 (2013)
DOI: 10.1016/j.ejor.2013.04.010
See this article
Single-plant sourcing decisions with a multidimensional knapsack model
Natalie S. Cherbaka and Russell D. Meller
Journal of Manufacturing Systems 27 (1) 7 (2008)
DOI: 10.1016/j.jmsy.2008.07.001
See this article
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
Igor Crévits, Saïd Hanafi, Raïd Mansi and Christophe Wilbaut
Computers & Operations Research 39 (1) 32 (2012)
DOI: 10.1016/j.cor.2010.12.016
See this article
Scatter Search for the 0–1 Multidimensional Knapsack Problem
Said Hanafi and Christophe Wilbaut
Journal of Mathematical Modelling and Algorithms 7 (2) 143 (2008)
DOI: 10.1007/s10852-008-9078-9
See this article
A hybrid heuristic for the 0–1 Knapsack Sharing Problem
Boukthir Haddar, Mahdi Khemakhem, Saïd Hanafi and Christophe Wilbaut
Expert Systems with Applications 42 (10) 4653 (2015)
DOI: 10.1016/j.eswa.2015.01.049
See this article
An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
Christophe Wilbaut, Saïd Salhi and Saïd Hanafi
European Journal of Operational Research 199 (2) 339 (2009)
DOI: 10.1016/j.ejor.2008.11.036
See this article
New convergent heuristics for 0–1 mixed integer programming
Christophe Wilbaut and Said Hanafi
European Journal of Operational Research 195 (1) 62 (2009)
DOI: 10.1016/j.ejor.2008.01.044
See this article
Variable Neighbourhood Decomposition Search with Bounding for Multidimensional Knapsack Problem
Saïd Hanafi, Jasmina Lazić, Nenad Mladenović and Christophe Wilbaut
IFAC Proceedings Volumes 42 (4) 2018 (2009)
DOI: 10.3182/20090603-3-RU-2001.0502
See this article
The multidimensional 0–1 knapsack problem: An overview
Arnaud Fréville
European Journal of Operational Research 155 (1) 1 (2004)
DOI: 10.1016/S0377-2217(03)00274-1
See this article
Improved results on the 0–1 multidimensional knapsack problem
Michel Vasquez and Yannick Vimont
European Journal of Operational Research 165 (1) 70 (2005)
DOI: 10.1016/j.ejor.2004.01.024
See this article
Improved convergent heuristics for the 0-1 multidimensional knapsack problem
Saïd Hanafi and Christophe Wilbaut
Annals of Operations Research 183 (1) 125 (2011)
DOI: 10.1007/s10479-009-0546-z
See this article
The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects
Arnaud Fréville and SaÏd Hanafi
Annals of Operations Research 139 (1) 195 (2005)
DOI: 10.1007/s10479-005-3448-8
See this article
Hybrid Metaheuristics
Saïd Hanafi, Jasmina Lazić, Nenad Mladenović, Christophe Wilbaut and Igor Crévits
Lecture Notes in Computer Science, Hybrid Metaheuristics 6373 118 (2010)
DOI: 10.1007/978-3-642-16054-7_9
See this article
A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem
Boukthir Haddar, Mahdi Khemakhem, Saïd Hanafi and Christophe Wilbaut
Engineering Applications of Artificial Intelligence 55 1 (2016)
DOI: 10.1016/j.engappai.2016.05.006
See this article
A Filter-and-Fan Metaheuristic for the 0-1 Multidimensional Knapsack Problem
Mahdi Khemakhem, Boukthir Haddar, Khalil Chebil and Saïd Hanafi
International Journal of Applied Metaheuristic Computing 3 (4) 43 (2012)
DOI: 10.4018/jamc.2012100103
See this article