Christophe Wilbaut

717 total citations
25 papers, 457 citations indexed

About

Christophe Wilbaut is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Christophe Wilbaut has authored 25 papers receiving a total of 457 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Industrial and Manufacturing Engineering, 9 papers in Computer Networks and Communications and 5 papers in Artificial Intelligence. Recurrent topics in Christophe Wilbaut's work include Optimization and Packing Problems (18 papers), Advanced Manufacturing and Logistics Optimization (12 papers) and Vehicle Routing Optimization Methods (11 papers). Christophe Wilbaut is often cited by papers focused on Optimization and Packing Problems (18 papers), Advanced Manufacturing and Logistics Optimization (12 papers) and Vehicle Routing Optimization Methods (11 papers). Christophe Wilbaut collaborates with scholars based in France, United Kingdom and Serbia. Christophe Wilbaut's co-authors include Saïd Hanafi, Saïd Hanafi, Saı̈d Salhi, Mahdi Khemakhem, S. Hanafi, Thierry Delot, Gilbert Laporte, Michel Vasquez, Sylvain Boussier and Hideki Hashimoto and has published in prestigious journals such as European Journal of Operational Research, Expert Systems with Applications and Applied Soft Computing.

In The Last Decade

Christophe Wilbaut

24 papers receiving 447 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Christophe Wilbaut France 14 338 135 107 56 45 25 457
Tatjana Davidović Serbia 12 240 0.7× 132 1.0× 73 0.7× 49 0.9× 32 0.7× 42 473
Marcus Ritt Brazil 14 493 1.5× 81 0.6× 96 0.9× 70 1.3× 45 1.0× 60 712
Koji Nonobe Japan 8 363 1.1× 122 0.9× 84 0.8× 28 0.5× 47 1.0× 13 479
J. A. Moreno Spain 6 247 0.7× 50 0.4× 91 0.9× 50 0.9× 54 1.2× 13 392
Francisco Ángel-Bello Mexico 16 521 1.5× 73 0.5× 86 0.8× 83 1.5× 105 2.3× 28 630
Christos Voudouris United Kingdom 8 277 0.8× 82 0.6× 134 1.3× 36 0.6× 54 1.2× 14 434
Daniel Karapetyan United Kingdom 10 265 0.8× 79 0.6× 156 1.5× 54 1.0× 33 0.7× 26 447
Jinghua Hao China 12 339 1.0× 49 0.4× 85 0.8× 49 0.9× 32 0.7× 26 488
Eduardo G. Pardo Spain 13 414 1.2× 96 0.7× 99 0.9× 87 1.6× 16 0.4× 39 591
Moshe B. Rosenwein United States 13 490 1.4× 96 0.7× 72 0.7× 85 1.5× 62 1.4× 26 630

Countries citing papers authored by Christophe Wilbaut

Since Specialization
Citations

This map shows the geographic impact of Christophe Wilbaut's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Christophe Wilbaut with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Christophe Wilbaut more than expected).

Fields of papers citing papers by Christophe Wilbaut

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Christophe Wilbaut. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Christophe Wilbaut. The network helps show where Christophe Wilbaut may publish in the future.

Co-authorship network of co-authors of Christophe Wilbaut

