Follow
Christophe Wilbaut
Christophe Wilbaut
Associate Professor, LAMIH CNRS UMR 8201, Université Polytechnique Hauts-de-France
Verified email at uphf.fr
Title
Cited by
Cited by
Year
A survey of effective heuristics and their application to a variety of knapsack problems
C Wilbaut, S Hanafi, S Salhi
IMA Journal of Management Mathematics 19 (3), 227-244, 2008
1182008
A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem
B Haddar, M Khemakhem, S Hanafi, C Wilbaut
Engineering Applications of Artificial Intelligence 55, 1-13, 2016
1102016
New convergent heuristics for 0–1 mixed integer programming
C Wilbaut, S Hanafi
European Journal of Operational Research 195 (1), 62-74, 2009
842009
Improved convergent heuristics for the 0-1 multidimensional knapsack problem
S Hanafi, C Wilbaut
Annals of Operations Research 183 (1), 125-142, 2011
722011
Three-stage hybrid-flowshop model for cross-docking
A Bellanger, S Hanafi, C Wilbaut
Computers & Operations Research 40 (4), 1109-1121, 2013
602013
A GRASP-based approach for technicians and interventions scheduling for telecommunications
H Hashimoto, S Boussier, M Vasquez, C Wilbaut
Annals of Operations Research 183 (1), 143-161, 2011
532011
An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
C Wilbaut, S Salhi, S Hanafi
European Journal of Operational Research 199 (2), 339-348, 2009
432009
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
I Crévits, S Hanafi, R Mansi, C Wilbaut
Computers & Operations Research 39 (1), 32-41, 2012
392012
Scatter search for the 0–1 multidimensional knapsack problem
S Hanafi, C Wilbaut
Journal of Mathematical Modelling and Algorithms 7 (2), 143-159, 2008
372008
New variable neighbourhood search based 0-1 mip heuristics
S Hanafi, J Lazić, N Mladenović, C Wilbaut, I Crévits
Yugoslav Journal of Operations Research 25 (3), 343-360, 2015
322015
A hybrid heuristic for the 0–1 Knapsack Sharing Problem
B Haddar, M Khemakhem, S Hanafi, C Wilbaut
Expert Systems with Applications 42 (10), 4653-4666, 2015
292015
Tabu search: global intensification using dynamic programming
C Wilbaut, S Hanafi, A Fréville, S Balev
Control and Cybernetics 35 (3), 579-598, 2006
292006
A scalable dynamic parking allocation framework
M Mladenović, T Delot, G Laporte, C Wilbaut
Computers & Operations Research 125, 105080, 2021
272021
The parking allocation problem for connected vehicles
M Mladenović, T Delot, G Laporte, C Wilbaut
Journal of Heuristics 26 (3), 377-399, 2020
252020
New hybrid matheuristics for solving the multidimensional knapsack problem
S Hanafi, J Lazić, N Mladenović, C Wilbaut, I Crévits
Hybrid Metaheuristics: 7th International Workshop, HM 2010, Vienna, Austria …, 2010
232010
A general variable neighbourhood search for the multi-product inventory routing problem
A Mjirda, B Jarboui, J Mladenović, C Wilbaut, S Hanafi
IMA Journal of Management Mathematics 27 (1), 39-54, 2016
202016
Disruptions in the airline industry: math-heuristics for re-assigning aircraft and passengers simultaneously
R Mansi, S Hanafi, C Wilbaut, F Clautiaux
European Journal of Industrial Engineering 10 6 (6), 690-712, 2012
202012
Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem
S Hanafi, J Lazić, N Mladenović, C Wilbaut, I Crévits
Electronic Notes in Discrete Mathematics 36, 883-890, 2010
152010
Hybrid approaches for the two‐scenario max–min knapsack problem
S Hanafi, R Mansi, C Wilbaut, A Fréville
International Transactions in Operational Research 19 (3), 353-378, 2012
142012
Iterative relaxation-based heuristics for the multiple-choice multidimensional knapsack problem
S Hanafi, R Mansi, C Wilbaut
International Workshop on Hybrid Metaheuristics, 73-83, 2009
132009
The system can't perform the operation now. Try again later.
Articles 1–20