Christophe Wilbaut

According to our database1, Christophe Wilbaut authored at least 19 papers between 2006 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A scalable dynamic parking allocation framework.
Comput. Oper. Res., 2021

2020
The parking allocation problem for connected vehicles.
J. Heuristics, 2020

2019
A special case of Variable-Sized Bin Packing Problem with Color Constraints.
Proceedings of the 6th International Conference on Control, 2019

2016
A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem.
Eng. Appl. Artif. Intell., 2016

2015
A hybrid heuristic for the 0-1 Knapsack Sharing Problem.
Expert Syst. Appl., 2015

2013
Three-stage hybrid-flowshop model for cross-docking.
Comput. Oper. Res., 2013

2012
Hybrid approaches for the two-scenario max-min knapsack problem.
Int. Trans. Oper. Res., 2012

Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem.
Comput. Oper. Res., 2012

2011
A GRASP-based approach for technicians and interventions scheduling for telecommunications.
Ann. Oper. Res., 2011

Improved convergent heuristics for the 0-1 multidimensional knapsack problem.
Ann. Oper. Res., 2011

2010
Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem.
Electron. Notes Discret. Math., 2010

New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem.
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.
RAIRO Oper. Res., 2009

An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem.
Eur. J. Oper. Res., 2009

New convergent heuristics for 0-1 mixed integer programming.
Eur. J. Oper. Res., 2009

Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem.
Proceedings of the Hybrid Metaheuristics, 6th International Workshop, 2009

2008
Scatter Search for the 0-1 Multidimensional Knapsack Problem.
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).
PhD thesis, 2006


  Loading...