2026 James B. Orlin: Mathematics Researcher – H-Index, Publications & Awards

D-Index & Metrics

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	68	2017	1954	1018	979	202	47049
Mathematics	66	349	291	189	147	190	29763

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Computer Science

2017

1954

1018

979

202

47049

Mathematics

349

291

189

147

190

29763

Computer Science

D-Index

Citations

47049

World Ranking

2017

National Ranking

1018

Mathematics

D-Index

Citations

29763

World Ranking

349

National Ranking

189

Research.com Recognitions

2020 - Khachiyan Prize of the INFORMS Optimization Society
2006 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)

Overview

James B. Orlin is affiliated with the Massachusetts Institute of Technology (MIT) in the United States. Their research primarily spans the field of Computer Science, with specific focus on Computational Theory and Mathematics, Computer Networks and Communications, Management Science and Operations Research, Signal Processing, and Industrial and Manufacturing Engineering.

Their recent papers include:

A fast maximum flow algorithm, 2020, Networks
Diverse Data Selection under Fairness Constraints, 2021, arXiv (Cornell University)
Directed Shortest Paths via Approximate Cost Balancing, 2022, Society for Industrial and Applied Mathematics eBooks

James B. Orlin has coauthored with several researchers, among whom the most frequent collaborators are:

X Gong
Scott Ganz
Dorit S. Hochbaum
László A. Végh
Eranda Çela

Their work has been published in the following frequent venues:

arXiv (Cornell University)
Networks
Society for Industrial and Applied Mathematics eBooks
INFORMS Journal on Optimization

James B. Orlin's main areas of work encompass:

Complexity and Algorithms in Graphs
Advanced Graph Theory Research
Optimization and Search Problems
Multi-Criteria Decision Making
Data Management and Algorithms
Optimization and Packing Problems
Constraint Satisfaction and Optimization

Throughout their career, James B. Orlin has received recognition including the Khachiyan Prize of the INFORMS Optimization Society in 2020 and being named a Fellow of the Institute for Operations Research and the Management Sciences (INFORMS) in 2006.

Best Publications

Network Flows

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

16597
Citations
Network Flows: Theory, Algorithms, and Applications

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

13260
Citations
A Faster Strongly Polynomial Minimum Cost Flow Algorithm

James B. Orlin

1686
Citations
Faster Algorithms for the Shortest Path Problem

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

957
Citations
A survey of very large-scale neighborhood search techniques

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

931
Citations
Inverse Optimization

Ravindra K. Ahuja;James B. Orlin

666
Citations
A faster strongly polynomial time algorithm for submodular function minimization

James B. Orlin

592
Citations
A greedy genetic algorithm for the quadratic assignment problem

Ravindra K. Ahuja;James B. Orlin;Ashish Tiwari

543
Citations
Max flows in O(nm) time, or better

James B. Orlin

502
Citations
Single Transferable Vote Resists Strategic Voting

John J. Bartholdi;James B. Orlin

450
Citations
Contentment in graph theory: Covering graphs with cliques

James Orlin

393
Citations
Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem

Ravindra K. Ahuja;Arvind Kumar;Krishna C. Jha;James B. Orlin

360
Citations
A polynomial time primal network simplex algorithm for minimum cost flows

James B. Orlin

356
Citations
A faster algorithm for finding the minimum cut in a directed graph

Jianxiu Hao;James B. Orlin

278
Citations
Multi-Exchange Neighborhood Structures for the Capacitated Minimum Spanning Tree Problem

Ravindra K. Ahuja;James B. Orlin;Dushyant Sharma

249
Citations
A Fast and Simple Algorithm for the Maximum Flow Problem

R. K. Ahuja;James B. Orlin

248
Citations
Cyclic scheduling via integer programs with circular ones.

John J. Bartholdi;James B. Orlin;H. Donald Ratliff

242
Citations
Faster Parametric Shortest Path and Minimum Balance Algorithms

Neal E. Young;Robert E. Tarjant;James B. Orlin

240
Citations
Improved Algorithms for Bipartite Network Flow

Ravindra K. Ahuja;James B. Orlin;Clifford Stein

228
Citations
Greedoid-Based Noncompensatory Inference

Michael Yee;Ely Dahan;John R. Hauser;James Orlin

225
Citations

Frequent Co-Authors

Ravindra K. Ahuja University of Florida

Sudipta Sengupta Amazon (United States)

Thomas L. Magnanti MIT

David Simchi-Levi MIT

Andreas S. Schulz Technical University of Munich

Murali Kodialam Nokia (United States)

Moshe Dror University of Arizona

Dimitris Bertsimas MIT

Dorit S. Hochbaum University of California, Berkeley

Robert E. Tarjan Princeton University

External Links

Wikipedia of James B. Orlin Personal website of James B. Orlin Google Scholar page

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

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, exploring related online degrees can enhance career opportunities. Many professionals leverage their math background by pursuing an MBA, which offers strong business acumen alongside quantitative skills. If you're considering this path, it's helpful to look into programs that accept transfer credits, making it easier to build on your existing education. For instance, exploring mba transfer credits can save time and tuition costs.

In today’s data-driven world, combining a math degree with expertise in data analytics is highly valued. Some of the best masters in data analytics programs provide rigorous training in statistics, programming, and machine learning, ideal for math graduates aiming at tech and finance sectors.

If an MBA degree seems daunting, there are more accessible options out there. Researching what mba programs can i get into offers insight on schools with less competitive admission processes, suitable for those seeking flexible career upgrades.

Moreover, the rise of online education has made it simple to find easy online mba programs that balance quality, affordability, and convenience. These pathways complement a math background and open doors to leadership roles across various industries.