Christophe Wilbaut

23 papers B 1C 1Journal 18Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
A hybrid memetic metaheuristic for medical staff assignment in major public health emergencies.
Comput. Oper. Res.
Yang Wang, He Zheng, Zequn Wei, Christophe Wilbaut, Saïd Hanafi
2024 J jnl
Iterated local search with ejection chains for the space-free multi-row facility layout problem.
Eur. J. Oper. Res.
Song Wu, Wei Yang, Saïd Hanafi, Christophe Wilbaut, Yang Wang
2023 J jnl
Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem.
Eur. J. Oper. Res.
Christophe Wilbaut, Raca Todosijevic, Saïd Hanafi, Arnaud Fréville
2022 J jnl
Variable neighborhood search for the discounted {0-1} knapsack problem.
Appl. Soft Comput.
Christophe Wilbaut, Raca Todosijevic, Saïd Hanafi, Arnaud Fréville
2021 J jnl
A scalable dynamic parking allocation framework.
Comput. Oper. Res.
Marko Mladenovic, Thierry Delot, Gilbert Laporte, Christophe Wilbaut
2020 J jnl
The parking allocation problem for connected vehicles.
J. Heuristics
Marko Mladenovic, Thierry Delot, Gilbert Laporte, Christophe Wilbaut
2019 C conf
A special case of Variable-Sized Bin Packing Problem with Color Constraints.
CoDIT
Igor Crévits, Saïd Hanafi, Ali Ridha Mahjoub, Raouia Taktak, Christophe Wilbaut
2016 J jnl
A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem.
Eng. Appl. Artif. Intell.
Boukthir Haddar, Mahdi Khemakhem, Saïd Hanafi, Christophe Wilbaut
2015 J jnl
A hybrid heuristic for the 0-1 Knapsack Sharing Problem.
Expert Syst. Appl.
Boukthir Haddar, Mahdi Khemakhem, Saïd Hanafi, Christophe Wilbaut
2013 J jnl
Three-stage hybrid-flowshop model for cross-docking.
Comput. Oper. Res.
Adrien Bellanger, Saïd Hanafi, Christophe Wilbaut
2012 J jnl
Hybrid approaches for the two-scenario max-min knapsack problem.
Int. Trans. Oper. Res.
Saïd Hanafi, Raïd Mansi, Christophe Wilbaut, Arnaud Fréville
2012 J jnl
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem.
Comput. Oper. Res.
Igor Crévits, Saïd Hanafi, Raïd Mansi, Christophe Wilbaut
2011 J jnl
A GRASP-based approach for technicians and interventions scheduling for telecommunications.
Ann. Oper. Res.
Hideki Hashimoto, Sylvain Boussier, Michel Vasquez, Christophe Wilbaut
2011 J jnl
Improved convergent heuristics for the 0-1 multidimensional knapsack problem.
Ann. Oper. Res.
Saïd Hanafi, Christophe Wilbaut
2010 J jnl
Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem.
Electron. Notes Discret. Math.
Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, Igor Crévits
2010 B conf
New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint.
SEA
Minh Hoang Ha, François Clautiaux, Saïd Hanafi, Christophe Wilbaut
2010 — conf
New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem.
Hybrid Metaheuristics
Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, Igor Crévits
2009 J jnl
An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem.
Eur. J. Oper. Res.
Christophe Wilbaut, Saïd Salhi, Saïd Hanafi
2009 — conf
Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem.
Hybrid Metaheuristics
Saïd Hanafi, Raïd Mansi, Christophe Wilbaut
2009 J jnl
New convergent heuristics for 0-1 mixed integer programming.
Eur. J. Oper. Res.
Christophe Wilbaut, Saïd Hanafi
2009 J jnl
Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications.
RAIRO Oper. Res.
Sylvain Boussier, Hideki Hashimoto, Michel Vasquez, Christophe Wilbaut
2008 J jnl
Scatter Search for the 0-1 Multidimensional Knapsack Problem.
J. Math. Model. Algorithms
Saïd Hanafi, Christophe Wilbaut
2006 — —
Heuristiques hybrides pour la résolution de problèmes en variables 0-1 mixtes. (Hybrid heuristics for 0-1 mixed integer programming).
Christophe Wilbaut