Line-digraphs, arborescences, and theorems of tutte and knuth. - James B. Orlin (J. Comb. Theory B, 1978)

Cyclic Scheduling via Integer Programs with Circular Ones. - John J. Bartholdi III; James B. Orlin; H. Donald Ratliff (Oper. Res., 1980)

The Complexity of Dynamic Languages and Dynamic Optimization Problems - James B. Orlin (STOC, 1981)

Parametric shortest path algorithms with an application to cyclic staffing. - Richard M. Karp; James B. Orlin (Discret. Appl. Math., 1981)

Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets. - James B. Orlin (Oper. Res., 1982)

A polynomial algorithm for integer programming covering problems satisfying the integer round-up property. - James B. Orlin (Math. Program., 1982)

Maximum-throughput dynamic network flows. - James B. Orlin (Math. Program., 1983)

Dynamic matchings and quasidynamic fractional matchings. I. - James B. Orlin (Networks, 1983)

Dynamic matchings and quasidynamic fractional matchings. II. - James B. Orlin (Networks, 1983)

Minimum Convex Cost Dynamic Network Flows. - James B. Orlin (Math. Oper. Res., 1984)

Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment. - Amiya K. Chakravarty; James B. Orlin; Uriel G. Rothblum (Oper. Res., 1985)

Technical Note - Some Very Easy Knapsack/Partition Problems. - James B. Orlin (Oper. Res., 1985)

NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings. - Zevi Miller; James B. Orlin (J. Algorithms, 1985)

On the complexity of four polyhedral set containment problems. - Robert M. Freund; James B. Orlin (Math. Program., 1985)

Computing optimal scalings by parametric network algorithms. - James B. Orlin; Uriel G. Rothblum (Math. Program., 1985)

A minimum concave-cost dynamic network flow problem with an application to lot-sizing. - Stephen C. Graves; James B. Orlin (Networks, 1985)

A Faster Strongly Polynominal Minimum Cost Flow Algorithm - James B. Orlin (STOC, 1988)

Parametric linear programming and anti-cycling pivoting rules. - Thomas L. Magnanti; James B. Orlin (Math. Program., 1988)

The structure of bases in bicircular matroids. - Randy Shull; James B. Orlin; Alan Shuchat; Marianne L. Gardner (Discret. Appl. Math., 1989)

A Fast and Simple Algorithm for the Maximum Flow Problem. - Ravindra K. Ahuja; James B. Orlin (Oper. Res., 1989)

Improved Time Bounds for the Maximum Flow Problem. - Ravindra K. Ahuja; James B. Orlin; Robert Endre Tarjan (SIAM J. Comput., 1989)

Solving the Linear Matroid Parity Problem as a Sequence of Matroid Intersection Problems. - James B. Orlin; John H. Vande Vate (Math. Program., 1990)

Faster Algorithms for the Shortest Path Problem - Ravindra K. Ahuja; Kurt Mehlhorn; James B. Orlin; Robert Endre Tarjan (J. ACM, 1990)

Recognizing Strong Connectivity in (Dynamic) Periodic Graphs and its Relation to Integer Programming. - Murali S. Kodialam; James B. Orlin (SODA, 1991)

Faster parametric shortest path and minimum-balance algorithms. - Neal E. Young; Robert Endre Tarjan; James B. Orlin (Networks, 1991)

Some Recent Advances in Network Flows. - Ravindra K. Ahuja; Thomas L. Magnanti; James B. Orlin (SIAM Rev., 1991)

A Technique for Speeding up the Solution of the Lagrangian Dual. - Dimitris Bertsimas; James B. Orlin (IPCO, 1992)

A Faster Algorithm for Finding the Minimum Cut in a Graph. - Jianxiu Hao; James B. Orlin (SODA, 1992)

The Scaling Network Simplex Algorithm. - Ravindra K. Ahuja; James B. Orlin (Oper. Res., 1992)

Finding minimum-cost flows by double scaling. - Ravindra K. Ahuja; Andrew V. Goldberg; James B. Orlin; Robert Endre Tarjan (Math. Program., 1992)

New scaling algorithms for the assignment and minimum mean cycle problems. - James B. Orlin; Ravindra K. Ahuja (Math. Program., 1992)

