Christophe Wilbaut

According to our database, Christophe Wilbaut authored at least 21 papers between 2006 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem.

Christophe Wilbaut, Raca Todosijevic, Saïd Hanafi, Arnaud Fréville

Eur. J. Oper. Res., 2023

2022

Variable neighborhood search for the discounted {0-1} knapsack problem.

Christophe Wilbaut, Raca Todosijevic, Saïd Hanafi, Arnaud Fréville

Appl. Soft Comput., 2022

2021

A scalable dynamic parking allocation framework.

Marko Mladenovic, Thierry Delot, Gilbert Laporte, Christophe Wilbaut

Comput. Oper. Res., 2021

2020

The parking allocation problem for connected vehicles.

Marko Mladenovic, Thierry Delot, Gilbert Laporte, Christophe Wilbaut

J. Heuristics, 2020

2019

A special case of Variable-Sized Bin Packing Problem with Color Constraints.

Igor Crévits, Saïd Hanafi, Ali Ridha Mahjoub, Raouia Taktak, Christophe Wilbaut

Proceedings of the 6th International Conference on Control, 2019

2016

A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem.

Boukthir Haddar, Mahdi Khemakhem, Saïd Hanafi, Christophe Wilbaut

Eng. Appl. Artif. Intell., 2016

2015

A hybrid heuristic for the 0-1 Knapsack Sharing Problem.

Boukthir Haddar, Mahdi Khemakhem, Saïd Hanafi, Christophe Wilbaut

Expert Syst. Appl., 2015

2013

Three-stage hybrid-flowshop model for cross-docking.

Adrien Bellanger, Saïd Hanafi, Christophe Wilbaut

Comput. Oper. Res., 2013

2012

Hybrid approaches for the two-scenario max-min knapsack problem.

Saïd Hanafi, Raïd Mansi, Christophe Wilbaut, Arnaud Fréville

Int. Trans. Oper. Res., 2012

Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem.

Igor Crévits, Saïd Hanafi, Raïd Mansi, Christophe Wilbaut

Comput. Oper. Res., 2012

2011

A GRASP-based approach for technicians and interventions scheduling for telecommunications.

Hideki Hashimoto, Sylvain Boussier, Michel Vasquez, Christophe Wilbaut

Ann. Oper. Res., 2011

Improved convergent heuristics for the 0-1 multidimensional knapsack problem.

Saïd Hanafi, Christophe Wilbaut

Ann. Oper. Res., 2011

2010

Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem.

Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, Igor Crévits

Electron. Notes Discret. Math., 2010

New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint.

Minh Hoang Ha, François Clautiaux, Saïd Hanafi, Christophe Wilbaut

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem.

Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, Igor Crévits

Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

2009

Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications.

Sylvain Boussier, Hideki Hashimoto, Michel Vasquez, Christophe Wilbaut

RAIRO Oper. Res., 2009

An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem.

Christophe Wilbaut, Saïd Salhi, Saïd Hanafi

Eur. J. Oper. Res., 2009

New convergent heuristics for 0-1 mixed integer programming.

Christophe Wilbaut, Saïd Hanafi

Eur. J. Oper. Res., 2009

Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem.

Saïd Hanafi, Raïd Mansi, Christophe Wilbaut

Proceedings of the Hybrid Metaheuristics, 6th International Workshop, 2009

2008

Scatter Search for the 0-1 Multidimensional Knapsack Problem.

Saïd Hanafi, Christophe Wilbaut

J. Math. Model. Algorithms, 2008

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

PhD thesis, 2006