Hadrien Cambazard

875 total citations
29 papers, 343 citations indexed

About

Hadrien Cambazard is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Management Science and Operations Research. According to data from OpenAlex, Hadrien Cambazard has authored 29 papers receiving a total of 343 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Computer Networks and Communications, 11 papers in Industrial and Manufacturing Engineering and 8 papers in Management Science and Operations Research. Recurrent topics in Hadrien Cambazard's work include Constraint Satisfaction and Optimization (15 papers), Scheduling and Timetabling Solutions (7 papers) and Vehicle Routing Optimization Methods (5 papers). Hadrien Cambazard is often cited by papers focused on Constraint Satisfaction and Optimization (15 papers), Scheduling and Timetabling Solutions (7 papers) and Vehicle Routing Optimization Methods (5 papers). Hadrien Cambazard collaborates with scholars based in France, Ireland and Canada. Hadrien Cambazard's co-authors include Narendra Jussien, Barry O’Sullivan, Emmanuel Hébrard, Pierre-Emmanuel Hladik, Anne‐Marie Déplanche, Maxime Ogier, Olivier Briant, Diego Cattaruzza, Anne-Laure Ladier and André Langevin and has published in prestigious journals such as European Journal of Operational Research, Monthly Notices of the Royal Astronomical Society and Computers & Operations Research.

In The Last Decade

Hadrien Cambazard

26 papers receiving 333 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Hadrien Cambazard France 9 234 107 102 73 47 29 343
Filippo Focacci Italy 8 209 0.9× 106 1.0× 73 0.7× 23 0.3× 45 1.0× 8 251
Petr Vilím Czechia 5 207 0.9× 101 0.9× 64 0.6× 9 0.1× 24 0.5× 8 259
Matthias Englert United Kingdom 10 89 0.4× 195 1.8× 38 0.4× 10 0.1× 57 1.2× 30 283
Catherine Roucairol France 10 231 1.0× 90 0.8× 8 0.1× 33 0.5× 35 0.7× 21 301
Nodari Vakhania Mexico 9 269 1.1× 213 2.0× 19 0.2× 10 0.1× 17 0.4× 47 342
Simone L. Martins Brazil 9 167 0.7× 46 0.4× 23 0.2× 12 0.2× 123 2.6× 14 255
Olivia Rossi-Doria United Kingdom 6 176 0.8× 58 0.5× 145 1.4× 23 0.3× 70 1.5× 9 254
Nicolas Beldiceanu France 6 139 0.6× 199 1.9× 80 0.8× 5 0.1× 65 1.4× 15 301
Lene M. Favrholdt Denmark 11 174 0.7× 300 2.8× 87 0.9× 5 0.1× 40 0.9× 37 351
Mikhail Batsyn Russia 10 79 0.3× 53 0.5× 19 0.2× 17 0.2× 47 1.0× 19 208

Countries citing papers authored by Hadrien Cambazard

Since Specialization
Citations

This map shows the geographic impact of Hadrien Cambazard'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 Hadrien Cambazard with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hadrien Cambazard more than expected).

Fields of papers citing papers by Hadrien Cambazard

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Hadrien Cambazard. 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 Hadrien Cambazard. The network helps show where Hadrien Cambazard may publish in the future.

Co-authorship network of co-authors of Hadrien Cambazard

This figure shows the co-authorship network connecting the top 25 collaborators of Hadrien Cambazard. A scholar is included among the top collaborators of Hadrien Cambazard 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 Hadrien Cambazard. Hadrien Cambazard 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.
Cambazard, Hadrien, et al.. (2025). A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses. Operations Research Letters. 62. 107325–107325. 1 indexed citations
2.
Cambazard, Hadrien, et al.. (2024). Logistic regression to boost exoplanet detection performances. Monthly Notices of the Royal Astronomical Society. 536(2). 1610–1624.
3.
Cambazard, Hadrien, et al.. (2021). Teaching OR: automatic evaluation for linear programming modelling. 4OR. 20(2). 333–345. 2 indexed citations
4.
Pommerening, Florian, Gabriele Röger, Malte Helmert, et al.. (2021). Lagrangian Decomposition for Optimal Cost Partitioning. Proceedings of the International Conference on Automated Planning and Scheduling. 29. 338–347. 2 indexed citations
5.
Briant, Olivier, et al.. (2020). An efficient and general approach for the joint order batching and picker routing problem. European Journal of Operational Research. 285(2). 497–512. 53 indexed citations
6.
Cambazard, Hadrien, et al.. (2018). Exact algorithms for the order picking problem. Computers & Operations Research. 100. 117–127. 67 indexed citations
7.
Cambazard, Hadrien, et al.. (2018). Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane. European Journal of Operational Research. 270(2). 419–429. 34 indexed citations
8.
Cambazard, Hadrien, et al.. (2015). New filtering for AtMostNValue and its weighted variant: A Lagrangian approach. Constraints. 20(3). 362–380. 5 indexed citations
9.
Cambazard, Hadrien, et al.. (2014). ROADEF CHALLENGE 2014: A MODELING APPROACH Rolling stock unit management on railway sites. 3 indexed citations
10.
Cambazard, Hadrien, Barry O’Sullivan, & Helmut Simonis. (2014). A Constraint‐Based Dental School Timetabling System. AI Magazine. 35(1). 53–63. 2 indexed citations
11.
Cambazard, Hadrien, Barry O’Sullivan, & Helmut Simonis. (2013). The Deployment of a Constraint-Based Dental School Timetabling System. Proceedings of the AAAI Conference on Artificial Intelligence. 27(2). 1459–1464.
12.
Cambazard, Hadrien, et al.. (2013). An Optimal Constraint Programming Approach to the Open-Shop Problem. Proceedings of the International Conference on Automated Planning and Scheduling. 23. 478–479.
13.
Cambazard, Hadrien, et al.. (2012). Local search and constraint programming for the post enrolment-based course timetabling problem. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations
14.
Cambazard, Hadrien, Eoin O’Mahony, & Barry O’Sullivan. (2011). A shortest path-based approach to the multileaf collimator sequencing problem. Discrete Applied Mathematics. 160(1-2). 81–99. 9 indexed citations
15.
Cambazard, Hadrien & Barry O’Sullivan. (2008). Reformulating Table Constraints using Functional Dependencies—An Application to Explanation Generation. Constraints. 13(3). 385–406. 2 indexed citations
16.
Cambazard, Hadrien & Narendra Jussien. (2007). Solving the Minimum Number of Open Stacks Problem with Explanation-based Techniques.. 14–19. 1 indexed citations
17.
Cambazard, Hadrien, et al.. (2006). Automata for nogood recording in constraint satisfaction problems. 1 indexed citations
18.
Cambazard, Hadrien, et al.. (2006). 2A2 SUBCONTRACTORS SCHEDULING ON RESIDENTIAL BUILDINGS CONSTRUCTION SITES(Technical session 2A: Application and practice 1) :. 2006. 32–37. 1 indexed citations
19.
Cambazard, Hadrien & Narendra Jussien. (2006). Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming. Constraints. 11(4). 295–313. 9 indexed citations
20.
Cambazard, Hadrien, et al.. (2004). Interactively solving school timetabling problems using extensions of constraint programming. SPIRE - Sciences Po Institutional REpository. 3 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

Rankless by CCL
2026