Network flows - theory, algorithms and applications. - Ravindra K. Ahuja; Thomas L. Magnanti; James B. Orlin (Prentice Hall, 1993)

Recognizing Hidden Bicircular Networks. - Randy Shull; Alan Shuchat; James B. Orlin; Marianne Lepp (Discret. Appl. Math., 1993)

A Faster Strongly Polynomial Minimum Cost Flow Algorithm. - James B. Orlin (Oper. Res., 1993)

Determination of optimal vertices from feasible solutions in unimodular linear programming. - Shinji Mizuno; Romesh Saigal; James B. Orlin (Math. Program., 1993)

Polynomial dual network simplex algorithms. - James B. Orlin; Serge A. Plotkin; Éva Tardos (Math. Program., 1993)

Finding minimum cost to time ratio cycles with small integral transit times. - Mark Hartmann; James B. Orlin (Networks, 1993)

Parallel algorithms for the assignment and minimum-cost flow problems. - James B. Orlin; Clifford Stein 001 (Oper. Res. Lett., 1993)

A Faster Algorithm for Finding the Minimum Cut in a Directed Graph. - Jianxiu Hao; James B. Orlin (J. Algorithms, 1994)

A technique for speeding up the solution of the Lagrangean dual. - Dimitris Bertsimas; James B. Orlin (Math. Program., 1994)

Improved Algorithms for Bipartite Network Flow. - Ravindra K. Ahuja; James B. Orlin; Clifford Stein 001; Robert Endre Tarjan (SIAM J. Comput., 1994)

A capacity scaling algorithm for the constrained maximum flow problem. - Ravindra K. Ahuja; James B. Orlin (Networks, 1995)

A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows (An Extended Abstract). - James B. Orlin (SODA, 1996)

Use of Representative Operation Counts in Computational Testing of Algorithms. - Ravindra K. Ahuja; James B. Orlin (INFORMS J. Comput., 1996)

Commentary - On Experimental Methods for Algorithm Simulation. - James B. Orlin (INFORMS J. Comput., 1996)

Developing Fitter Genetic Algorithms. - Ravindra K. Ahuja; James B. Orlin (INFORMS J. Comput., 1997)

Optimized Crossover for the Independent Set Problem. - Charu C. Aggarwal; James B. Orlin; Ray P. Tai (Oper. Res., 1997)

A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines. - Paul Mireault; James B. Orlin; Rakesh V. Vohra (Oper. Res., 1997)

Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem. - Donald Goldfarb; Zhiying Jin; James B. Orlin (Math. Oper. Res., 1997)

A polynomial time primal network simplex algorithm for minimum cost flows. - James B. Orlin (Math. Program., 1997)

Equivalence of the primal and dual simplex algorithms for the maximum flow problem. - Ravindra K. Ahuja; James B. Orlin (Oper. Res. Lett., 1997)

A Scaling Algorithm for Multicommodity Flow Problems. - Rina R. Schneur; James B. Orlin (Oper. Res., 1998)

Diagnosing infeasibilities in network flow problems. - Charu C. Aggarwal; Ravindra K. Ahuja; Jianxiu Hao; James B. Orlin (Math. Program., 1998)

Solving Inverse Spanning Tree Problems Through Network Flow Techniques. - P. T. Sokkalingam; Ravindra K. Ahuja; James B. Orlin (Oper. Res., 1999)

Networks And Flows. - James B. Orlin; Ravindra K. Ahuja; David Simchi-Levi; Sunil Chopra; Bruce L. Golden; B. K. Kaku (Handbook of Discrete and Combinatorial Mathematics, 1999)

epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract). - James B. Orlin; Andreas S. Schulz; Sudipta Sengupta (STOC, 2000)

A greedy genetic algorithm for the quadratic assignment problem. - Ravindra K. Ahuja; James B. Orlin; Ashish Tiwari 001 (Comput. Oper. Res., 2000)

A Faster Algorithm for the Inverse Spanning Tree Problem. - Ravindra K. Ahuja; James B. Orlin (J. Algorithms, 2000)