This figure shows the co-authorship network connecting the top 25 collaborators of Christophe Wilbaut. A scholar is included among the top collaborators of Christophe Wilbaut based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Christophe Wilbaut. Christophe Wilbaut is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Wu, Song, et al.. (2024). Iterated local search with ejection chains for the space-free multi-row facility layout problem. European Journal of Operational Research. 316(3). 873–886.
2.
Wilbaut, Christophe, Raca Todosijević, Saïd Hanafi, & Arnaud Fréville. (2022). Heuristic and exact reduction procedures to solve the discounted 0–1 knapsack problem. European Journal of Operational Research. 304(3). 901–911. 8 indexed citations
3.
Wilbaut, Christophe, Raca Todosijević, Saïd Hanafi, & Arnaud Fréville. (2022). Variable Neighborhood Search for the Discounted {0-1} Knapsack Problem. SSRN Electronic Journal. 1 indexed citations
4.
Delot, Thierry, et al.. (2020). A scalable dynamic parking allocation framework. Computers & Operations Research. 125. 105080–105080. 29 indexed citations
5.
Hanafi, Saïd, et al.. (2019). A special case of Variable-Sized Bin Packing Problem with Color Constraints. SPIRE - Sciences Po Institutional REpository. 29. 1150–1154. 4 indexed citations
6.
Delot, Thierry, et al.. (2018). The parking allocation problem for connected vehicles. Journal of Heuristics. 26(3). 377–399. 17 indexed citations
7.
Khemakhem, Mahdi, et al.. (2016). A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem. Engineering Applications of Artificial Intelligence. 55. 1–13. 61 indexed citations
8.
Khemakhem, Mahdi, et al.. (2015). A hybrid heuristic for the 0–1 Knapsack Sharing Problem. Expert Systems with Applications. 42(10). 4653–4666. 20 indexed citations
9.
Jarboui, Bassem, et al.. (2014). A general variable neighbourhood search for the multi-product inventory routing problem. IMA Journal of Management Mathematics. 27(1). 39–54. 6 indexed citations
10.
Hanafi, Saïd, et al.. (2014). New variable neighbourhood search based 0-1 MIP heuristics. Yugoslav journal of operations research. 25(3). 343–360. 19 indexed citations
11.
Hanafi, Saïd, et al.. (2012). Three-stage hybrid-flowshop model for cross-docking. Computers & Operations Research. 40(4). 1109–1121. 32 indexed citations
12.
Hanafi, Saïd, et al.. (2012). Hybrid approaches for the two‐scenario max–min knapsack problem. International Transactions in Operational Research. 19(3). 353–378. 7 indexed citations
13.
Hanafi, Saïd, et al.. (2011). Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem. Computers & Operations Research. 39(1). 32–41. 27 indexed citations
14.
Hanafi, Saïd, et al.. (2009). Oscillation Strategy for Disruption Management in the Airline Industry. European J of Industrial Engineering. 2 indexed citations
15.
Hanafi, Saïd & Christophe Wilbaut. (2009). Improved convergent heuristics for the 0-1 multidimensional knapsack problem. Annals of Operations Research. 183(1). 125–142. 38 indexed citations
16.
Hashimoto, Hideki, Sylvain Boussier, Michel Vasquez, & Christophe Wilbaut. (2009). A GRASP-based approach for technicians and interventions scheduling for telecommunications. Annals of Operations Research. 183(1). 143–161. 32 indexed citations
17.
Boussier, Sylvain, Hideki Hashimoto, Michel Vasquez, & Christophe Wilbaut. (2009). Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications. RAIRO - Operations Research. 43(4). 387–407. 1 indexed citations
18.
Hanafi, Saïd & Christophe Wilbaut. (2008). Scatter Search for the 0–1 Multidimensional Knapsack Problem. Journal of Mathematical Modelling and Algorithms. 7(2). 143–159. 19 indexed citations
19.
Wilbaut, Christophe & Saïd Hanafi. (2008). New convergent heuristics for 0–1 mixed integer programming. European Journal of Operational Research. 195(1). 62–74. 38 indexed citations
20.
Wilbaut, Christophe, S. Hanafi, & Saı̈d Salhi. (2007). A survey of effective heuristics and their application to a variety of knapsack problems. IMA Journal of Management Mathematics. 19(3). 227–244. 54 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Tatjana Davidović Breakdown of academic impact, for papers by Marcus Ritt Breakdown of academic impact, for papers by Koji Nonobe Breakdown of academic impact, for papers by J. A. Moreno Breakdown of academic impact, for papers by Francisco Ángel-Bello Breakdown of academic impact, for papers by Christos Voudouris Breakdown of academic impact, for papers by Daniel Karapetyan Breakdown of academic impact, for papers by Jinghua Hao Breakdown of academic impact, for papers by Eduardo G. Pardo Breakdown of academic impact, for papers by Moshe B. Rosenwein
Rankless by CCL
2026