- Home
- Best Scientists - Mathematics
- Ravindra K. Ahuja

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
48
Citations
21,815
102
World Ranking
860
National Ranking
425

Computer Science
D-index
49
Citations
38,452
109
World Ranking
3767
National Ranking
1920

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

- Network Flows: Theory, Algorithms, and Applications (7235 citations)
- Network Flows (2178 citations)
- A survey of very large-scale neighborhood search techniques (518 citations)

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.

- Mathematical optimization (43.85%)
- Algorithm (28.46%)
- Flow network (27.69%)

- Flow network (27.69%)
- Algorithm (28.46%)
- Mathematical optimization (43.85%)

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.

- Network Flows (2178 citations)
- Faster Algorithms for the Shortest Path Problem (480 citations)
- Finding Minimum-cost Flows by Double Scaling (108 citations)

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

Network Flows

R. K. Ahuja;T. L. Magnanti;J. B. Orlin.

**(2011)**

16592 Citations

Network Flows

R. K. Ahuja;T. L. Magnanti;J. B. Orlin.

**(2011)**

16592 Citations

Network Flows: Theory, Algorithms, and Applications

Ravindra K. Ahuja;Thomas L. Magnanti;James B. Orlin.

**(1993)**

12877 Citations

Network Flows: Theory, Algorithms, and Applications

Ravindra K. Ahuja;Thomas L. Magnanti;James B. Orlin.

**(1993)**

12877 Citations

Faster Algorithms for the Shortest Path Problem

Ravindra K. Ahuja;Kurt Mehlhorn;James Orlin;Robert E. Tarjan.

**(2011)**

922 Citations

Faster Algorithms for the Shortest Path Problem

Ravindra K. Ahuja;Kurt Mehlhorn;James Orlin;Robert E. Tarjan.

**(2011)**

922 Citations

A survey of very large-scale neighborhood search techniques

Ravindra K. Ahuja;Özlem Ergun;James B. Orlin;Abraham P. Punnen.

Discrete Applied Mathematics **(2002)**

875 Citations

A survey of very large-scale neighborhood search techniques

Ravindra K. Ahuja;Özlem Ergun;James B. Orlin;Abraham P. Punnen.

Discrete Applied Mathematics **(2002)**

875 Citations

Inverse Optimization

Ravindra K. Ahuja;James B. Orlin.

Operations Research archive **(2001)**

589 Citations

Inverse Optimization

Ravindra K. Ahuja;James B. Orlin.

Operations Research archive **(2001)**

589 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

MIT

Georgia Institute of Technology

University of California, Berkeley

Princeton University

Microsoft (United States)

Technical University of Berlin

Technical University of Kaiserslautern

University of Maryland, College Park

University of Western Ontario

Aristotle University of Thessaloniki

Vienna University of Economics and Business

University of Delaware

University of Houston

Nihon University

Nanjing University

Thomas Jefferson University

University of Dundee

Jeju National University

Flinders University

Nagoya University

Boston University

University of Sheffield

Mayo Clinic

Murdoch University

Something went wrong. Please try again later.