New polynomial-time cycle-canceling algorithms for minimum-cost flows. - P. T. Sokkalingam; Ravindra K. Ahuja; James B. Orlin (Networks, 2000)

Optimal Rounding of Instantaneous Fractional Flows Over Time. - Lisa Fleischer; James B. Orlin (SIAM J. Discret. Math., 2000)

Inverse Optimization. - Ravindra K. Ahuja; James B. Orlin (Oper. Res., 2001)

A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints. - Ravindra K. Ahuja; James B. Orlin (Oper. Res., 2001)

Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. - Ravindra K. Ahuja; James B. Orlin; Dushyant Sharma (Math. Program., 2001)

Branch-and-Bound Algorithms for the Test Cover Problem. - Koen M. J. De Bontridder; B. J. Lageweg; Jan Karel Lenstra; James B. Orlin; Leen Stougie (ESA, 2002)

A survey of very large-scale neighborhood search techniques. - Ravindra K. Ahuja; Özlem Ergun; James B. Orlin; Abraham P. Punnen (Discret. Appl. Math., 2002)

On multiroute maximum flows in networks. - Charu C. Aggarwal; James B. Orlin (Networks, 2002)

Combinatorial algorithms for inverse network flow problems. - Ravindra K. Ahuja; James B. Orlin (Networks, 2002)

A network simplex algorithm with O(n) consecutive degenerate pivots. - Ravindra K. Ahuja; James B. Orlin; Prabha Sharma; P. T. Sokkalingam (Oper. Res. Lett., 2002)

Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights. - Ravindra K. Ahuja; James B. Orlin; Stefano Pallottino; Maria Grazia Scutellà (Transp. Sci., 2002)

Solving the Convex Cost Integer Dual Network Flow Problem. - Ravindra K. Ahuja; Dorit S. Hochbaum; James B. Orlin (Manag. Sci., 2003)

Dynamic shortest paths minimizing travel times and costs. - Ravindra K. Ahuja; James B. Orlin; Stefano Pallottino; Maria Grazia Scutellà (Networks, 2003)

A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. - Ravindra K. Ahuja; James B. Orlin; Dushyant Sharma (Oper. Res. Lett., 2003)

A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem. - Ravindra K. Ahuja; Dorit S. Hochbaum; James B. Orlin (Algorithmica, 2004)

A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem. - Ravindra K. Ahuja; James B. Orlin; Stefano Pallottino; Maria Paola Scaparra; Maria Grazia Scutellà (Manag. Sci., 2004)

Extended neighborhood: Definition and characterization. - James B. Orlin; Dushyant Sharma (Math. Program., 2004)

A neighborhood search algorithm for the combined through and fleet assignment model with time windows. - Ravindra K. Ahuja; Jian Liu; James B. Orlin; Jon Goodstein; Amit Mukherjee (Networks, 2004)

Approximate Local Search in Combinatorial Optimization. - James B. Orlin; Abraham P. Punnen; Andreas S. Schulz (SIAM J. Comput., 2004)

Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems. - Agustín Bompadre; James B. Orlin (IPCO, 2005)

IFORS' Operational Research Hall of Fame Delbert Ray Fulkerson. - Robert G. Bland; James B. Orlin (Int. Trans. Oper. Res., 2005)

Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs. - Ramkumar Ramaswamy; James B. Orlin; Nilopal Chakravarti (Math. Program., 2005)

Solving Real-Life Locomotive-Scheduling Problems. - Ravindra K. Ahuja; Jian Liu; James B. Orlin; Dushyant Sharma; Larry A. Shughart (Transp. Sci., 2005)

A Versatile Scheme for Routing Highly Variable Traffic in Service Overlays and IP Backbones. - Murali S. Kodialam; T. V. Lakshman; James B. Orlin; Sudipta Sengupta (INFOCOM, 2006)

Very Large-Scale Neighborhood Search Techniques in Timetabling Problems. - Carol Meyers; James B. Orlin (PATAT, 2006)

Improved bounds for vehicle routing solutions. - Agustín Bompadre; Moshe Dror; James B. Orlin (Discret. Optim., 2006)

A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem. - Özlem Ergun; James B. Orlin (Discret. Optim., 2006)

