Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Network Flows: Theory, Algorithms, and Applications.
19945.4k citationsRavindra K. Ahuja, James B. Orlin et al.profile →
A survey of very large-scale neighborhood search techniques
2002404 citationsRavindra K. Ahuja, Özlem Ergün et al.Discrete Applied Mathematicsprofile →
Countries citing papers authored by James B. Orlin
Since
Specialization
Citations
This map shows the geographic impact of James B. Orlin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by James B. Orlin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites James B. Orlin more than expected).
This network shows the impact of papers produced by James B. Orlin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by James B. Orlin. The network helps show where James B. Orlin may publish in the future.
Co-authorship network of co-authors of James B. Orlin
This figure shows the co-authorship network connecting the top 25 collaborators of James B. Orlin.
A scholar is included among the top collaborators of James B. Orlin based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with James B. Orlin. James B. Orlin is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Huh, Woonghee Tim, Retsef Levi, Paat Rusmevichientong, & James B. Orlin. (2009). Adaptive data-driven inventory control policies based on Kaplan-Meier estimator.3 indexed citations
Ahuja, Ravindra K., Özlem Ergün, James B. Orlin, & Abraham P. Punnen. (2002). A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics. 123(1-3). 75–102.404 indexed citations breakdown →
13.
Orlin, James B.. (1996). A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows (An Extended Abstract).. Symposium on Discrete Algorithms. 474–481.1 indexed citations
Ahuja, Ravindra K., James B. Orlin, & Ashish Tiwari. (1995). A Greedy Genetic Algorithm for the Quadratic Assignment Problem. RePEc: Research Papers in Economics. 567.6 indexed citations
Hao, Jianxiu & James B. Orlin. (1992). A faster algorithm for finding the minimum cut in a graph. RePEc: Research Papers in Economics. 165–174.62 indexed citations
18.
Orlin, James B.. (1985). The complexity of dynamic/periodic languages and optimization problems. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–19.5 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.