What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- Network Flows: Theory, Algorithms, and Applications (7235 citations)
- Network Flows (2178 citations)
- An STS-Based Map of the Human Genome (733 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Mathematical optimization (40.17%)
- Combinatorics (32.75%)
- Algorithm (28.82%)
What were the highlights of his more recent work (between 2010-2021)?
- Combinatorics (32.75%)
- Mathematical optimization (40.17%)
- Algorithm (28.82%)
In recent papers he was focusing on the following fields of study:
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.
Between 2010 and 2021, his most popular works were:
- Network Flows (2178 citations)
- Faster Algorithms for the Shortest Path Problem (480 citations)
- Single Transferable Vote Resists Strategic Voting (323 citations)
In his most recent research, the most cited papers focused on:
- 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.