Creating very large scale neighborhoods out of smaller ones by compounding moves. - Özlem Ergun; James B. Orlin; Abran Steele-Feldman (J. Heuristics, 2006)

The Tsp and the Sum of its Marginal Values. - Moshe Dror; Yusin Lee; James B. Orlin; Valentin Polishchuk (Int. J. Comput. Geom. Appl., 2006)

On the Sum-of-Squares algorithm for bin packing. - János Csirik; David S. Johnson 001; Claire Kenyon; James B. Orlin; Peter W. Shor; Richard R. Weber 003 (J. ACM, 2006)

Fast neighborhood search for the single machine total weighted tardiness problem. - Özlem Ergun; James B. Orlin (Oper. Res. Lett., 2006)

A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model. - Ravindra K. Ahuja; Jon Goodstein; Amit Mukherjee; James B. Orlin; Dushyant Sharma (INFORMS J. Comput., 2007)

Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem. - Ravindra K. Ahuja; Krishna C. Jha; James B. Orlin; Dushyant Sharma (INFORMS J. Comput., 2007)

Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem. - Ravindra K. Ahuja; Arvind Kumar; Krishna C. Jha; James B. Orlin (Oper. Res., 2007)

Lexicographically Minimum and Maximum Load Linear Programming Problems. - Dritan Nace; James B. Orlin (Oper. Res., 2007)

Preconfiguring IP-over-Optical Networks to Handle Router Failures and Unpredictable Traffic. - Murali S. Kodialam; T. V. Lakshman; James B. Orlin; Sudipta Sengupta (IEEE J. Sel. Areas Commun., 2007)

Very Large-Scale Neighborhood Search. - Özlem Ergun; Abraham P. Punnen; James B. Orlin; Ravindra K. Ahuja (Handbook of Approximation Algorithms and Metaheuristics, 2007)

A Fast, Simpler Algorithm for the Matroid Parity Problem. - James B. Orlin (IPCO, 2008)

Scale-invariant clustering with minimum volume ellipsoids. - Mahesh Kumar; James B. Orlin (Comput. Oper. Res., 2008)

Scheduling malleable tasks with interdependent processing rates: Comments and observations. - Edmund K. Burke; Moshe Dror; James B. Orlin (Discret. Appl. Math., 2008)

epsilon-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems. - James B. Orlin; Andreas S. Schulz; Sudipta Sengupta (Discret. Optim., 2008)

A simple method for improving the primal simplex method for the multicommodity flow problem. - Agustín Bompadre; James B. Orlin (Networks, 2008)

Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets. - Moshe Dror; James B. Orlin (SIAM J. Discret. Math., 2008)

The Locomotive Routing Problem. - Balachandran Vaidyanathan; Ravindra K. Ahuja; James B. Orlin (Transp. Sci., 2008)

A simple combinatorial algorithm for submodular function minimization. - Satoru Iwata 001; James B. Orlin (SODA, 2009)

Integer Programming: Optimization and Evaluation Are Equivalent. - James B. Orlin; Abraham P. Punnen; Andreas S. Schulz (WADS, 2009)

Incremental Network Optimization: Theory and Algorithms. - Onur Seref; Ravindra K. Ahuja; James B. Orlin (Oper. Res., 2009)

A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand. - Nir Halman; Diego Klabjan; Mohamed Mostagir; James B. Orlin; David Simchi-Levi (Math. Oper. Res., 2009)

A faster strongly polynomial time algorithm for submodular function minimization. - James B. Orlin (Math. Program., 2009)

Oblivious routing of highly variable traffic in service overlays and IP backbones. - Murali S. Kodialam; T. V. Lakshman; James B. Orlin; Sudipta Sengupta (IEEE/ACM Trans. Netw., 2009)

Maximum Flow Problem. - Ravindra K. Ahuja; Thomas L. Magnanti; James B. Orlin (Encyclopedia of Optimization, 2009)

Minimum Cost Flow Problem. - Ravindra K. Ahuja; Thomas L. Magnanti; James B. Orlin (Encyclopedia of Optimization, 2009)

Improved Algorithms for Computing Fisher's Market Clearing Prices. - James B. Orlin (Equilibrium Computation, 2010)

