- Home
- Best Scientists - Mathematics
- James B. Orlin

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
61
Citations
27,855
182
World Ranking
346
National Ranking
196

Computer Science
D-index
63
Citations
45,058
191
World Ranking
1676
National Ranking
920

2020 - Khachiyan Prize of the INFORMS Optimization Society

2006 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)

- Algorithm
- Real number
- Combinatorics

James B. Orlin mainly focuses on Combinatorics, Flow network, Algorithm, Minimum-cost flow problem and Mathematical optimization. James B. Orlin studied Combinatorics and Discrete mathematics that intersect with Transportation theory and Numerical analysis. His research in Flow network intersects with topics in Cyclic scheduling, Push–relabel maximum flow algorithm, Bounded function and Out-of-kilter algorithm.

His Algorithm research is multidisciplinary, relying on both Graph theory and Shortest path problem. His Minimum-cost flow problem study incorporates themes from Multi-commodity flow problem and Minimum cut. His studies in Multi-commodity flow problem integrate themes in fields like Minimum k-cut and Maximum cut.

- Network Flows: Theory, Algorithms, and Applications (7235 citations)
- Network Flows (2178 citations)
- An STS-Based Map of the Human Genome (733 citations)

James B. Orlin mainly investigates Mathematical optimization, Combinatorics, Algorithm, Discrete mathematics and Flow network. His Algorithm research incorporates elements of Suurballe's algorithm, Graph theory and Bounded function. James B. Orlin has included themes like Linear programming and Integer programming in his Discrete mathematics study.

Minimum-cost flow problem and Circulation problem are the subjects of his Flow network studies. His Minimum-cost flow problem research includes themes of Assignment problem and Multi-commodity flow problem. His Multi-commodity flow problem research focuses on subjects like Out-of-kilter algorithm, which are linked to Push–relabel maximum flow algorithm.

- Mathematical optimization (40.17%)
- Combinatorics (32.75%)
- Algorithm (28.82%)

- Combinatorics (32.75%)
- Mathematical optimization (40.17%)
- Algorithm (28.82%)

His primary scientific interests are in Combinatorics, Mathematical optimization, Algorithm, Binary logarithm and Discrete mathematics. In general Combinatorics study, his work on Shortest path problem, Time complexity, Submodular set function and Graph often relates to the realm of Monotone polygon, thereby connecting several areas of interest. James B. Orlin works mostly in the field of Mathematical optimization, limiting it down to topics relating to Path and, in certain cases, Randomness, as a part of the same area of interest.

His studies deal with areas such as Suurballe's algorithm, Minimum-cost flow problem, Simplex, Log-log plot and Polynomial as well as Algorithm. James B. Orlin combines subjects such as Maximum flow problem and Simplex algorithm with his study of Binary logarithm. The concepts of his Maximum flow problem study are interwoven with issues in Bounded function and Flow network.

- Network Flows (2178 citations)
- Faster Algorithms for the Shortest Path Problem (480 citations)
- Single Transferable Vote Resists Strategic Voting (323 citations)

- Algorithm
- Real number
- Mathematical optimization

James B. Orlin mostly deals with Combinatorics, Flow network, Algorithm, Mathematical optimization and Time complexity. His Combinatorics research includes elements of Discrete mathematics and Linear programming. Many of his research projects under Flow network are closely connected to Arc with Arc, tying the diverse disciplines of science together.

His Algorithm research is multidisciplinary, incorporating elements of Suurballe's algorithm, Shortest path problem, Minimum-cost flow problem, Simplex and Polynomial. His biological study spans a wide range of topics, including Econometrics, Inventory control, Estimator, Kaplan–Meier estimator and Consistency. His Time complexity study combines topics in areas such as Stochastic programming, d-ary heap and Knapsack problem.

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

A Faster Strongly Polynomial Minimum Cost Flow Algorithm

James B. Orlin.

Operations Research **(1993)**

1636 Citations

A Faster Strongly Polynomial Minimum Cost Flow Algorithm

James B. Orlin.

Operations Research **(1993)**

1636 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

An STS-Based Map of the Human Genome

Thomas J. Hudson;Lincoln D. Stein;Sebastian S. Gerety;Junli Ma.

Science **(1995)**

919 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

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:

University of Florida

Amazon (United States)

Technical University of Munich

Nokia (United States)

University of Arizona

University of California, Berkeley

Princeton University

University of Oxford

Temple University

Beijing University of Technology

University of Melbourne

Michigan State University

University of Edinburgh

Chalmers University of Technology

Texas A&M University

INRAE : Institut national de recherche pour l'agriculture, l'alimentation et l'environnement

Hokkaido University

Karolinska University Hospital

Johns Hopkins University

University of Kent

University of Birmingham

New York University

University of Wisconsin–Milwaukee

Something went wrong. Please try again later.