What is he best known for?
The fields of study he is best known for:
- Mathematical optimization
- Algorithm
- Marketing
His primary scientific interests are in Mathematical optimization, Vehicle routing problem, Tabu search, Operations research and Algorithm.
His Benders' decomposition, Column generation and Linear programming relaxation study, which is part of a larger body of work in Mathematical optimization, is frequently linked to Policy-based routing, bridging the gap between disciplines.
His research integrates issues of Combinatorial optimization, Integer programming and Heuristic in his study of Vehicle routing problem.
The study incorporates disciplines such as Beam search, Tabu search heuristic, Scheduling and Heuristics in addition to Tabu search.
The various areas that Jean-François Cordeau examines in his Operations research study include Routing, Inventory routing problem, Scheduling and Computer engineering.
The Branch and cut research Jean-François Cordeau does as part of his general Algorithm study is frequently linked to other disciplines of science, such as Dial a ride, therefore creating a link between diverse domains of science.
His most cited work include:
- A tabu search heuristic for periodic and multi-depot vehicle routing problems (671 citations)
- A unified tabu search heuristic for vehicle routing problems with time windows (667 citations)
- A Survey of Optimization Models for Train Routing and Scheduling (632 citations)
What are the main themes of his work throughout his whole career to date?
Jean-François Cordeau mainly focuses on Mathematical optimization, Vehicle routing problem, Operations research, Routing and Algorithm.
His Heuristic, Tabu search, Heuristic, Heuristics and Integer programming investigations are all subjects of Mathematical optimization research.
His work deals with themes such as Scheduling and Combinatorial optimization, which intersect with Vehicle routing problem.
His Operations research research is multidisciplinary, incorporating elements of Scheduling and Transport engineering.
He interconnects Time horizon and Benchmark in the investigation of issues within Routing.
His study looks at the relationship between Algorithm and fields such as Column generation, as well as how they intersect with chemical problems.
He most often published in these fields:
- Mathematical optimization (61.65%)
- Vehicle routing problem (22.33%)
- Operations research (21.36%)
What were the highlights of his more recent work (between 2018-2021)?
- Mathematical optimization (61.65%)
- Routing (20.87%)
- Operations research (21.36%)
In recent papers he was focusing on the following fields of study:
Jean-François Cordeau mostly deals with Mathematical optimization, Routing, Operations research, Heuristics and Time horizon.
His Mathematical optimization study frequently draws connections between related disciplines such as Network planning and design.
His Routing research integrates issues from Supply chain, Multi product and Distributed computing.
His biological study deals with issues like Service level, which deal with fields such as Heuristic, Vehicle routing problem and Benchmark.
In his study, Assignment problem and Optimization problem is strongly linked to Integer programming, which falls under the umbrella field of Operations research.
His Heuristics research incorporates themes from Variable neighborhood search, Transport engineering, Fleet management and Job shop scheduling.
Between 2018 and 2021, his most popular works were:
- Solving a large multi-product production-routing problem with delivery time windows (30 citations)
- A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing (27 citations)
- Benders decomposition for very large scale partial set covering and maximal covering location problems (25 citations)
In his most recent research, the most cited papers focused on:
- Mathematical optimization
- Algorithm
- Marketing
His primary areas of study are Mathematical optimization, Routing, Time horizon, Decomposition and Operations research.
His work on Forcing expands to the thematically related Mathematical optimization.
His Time horizon study combines topics in areas such as Demand forecasting and Holding cost.
His Operations research study which covers Stochastic programming that intersects with Benchmark.
He conducts interdisciplinary study in the fields of Time windows and Vehicle routing problem through his research.
His Heuristic study incorporates themes from Metaheuristic and Heuristic.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