Improved algorithms for computing fisher's market clearing prices: computing fisher's market clearing prices. - James B. Orlin (STOC, 2010)

Packing Shelves with Items that Divide the Shelves' Length: a Case of a Universal Number Partition Problem. - Moshe Dror; James B. Orlin; Michael Zhu (Discret. Math. Algorithms Appl., 2010)

A faster algorithm for the single source shortest path problem with few distinct positive lengths. - James B. Orlin; Kamesh Madduri; K. Subramani 001; Matthew D. Williamson (J. Discrete Algorithms, 2010)

Complexity results for equistable graphs and related classes. - Martin Milanic; James B. Orlin; Gábor Rudolf (Ann. Oper. Res., 2011)

Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator. - Woonghee Tim Huh; Retsef Levi; Paat Rusmevichientong; James B. Orlin (Oper. Res., 2011)

End-to-end restorable oblivious routing of hose model traffic. - Murali S. Kodialam; T. V. Lakshman; James B. Orlin; Sudipta Sengupta (IEEE/ACM Trans. Netw., 2011)

A Simple Approximation Algorithm for Computing Arrow-Debreu Prices. - Mehdi Ghiyasvand; James B. Orlin (Oper. Res., 2012)

Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle. - Nir Halman; James B. Orlin; David Simchi-Levi (Oper. Res., 2012)

Max flows in O(nm) time, or better. - James B. Orlin (STOC, 2013)

Robust optimization with incremental recourse. - Ebrahim Nasrabadi; James B. Orlin (CoRR, 2013)

On the hardness of finding subsets with equal average. - Edith Elkind; James B. Orlin (Inf. Process. Lett., 2013)

Simplifications and speedups of the pseudoflow algorithm. - Dorit S. Hochbaum; James B. Orlin (Networks, 2013)

Fast algorithms for convex cost flow problems on circles, lines, and trees. - James B. Orlin; Balachandran Vaidyanathan (Networks, 2013)

Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs. - Nir Halman; Diego Klabjan; Chung-Lun Li; James B. Orlin; David Simchi-Levi (SIAM J. Discret. Math., 2014)

A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs. - Nir Halman; Giacomo Nannicini; James B. Orlin (SIAM J. Optim., 2015)

A characterization of irreducible infeasible subsystems in flow networks. - Imke Joormann; James B. Orlin; Marc E. Pfetsch (Networks, 2016)

On the power of randomization in network interdiction. - Dimitris Bertsimas; Ebrahim Nasrabadi; James B. Orlin (Oper. Res. Lett., 2016)

An O(nm) time algorithm for finding the min length directed cycle in a graph. - James B. Orlin; Antonio Sedeño-Noda (SODA, 2017)

Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications. - Ravindra K. Ahuja; Özlem Ergun; James B. Orlin; Abraham P. Punnen (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Randomized algorithms for finding the shortest negative cost cycle in networks. - James B. Orlin; K. Subramani 001; Piotr Wojciechowski 002 (Discret. Appl. Math., 2018)

On the complexity of energy storage problems. - Nir Halman; Giacomo Nannicini; James B. Orlin (Discret. Optim., 2018)

Robust monotone submodular function maximization. - James B. Orlin; Andreas S. Schulz; Rajan Udwani (Math. Program., 2018)

A Fast Max Flow Algorithm. - James B. Orlin; Xiao-Yue Gong (CoRR, 2019)

Distributionally Robust Max Flows. - Louis L. Chen; Will Ma; James B. Orlin; David Simchi-Levi (SOSA, 2020)

Linearizable Special Cases of the Quadratic Shortest Path Problem. - Eranda Çela; Bettina Klinz; Stefan Lendl; James B. Orlin; Gerhard J. Woeginger; Lasse Wulf (WG, 2021)

A fast maximum flow algorithm. - James B. Orlin; Xiao-Yue Gong (Networks, 2021)

Directed Shortest Paths via Approximate Cost Balancing. - James B. Orlin; László A. Végh (J. ACM, 2023)

The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings. - Nathan Atkinson; Scott C. Ganz; Dorit S. Hochbaum; James B. Orlin (INFORMS J. Optim., 2025)