Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Fréville, Arnaud
2004.
The multidimensional 0–1 knapsack problem: An overview.
European Journal of Operational Research,
Vol. 155,
Issue. 1,
p.
1.
Fréville, Arnaud
and
Hanafi, SaÏd
2005.
The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects.
Annals of Operations Research,
Vol. 139,
Issue. 1,
p.
195.
Vasquez, Michel
and
Vimont, Yannick
2005.
Improved results on the 0–1 multidimensional knapsack problem.
European Journal of Operational Research,
Vol. 165,
Issue. 1,
p.
70.
Cherbaka, Natalie S.
and
Meller, Russell D.
2008.
Single-plant sourcing decisions with a multidimensional knapsack model.
Journal of Manufacturing Systems,
Vol. 27,
Issue. 1,
p.
7.
Hanafi, Said
and
Wilbaut, Christophe
2008.
Scatter Search for the 0–1 Multidimensional Knapsack Problem.
Journal of Mathematical Modelling and Algorithms,
Vol. 7,
Issue. 2,
p.
143.
Wilbaut, Christophe
Salhi, Saïd
and
Hanafi, Saïd
2009.
An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem.
European Journal of Operational Research,
Vol. 199,
Issue. 2,
p.
339.
Wilbaut, Christophe
and
Hanafi, Said
2009.
New convergent heuristics for 0–1 mixed integer programming.
European Journal of Operational Research,
Vol. 195,
Issue. 1,
p.
62.
Hanafi, Saïd
Lazić, Jasmina
Mladenović, Nenad
and
Wilbaut, Christophe
2009.
Variable Neighbourhood Decomposition Search with Bounding for Multidimensional Knapsack Problem.
IFAC Proceedings Volumes,
Vol. 42,
Issue. 4,
p.
2018.
Hanafi, Saïd
Lazić, Jasmina
Mladenović, Nenad
Wilbaut, Christophe
and
Crévits, Igor
2010.
Hybrid Metaheuristics.
Vol. 6373,
Issue. ,
p.
118.
Hanafi, Saïd
and
Wilbaut, Christophe
2011.
Improved convergent heuristics for the 0-1 multidimensional knapsack problem.
Annals of Operations Research,
Vol. 183,
Issue. 1,
p.
125.
Crévits, Igor
Hanafi, Saïd
Mansi, Raïd
and
Wilbaut, Christophe
2012.
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem.
Computers & Operations Research,
Vol. 39,
Issue. 1,
p.
32.
Khemakhem, Mahdi
Haddar, Boukthir
Chebil, Khalil
and
Hanafi, Saïd
2012.
A Filter-and-Fan Metaheuristic for the 0-1 Multidimensional Knapsack Problem.
International Journal of Applied Metaheuristic Computing,
Vol. 3,
Issue. 4,
p.
43.
Glover, Fred
2013.
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems.
European Journal of Operational Research,
Vol. 230,
Issue. 2,
p.
212.
Haddar, Boukthir
Khemakhem, Mahdi
Hanafi, Saïd
and
Wilbaut, Christophe
2015.
A hybrid heuristic for the 0–1 Knapsack Sharing Problem.
Expert Systems with Applications,
Vol. 42,
Issue. 10,
p.
4653.
Haddar, Boukthir
Khemakhem, Mahdi
Hanafi, Saïd
and
Wilbaut, Christophe
2016.
A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem.
Engineering Applications of Artificial Intelligence,
Vol. 55,
Issue. ,
p.
1.