Christophe Wilbaut

Orcid: 0000-0003-1250-7792

According to our database¹, Christophe Wilbaut authored at least 22 papers between 2006 and 2024.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Iterated local search with ejection chains for the space-free multi-row facility layout problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2024

2023

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

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2023

2022

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

[BibT_eX]

[DOI]

Appl. Soft Comput., 2022

2021

A scalable dynamic parking allocation framework.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2021

2020

The parking allocation problem for connected vehicles.

[BibT_eX]

[DOI]

J. Heuristics, 2020

2019

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

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Control, 2019

2016

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

[BibT_eX]

[DOI]

Eng. Appl. Artif. Intell., 2016

2015

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

[BibT_eX]

[DOI]

Expert Syst. Appl., 2015

2013

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

[BibT_eX]

[DOI]

Adrien Bellanger

Saïd Hanafi

Christophe Wilbaut

Comput. Oper. Res., 2013

2012

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

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2012

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

[BibT_eX]

[DOI]

Comput. Oper. Res., 2012

2011

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

[BibT_eX]

[DOI]

Ann. Oper. Res., 2011

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

[BibT_eX]

[DOI]

Saïd Hanafi

Christophe Wilbaut

Ann. Oper. Res., 2011

2010

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

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

[BibT_eX]

[DOI]

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

New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2009

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

[BibT_eX]

[DOI]

Christophe Wilbaut

Saïd Salhi

Saïd Hanafi

Eur. J. Oper. Res., 2009

New convergent heuristics for 0-1 mixed integer programming.

[BibT_eX]

[DOI]

Christophe Wilbaut

Saïd Hanafi

Eur. J. Oper. Res., 2009

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

Christophe Wilbaut

PhD thesis, 2006

Christophe Wilbaut

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...