What is he best known for?
The fields of study he is best known for:
- Mathematical optimization
- Algorithm
- Linear programming
His primary areas of investigation include Flow network, Mathematical optimization, Algorithm, Minimum-cost flow problem and Shortest path problem.
His work in the fields of Flow network, such as Circulation problem, intersects with other areas such as Scaling.
His Heuristic, Search algorithm and Optimization problem study, which is part of a larger body of work in Mathematical optimization, is frequently linked to Radiation, bridging the gap between disciplines.
His research on Algorithm focuses in particular on Time complexity.
His Minimum-cost flow problem research is multidisciplinary, relying on both Discrete mathematics and Minimum cut.
His study looks at the relationship between Out-of-kilter algorithm and fields such as Binary logarithm, as well as how they intersect with chemical problems.
His most cited work include:
- Network Flows: Theory, Algorithms, and Applications (7235 citations)
- Network Flows (2178 citations)
- A survey of very large-scale neighborhood search techniques (518 citations)
What are the main themes of his work throughout his whole career to date?
Ravindra K. Ahuja spends much of his time researching Mathematical optimization, Algorithm, Flow network, Minimum-cost flow problem and Shortest path problem.
His study in Time complexity and Analysis of algorithms is carried out as part of his Algorithm studies.
His Flow network study incorporates themes from Maximum flow problem, Push–relabel maximum flow algorithm, Linear programming and Out-of-kilter algorithm.
His Minimum-cost flow problem research incorporates elements of Discrete mathematics, Minimum cut and Multi-commodity flow problem.
His study on Circulation problem is often connected to Convex optimization as part of broader study in Multi-commodity flow problem.
He combines subjects such as Assignment problem and Travel time with his study of Shortest path problem.
He most often published in these fields:
- Mathematical optimization (43.85%)
- Algorithm (28.46%)
- Flow network (27.69%)
What were the highlights of his more recent work (between 2009-2020)?
- Flow network (27.69%)
- Algorithm (28.46%)
- Mathematical optimization (43.85%)
In recent papers he was focusing on the following fields of study:
Ravindra K. Ahuja mainly investigates Flow network, Algorithm, Mathematical optimization, Operations research and Combinatorics.
In general Flow network, his work in Minimum-cost flow problem and Circulation problem is often linked to Scaling linking many areas of study.
As part of the same scientific family, Ravindra K. Ahuja usually focuses on Minimum-cost flow problem, concentrating on Multi-commodity flow problem and intersecting with Analysis of algorithms and Computational complexity theory.
His Algorithm research incorporates themes from Discrete mathematics, Shortest path problem, Canadian traveller problem, Euclidean shortest path and Scheduling.
His work deals with themes such as Nurse scheduling problem, Rate-monotonic scheduling and K shortest path routing, which intersect with Mathematical optimization.
Ravindra K. Ahuja has included themes like Scheduling, Heuristics and Integer programming in his Operations research study.
Between 2009 and 2020, his most popular works were:
- Network Flows (2178 citations)
- Faster Algorithms for the Shortest Path Problem (480 citations)
- Finding Minimum-cost Flows by Double Scaling (108 citations)
In his most recent research, the most cited papers focused on:
- Mathematical optimization
- Algorithm
- Linear programming
The scientist’s investigation covers issues in Flow network, Combinatorics, Scaling, Maximum flow problem and SIMPLE algorithm.
His Flow network research is mostly focused on the topic Circulation problem.
His studies deal with areas such as Binary logarithm, Sequential algorithm, Push–relabel maximum flow algorithm and Out-of-kilter algorithm as well as Maximum flow problem.
Arc is connected with Algorithm and Discrete mathematics in his research.
His studies in Algorithm integrate themes in fields like Minimum-cost flow problem and Transportation theory.
His research integrates issues of Dijkstra's algorithm, Shortest path problem and Fibonacci heap in his study of Discrete mathematics.
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.
