Research Interests
His research has focused on the design and analysis of efficient algorithms for network optimization and combinatorial optimization as well as the development of efficient data structures for network optimization problems. He is also interested in algorithms and heuristics in network optimization as applied to a wide range of different problems.
See his work on Google Scholar.
Publications
"A Fast Max Flow Algorithm."
Orlin, James B. and Xiaoyue Gong. Networks Vol. 77, No. 2 (2021): 287-321. arXiv Preprint."Robust Monotone Submodular Function Maximization."
Orlin, James B., Andreas S. Schulz, and Rajan Udwani. Mathematical Programming Vol. 172, No. 1/2 (2018): 505-537."On the Complexity of Energy Storage Problems."
Halman, Nir, Giacomo Nannicini, and James B. Orlin. Discrete Optimization Vol. 28, (2018): 31-53."Randomized Algorithms for Finding the Shortest Negative Cost Cycle in Networks."
Orlin, James B., K.Subramani, and Piotr Wojciechowki. Discrete Applied Mathematics Vol. 236, (2018): 387-394."A Characterization of Irreducible Infeasible Subsystems in Flow Networks."
Joormann, Imke, James B. Orlin, and Marc E. Pfetsch. Networks Vol. 68, No. 2 (2016): 121-129."On the Power of Randomization in Network Interdiction."
Bertsimas, Dimitris, Ebrahim Nasrabadi and James B. Orlin. Operations Research Letters Vol. 44, No. 1 (2016): 114–120."Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs."
Halman, Nir, Diego Klabjan, Chung-Lun Li, James Orlin and David Simchi-Levi. SIAM Journal on Discrete Mathematics Vol. 28, No. 4 (2014): 1725–1796."A Computationally Fast FPTAS for Convex Stochastic Dynamic Programs."
Halman, Nir, Giacamo Nannicini and James B. Orlin. SIAM Journal on Optimization Vol. 25, No. 1 (2013): 317–350."Fast Algorithms for Convex Cost Flow Problems on Circles, Lines, and Trees."
Orlin, James B. and Balachandran Vaidyanathan. Networks Vol. 62, No. 4 (2013): 288-296."On the hardness of finding subsets with equal average."
Elkind, Edith and James B. Orlin. Information Processing Letters Vol. 113, No. 13 (2013): 477-480."Simplifications and Speedups of the Pseudoflow Algorithm."
Hochbaum, Dorit S. and James B. Orlin. Networks Vol. 61, No. 1 (2013): 40-57."A Simple Approximation Algorithm for Computing Arrow-Debreu Prices."
Ghiyasvand, Mehdi and James B. Orlin. Operations Research Vol. 60, No. 5 (2012): 1245-1248."Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-sizing Problems When Data Is Given By an Oracle."
Halman, Nir, James B. Orlin and David Simchi-Levi. Operations Research Vol. 60, No. 2 (2012): 429-446."Adaptive Data-Driven Inventory Control Policies Based on Kaplan-Meir Estimator."
Huh, Woonghee Tim, Retsef Levi, Paat Rusmevichientong and James B. Orlin. Operations Research Vol. 59, No. 4 (2011): 929–941."Complexity Results for Equistable Graphs and Related Classes."
Milanič, Martin, James B. Orlin and Gábor Rudolf. Annals of Operations Research Vol. 188, No. 1 (2011): 359-370."End-to-End Restorable Oblivious Routing of Hose Model Traffic."
Kodialam, Muralidharan S., T. V. Lakshman, James B. Orlin and Sudipta Sengupta. IEEE/ACM Transactions on Networking Vol. 19, No. 4 (2011): 1223-1236."A Faster Algorithm for the Single Source Shortest Path Problem with Few Distinct Positive Lengths."
Orlin, James B., Kamesh Madduri, K. Subramani and M. Williamson. Journal of Discrete Algorithms Vol. 8, No. 2 (2010): 189-198."Packing Shelves with Items that Divide the Shelves' Length: A Case of a Universal Number Partition Problem."
Dror, Moshe, James B. Orlin and Michael Zhu. Discrete Mathematics, Algorithms and Applications Vol. 2, No. 2 (2010): 189-198."Provably Near-Optimal LP-Based Policies for Revenue Management of Reusable Resources."
Levi, Retsef, and Ana Radovanovic. Operations Research Vol. 58, No. 2 (2010): 503-507. Appendix."A Fully Polynomial Time Approximation Scheme for Single-Item Stochastic Lot-Sizing Problems with Discrete Demand."
Halman, Nir, Diego Klabjan, Mohamed Mostagir, James B. Orlin and David Simchi-Levi. Mathematics of Operations Research Vol. 34, No. 3 (2009): 674-685."Incremental Network Optimization: Theory & Algorithms."
Şeref, Onur, Ravindra K. Ahuja and James B. Orlin. Operations Research Vol. 57, No. 3 (2009): 586-594."Oblivious Routing of Highly Variable Traffic in Service Overlays and IP Backbones."
Kodialam, Murali T.V. Lakshman, James B. Orlin and Sudipta Sengupta. IEEE/ACM Transactions on Networking Vol. 17, No. 2 (2009): 459-472."Beyond Conjoint Analysis: Advances in Preference Measurement."
Netzer, Oded, Olivier Toubia, Eric T. Bradlow, Ely Dahan, Theodoros Evgeniou, Fred M. Feinberg, Eleanor M. Feit, Sam K. Hui, Joseph Johnson, John C. Liechty, James B. Orlin and Vithala R. Rao. Marketing Letters Vol. 19, No. 3-4 (2008): 337-354."The Locomotive Routing Problem."
Vaidyanathan, Balachandran, Ravindra K. Ahuja and James B. Orlin. Transportation Science Vol. 42, No. 4 (2008): 492-507."On ε-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization."
Orlin, James B., Andreas S. Schulz and Sudipta Sengupta. Discrete Optimization Vol. 5, No. 2 (2008): 550-561."Scale-invariant Clustering with Minimum Volume Ellipsoids."
Kumar, Mahesh and James B. Orlin. Computers and Operations Research Vol. 35, No. 4 (2008): 1017-1029."Scheduling Malleable Tasks with Interdependent Processing Rates: Comments and Observations."
Burke, Edmund K., Moshe Dror and James B. Orlin. Discrete Applied Mathematics Vol. 156, No. 5 (2008): 620-626."A Simple Method for Improving the Primal Simplex Method for the Multicommodity Flow Problem."
Bompadre, Agustín and James B. Orlin. Networks Vol. 51, No. 1 (2008): 63-77."Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets."
Dror, Moshe, and James B. Orlin. SIAM Journal on Discrete Mathematics Vol. 21, No. 4 (2007): 1019-1034."Probabilistic Analysis of Unit Demand Vehicle Routing Problems."
Bompadre, Agustín, Moshe Dror and James B. Orlin. Journal of Applied Probability Vol. 44, No. 1 (2007): 259-278."Exact and Heuristic Methods for the Weapon Target Assignment Problem."
Ahuja, Ravindra K., Arvind Kumar, Krishna C. Jha and James B. Orlin. Operations Research Vol. 55, No. 6 (2007): 1136-1146."Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem."
Ahuja, Ravindra K., Krishna C. Jha, James B. Orlin and Dushyant Sharma. INFORMS Journal of Computing Vol. 19, No. 4 (2007): 646-657."A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model."
Ahuja, R.K., Jon Goodstein, Amit Mukherjee, James B. Orlin and Dushyant Sharma. INFORMS Journal of Computing Vol. 19, No. 3 (2007): 416-428."Greedoid-Based Noncompensatory Inference."
Yee, Michael, Ely Dahan, John R. Hauser and James B. Orlin. Marketing Science Vol. 26, No. 4 (2007): 532-549."Pre-Configuring IP-over-Optical Networks to Handle Router Failures and Unpredictable Traffic."
Kodialam, Murali, T.V. Lakshman, James B. Orlin and Sudipta Sengupta. IEEE Journal on Selected Areas in Communication Vol. 25, No. 5 (2007): 934-948."Lexicographically Minimum and Maximum Load Linear Programming Problems."
Nace, Dritan and James B. Orlin. Operations Research Vol. 55, No. 1 (2007): 182-187."Improved Bounds for Vehicle Routing Solutions."
Bompadre, Agustín, Moshe Dror and James B. Orlin. Discrete Optimization Vol. 3, No. 4 (2006): 299-316."The TSP and the Sum of its Marginal Values."
Dror, Moshe, Yusin Lee, James B. Orlin and Valentin Polishchuk. International Journal of Computational Geometry and Applications Vol. 16, No. 4 (2006): 333-343."A Dynamic Programming Methodology in Very Large Scale Neighborhood Search Applied to the Traveling Salesman Problem."
Ergun, Özlem and James B. Orlin. Discrete Optimization Vol. 3, No. 1 (2006): 78-85."Creating Very Large Scale Neighborhoods out of Smaller Ones by Compounding Moves: A Study on the Vehicle Routing Problem."
Ergun, Özlem, James B. Orlin and Abran Steele-Feldman. Journal of Heuristics Vol. 12, No. 1-2 (2006): 1381-1231."Fast Neighborhood Search for the Single Machine Total Weighted Tardiness Problem."
Ergun, Özlem and James B. Orlin. Operations Research Letters Vol. 34, No. 1 (2006): 41-45."On the Sum-of-Squares Algorithm for Bin Packing."
Csirik, Janos, David S. Johnson, Claire Kenyon, James B. Orlin, Peter Shor and Richard R. Weber. Journal of the Association of Computing Machinery Vol. 53, No. 1 (2006): 1-65."Solving Real-Life Locomotive Scheduling Problems."
Ahuja, Ravindra K., Jian Liu, James B. Orlin, Dushyant Sharma and Larry A. Shughart. Transportation Science Vol. 39, No. 4 (2005): 503-517."Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs."
Ramaswamy, Ramkumar, James B. Orlin and Nilopal Chakravarti. Mathematical Programming Vol. 102, No. 2 (2005): 355-369."Approximate Local Search in Combinatorial Optimization."
Orlin, James B., Abraham P. Punnen, and Andreas S. Schulz. SIAM Journal on Computing Vol. 33, No. 5 (2004): 1201-1214."The Extended Neighborhood: Definition and Characterization."
Orlin, James B. and Dushyant Sharma. Mathematical Programming Vol. 101, No. 3 (2004): 537-559."A Neighborhood Search Algorithm for the Combined Through and Fleet Assignment Model with Time Windows."
Ahuja, Ravindra K., Jian Liu, James B. Orlin, Jon Goodstein and Amit Mukherjee. Network Vol. 44, No. 2 (2004): 160-171."A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem."
Ahuja, Ravindra K., Dorit S. Hochbaum and James B. Orlin. Algorithmica Vol. 39, No. 3 (2004): 189-208."A Multi-exchange Heuristic for the Single Source Capacitated Facility Location Problem."
Ahuja, Ravindra K., James B. Orlin, Steffano Pallottino, Maria Paola Scaparra and Maria Grazia Scutellá. Management Science Vol. 50, No. 6 (2004): 749-760."Dynamic Shortest Paths Minimizing Travel Times and Costs."
Ahuja, Ravindra K., James B. Orlin, Stefano Pallottino and Maria Grazia Scutellà. Networks Vol. 41, No. 4 (2003): 197-205."Solving the Convex Cost Integer Dual Network Flow Problem."
Ahuja, Ravindra K., Dorit S. Hochbaum and James B. Orlin. Management Science Vol. 49, No. 7 (2003): 950-964."A Composite Neighborhood Search Algorithm for the Capacitated Minimum Spanning Tree Problem."
Ahuja, Ravindra K., James B. Orlin, and Dushyant Sharma. Operations Research Letters Vol. 31, No. 3 (2003): 185-194."Combinatorial Algorithms for Inverse Network Flow Problems."
Ahuja, Ravindra K., and James B. Orlin. Networks Vol. 40, No. 4 (2002): 181-187."A Survey of Very Large Scale Neighborhood Search Techniques."
Ahuja, Ravindra K., Özlem Ergun, James B. Orlin and Abraham P. Punnen. Discrete Applied Mathematics Vol. 23, No. 1-3 (2002): 75-102."Minimum Time and Minimum Cost Path Problems in Street Networks with Periodic Traffic Lights."
Ahuja, Ravindra K., James B. Orlin, Steffano Pallotino, and Maria Grazia Scutella. Transportation Science Vol. 36, No. 3 (2002): 326-336."A Network Simplex Algorithm with O(n) Consecutive Degenerate Pivots."
Ahuja, Ravindra K., James B. Orlin, Prabha Sharma and P.T. Sokkalingam. Operations Research Letters Vol. 30, No. 3 (2002): 141-148."On Multi-Route Maximum Flows in Networks."
Aggarwal, Charu C. and James B. Orlin. Networks Vol. 39, No. 1 (2002): 43-52."Multi-exchange Neighborhood Search Algorithms for the Capacitated Minimum Spanning Tree Problem."
Ahuja, Ravindra K., James B. Orlin and Dushyant Sharma. Mathematical Programming Vol. 91, No. 1 (2001): 71-97."A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints."
Ahuja, Ravindra and James B. Orlin. Operations Research Vol. 49, No. 5 (2001): 784-789."Inverse Optimization."
Ahuja, Ravindra K. and James B. Orlin. Operations Research Vol. 49, No. 5 (2001): 771-783."New Polynomial-Time Cycle-Canceling Algorithms for Minimum Cost Flows."
Sokkalingam, P.T., Ravindra K. Ahuja and James B. Orlin. Networks Vol. 36, (2000): 53-63."Optimal Rounding of Fractional, Stationary, Dynamic Flows When Flows are Instantaneous."
Fleischer, Lisa, and James B. Orlin. SIAM Journal of Discrete Mathematics Vol. 13, No. 2 (2000): 145-153."A Greedy Genetic Algorithm for the Quadratic Assignment Problem."
Ahuja, Ravindra K., James B. Orlin and Ashish Tiwari. Computers and Operations Research Vol. 27, No. 10 (2000): 917-934."Very large scale neighborhood search."
Ahuja, Ravindra K., James B. Orlin and Dushyant Sharma. International Transactions in Operations Research Vol. 7, No. 4-5 (2000): 301-317."A Faster Algorithm for the Inverse Spanning Tree Problem."
Ahuja, Ravindra K. and James B. Orlin. Journal of Algorithms Vol. 34, No. 1 (2000): 177-193."Algorithms for the Simple Equal Flow Problem."
Ahuja, Ravindra K., James B. Orlin, Giovanni Sechi and Paola Zuddas. Management Science Vol. 45, No. 10 (1999): 1440-1455."Solving Inverse Spanning Tree Problems Through Network Flow Techniques."
Ahuja, Ravindra K., James B. Orlin, and P.T. Sokkalingam. Operations Research Vol. 47, No. 2 (1999): 291-300."Diagnosing Infeasibilities in Network Flow Problems."
Aggarwal, Charu C., Ravindra K. Ahuja, Jianxu Hao and James B. Orlin. Mathematical Programming Vol. 81, No. 3 (1998): 263-280."A Scaling Algorithm for Multicommodity Flow Problems."
Schneur, Rina R. and James B. Orlin. Operations Research Vol. 46, No. 2 (1998): 231-246."Arc Weighting in Hidden Bicircular Networks."
Shull, Randy, Alan Shuchat, James B. Orlin and Marianne L. Gardner. Congressus Numerantium Vol. 125, (1997): 161-171."Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem."
Golfarb, Donald, Zhiying Jin and James B. Orlin. Mathematics of Operations Research Vol. 22, No. 4 (1997): 793-802."A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows."
Orlin, James B. Mathematical Programming Vol. 78, No. 2 (1997): 109-129."Optimized Crossover for the Independent Set Problem."
Aggarwal, Charu C., James B. Orlin and Ray P. Tai. Operations Research Vol. 45, No. 2 (1997): 226-234."Computational Investigations of Maximum Flow Algorithms."
Ahuja, Ravindra K., Murali Kodialam, Ajay K. Mishra and James B. Orlin. European Journal of Operations Research Vol. 97, No. 3 (1997): 509-542."Equivalence of Primal and Dual Simplex Algorithms for the Maximum Flow Problem."
Ahuja, Ravindra K. and James B. Orlin. Operations Research Letters Vol. 20, No. 3 (1997): 101-108."A Parametric Worst Case Analysis for a Machine Scheduling Problem."
Mireault, Paul, James B. Orlin, and Rakesh V. Vohra. Operations Research Vol. 45, No. 1 (1997): 116-125."Use of Representative Operation Counts in Computational Testings of Algorithms."
Ahuja, Ravindra, K. and James B. Orlin. Informs Journal of Computing Vol. 8, No. 3 (1996): 318-330."An STS-based Map of the Human Genome."
Hudson, T. J., L. D. Stein, S. S. Gerety, A. B. Castle and James B. Orlin. Science Vol. 270, No. 5244 (1995): 1945-1954."A Capacity Scaling Algorithm for the Constrained Maximum Flow Problem."
Ahuja, Ravindra K. and James B. Orlin. Networks Vol. 25, No. 2 (1995): 89-98."Improved Algorithms for Bipartite Network Flow."
Ahuja, Ravindra K., James B. Orlin, Clifford Stein and Robert E. Tarjan. SIAM Journal of Computing Vol. 23, (1994): 906-933."A Faster Algorithm for Finding a Minimum Cut in a Graph."
Hao, Jianxu and James B. Orlin. Journal of Algorithms Vol. 17, No. 3 (1994): 424-446."A Technique for Speeding up the Solution of the Lagrangean Dual."
Bertsimas, Dimitris and James B. Orlin. Mathematical Programming Vol. 63, No. 1 (1994): 23-46."Parallel Algorithms for the Assignment and Minimum Cost Flow Problems."
Orlin, James B. and Clifford Stein. Operations Research Letters Vol. 14, No. 4 (1993): 181-186."Finding Minimum Cost to Time Ratio Cycles with Small Integral Transit Times."
Hartmann, Mark and James B. Orlin. Networks Vol. 23, No. 6 (1993): 567-574."Polynomial Dual Network Simplex Algorithms."
Orlin, James B., Serge A. Plotkin and Éva Tardos. Mathematical Programming Vol. 60, No. 1-3 (1993): 255-276."A Faster Strongly Polynomial Algorithm for the Minimum Cost Flow Problem."
Orlin, James B. Operations Research Vol. 41, No. 2 (1993): 338-350."Determination of Optimal Vertices from Feasible Solutions in Unimodular Linear Programming."
Mizuno, Shinji, Romesh Saigal and James B. Orlin. Mathematical Programming Vol. 59, No. 1-3 (1993): 23-32."Recognizing Hidden Bicircular Networks."
Shull, Randy, Alan H. Shuchat, James B. Orlin and Marianne L. Gardner. Discrete Applied Mathematics Vol. 41, No. 1 (1993): 13-53."New Scaling Algorithms for the Assignment and Minimum Cycle Mean Problems."
Orlin, James B. and Robert K. Ahuja. Mathematical Vol. 54, No. 1-3 (1992): 41-56."Finding Minimum-Cost Flows by Double Scaling."
Ahuja, Ravindra K., Andrew V. Goldberg, James B. Orlin and Robert E. Tarjan. Mathematical Programming Vol. 53, No. 1-3 (1992): 243-266."Single Transferable Vote Resists Strategic Voting."
Bartholdi III, John J. and James B. Orlin. Social Choice and Welfare Vol. 8, No. 4 (1991): 341-354."Distance-Directed Algorithms for Maximum Flow and Parametric Maximum Flow Problems."
Ahuja, Ravindra K. and James B. Orlin. Naval Research Logistics Vol. 38, No. 3 (1991): 413-430."Recent Advances in Network Flows."
Ahuja, Ravindra K., Thomas L. Magnanti and James B. Orlin. Siam Review Vol. 33, No. 2 (1991): 175-219."Faster Parametric Shortest Path and Minimum Balance Algorithms."
Young, Neal E., Robert E. Tarjan and James B. Orlin. Networks Vol. 21, No. 2 (1991): 205-221."Solving the Linear Matroid Parity Problem as a Sequence of Matroid Intersection Problems."
Orlin, James B. and John H. Vande Vate. Mathematical Programming Vol. 47, No. 1-3 (1990): 81-106."Faster Algorithms for the Shortest Path Problem."
Ahuja, Ravindra K., Kurt Mehlhorn, James B. Orlin and Robert E. Tarjan. Journal of the Association of Computing Machinery Vol. 37, No. 2 (1990): 213-223."A Fast and Simple Algorithm for the Maximum Flow Problem."
Ahuja, Ravindra K. and James B. Orlin. Operations Research Vol. 37, No. 5 (1989): 748-759."Improved Time Bounds for the Maximum Flow Problem."
Ahuja, Ravindra K., James B. Orlin and Robert E. Tarjan. SIAM Journal of Computing Vol. 18, No. 5 (1989): 939-954."The Structure of Bases in Bicircular Matroids."
Shull, Randy, James B. Orlin, Alan H. Shuchat and Marianne L. Gardner. Discrete Applied Mathematics Vol. 23, No. 3 (1989): 267-283."Parametric Linear Programming and Anti-Cycling Pivoting Rules."
Magnanti, Thomas L. and James B. Orlin. Mathematical Programming Vol. 41, No. 1-3 (1988): 317-325."A Dual Version of Tardos's Algorithm for Linear Programming."
Orlin, James B. Operations Research Letters Vol. 5, No. 5 (1986): 221-226."On the Simplex Algorithm for Networks and Generalized Networks."
Orlin, James B. Mathematical Programming Study Vol. 24, (1985): 166-178."On the Complexity of Four Polyhedral Set containment Problems."
Freund, Robert M., and James B. Orlin. Mathematical Programming Vol. 33, No. 2 (1985): 133-135."Some Very Easy Knapsack/Partition Problems."
Orlin, James B. Operations Research Vol. 33, No. 5 (1985): 1154-1160."Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Grouping for Joint Replenishment."
Chakravarty, A. K., James B. Orlin and Uriel G. Rothblum. Operations Research Vol. 33, No. 4 (1985): 820-832."A Finitely Converging Cutting Plane Technique."
Orlin, James B. Operations Research Letters Vol. 4, No. 1 (1985): 1-4."Computing Optimal Scalings by Parametric Network Algorithms."
Orlin, James B, and Uriel G. Rothblum. Mathematical Programming Vol. 32, No. 1 (1985): 1-10."A Minimum Concave-Cost Dynamic Network Flow Problem with an Application to Lot-Sizing."
Graves, Stephen C. and James B. Orlin. Networks Vol. 15, No. 1 (1985): 59-71."NP-completeness for Minimizing Maximum Edge Length in Grid Embeddings."
Miller, Zevi and James B. Orlin. Journal of Algorithms Vol. 6, No. 1 (1985): 10-16."Minimum Convex Cost Dynamic Network Flows."
Orlin, James B. Mathematics of Operations Research Vol. 9, No. 2 (1984): 190-207."Dynamic Matchings and Quasidynamic Fractional Matchings I."
Orlin, James B. Networks Vol. 13, No. 4 (1983): 551-562."Dynamic Matchings and Quasidynamic Fractional Matchings II."
Orlin, James B. Networks Vol. 13, No. 4 (1983): 563-580."Maximum Throughput Dynamic Network Flows."
Orlin, James B. Mathematical Programming Vol. 27, No. 2 (1983): 214-223."A Polynomial Algorithm for Integer Programming Covering Problems Satisfying the Integer Round-up Property."
Orlin, James B. Mathematical Programming Vol. 22, No. 1 (1982): 231-235."A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Grouping for Joint Replenishment."
Chakravarty, A. K., James B. Orlin and Uriel G. Rothblum. Operations Research Vol. 30, No. 5 (1982): 1018-1022."Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets."
Orlin, James B. Operations Research Vol. 30, No. 4 (1982): 760-776."An O(n2) Algorithm for Coloring Proper Circular Arc Graphs."
Orlin, James B., Maurizio A. Bonuccelli and Daniel P. Bovet. SIAM Journal on Algebraic and Discrete Methods Vol. 2, No. 2 (1981): 88-93."Parametric Shortest Path Algorithms with an Application to Cyclic Staffing."
Karp, Richard M. and James B. Orlin. Discrete Applied Mathematics Vol. 3, No. 1 (1981): 37-45."Cyclic Scheduling via Integer Programs with Circular Ones."
Bartholdi III, John J., James B. Orlin and H. Donald Ratliff. Operations Research Vol. 28, No. 5 (1980): 1074-1085."Line-digraphs, Arborescences, and theorems of Tutte and Knuth."
Orlin, James B. Journal of Combinatorial Theory, Series B Vol. 25, No. 2 (1978): 187-198."Contentment in Graph Theory: Covering Graphs with Cliques."
Orlin, James B. Indigationes Mathematicae Vol. 80, No. 5 (1977): 406-424."The Minimal Integral Separator of a Threshold Graph."
Orlin, James B. Annals of Discrete Mathematics Vol. 1, (1977): 415-419.
"Robust Optimization with Incremental Recourse."
Nasrabadi, Ebrahim, and James B. Orlin, Working Paper. 2014.
Network Flows: Theory, Algorithms, and Applications.
Ahuja, Ravindra K., Thomas Magnanti, and James B. Orlin. Englewood Cliffs, NJ: Prentice Hall, 1993.
"Directed Shortest Paths via Approximate Cost Balancing."
James B. Orlin and László A. Végh. In Proceedings of the 2021 Symposium on Discrete Algorithms, Alexandria, VA: Forthcoming."Distributionally Robust Max Flows."
Louis L. Chen, Will Ma, James B. Orlin, and David Simchi-Levi. In SIAM Symposium on Simplicity in Algorithms, edited by Inge Li Gørtz and Martin Farach-Colton. 2020."Maximum Flows."
Orlin, James B., and Ravindra K. Ahuja. In Handbook of Discrete and Combinatorial Mathematics, edited by Kenneth H. Rosen, 759-768. Boca Raton, FL: CRC Press, 2018."Minimum Cost Flows."
Orlin, James B., and Ravindra K. Ahuja. In Handbook of Discrete and Combinatorial Mathematics, edited by Kenneth H. Rosen, 769-778. Boca Raton, FL: CRC Press, 2018."Minimum Spanning Trees."
Orlin, James B, and Ravindra K. Ahuja. In Handbook of Discrete and Combinatorial Mathematics, edited by Kenneth H. Rosen, 726-732. Boca Raton, FL: CRC Press, 2018."Shortest Paths."
Orlin, James B., and Ravindra K. Ahuja. In Handbook of Discrete and Combinatorial Mathematics, edited by Kenneth H. Rosen, 748-758. Boca Raton, FL: CRC Press, 2018."An O(nm) Time Algorithm for Finding the Min Length Directed Cycle in a Graph."
James B. Orlin and Antonio Sedeño-Noda. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms, edited by Philip N. Klein. Barcelona, Spain: January 2017."Robust Monotone Submodular Function Maximization."
Rajan Udwani, Andreas Schulz, and James B. Orlin. In Proceedings of the The 18th Conference on Integer Programming and Combinatorial Optimization (IPCO XVIII), Liège, Belgium: June 2016."Max Flows in O(nm) Time or Better."
James B. Orlin. In STOC '13 Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing, New York, NY: June 2013."D. Ray Fulkerson."
Bland, Robert G. and James B. Orlin. In Profiles in Operations Research, 509-527. New York, NY: Springer Science, 2011."Improved Algorithms for Computing Fisher's Market Clearing Prices."
James B. Orlin. In Proceedings of the 2010 Symposium on the Theory of Computing., New York, NY: June 2010."A Simple Combinatorial Algorithm for Submodular Function Minimization."
Satoru Iwata and James B. Orlin. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, edited by Claire Mathieu. Philadelphia, PA: December 2009."Integer Programming: Optimization and Evaluation Are Equivalent."
James B. Orlin, Abraham P. Punnen and Andreas S. Schulz. In Proceedings of the 11th International Symposium on Algorithms and Data Structures, edited by C.D. Tóth, F. Dehne, J.-R. Sack, and M. Gavrilova. Berlin, Germany: August 2009."Exact and Heuristic Methods for the Weapon Target Assignment Problem."
Ahuja, Ravindra K., Jon Goodstein, Jian Liu, Amit Mukherjee, James B. Orlin and Dushyant Sharma. In Handbook of Military Industrial Engineering, 7-8. Boca Raton, Florida: CRC Press, 2009."A Fast, Simpler Algorithm for the Matroid Parity Problem."
James B. Orlin. In Integer Programming and Combinatorial Optimization: 13th International Conference, IPCO 2008, edited by Alessandro Panconesi, Andrea Lodi, and Giovanni Rinaldi. Berlin, Germany: May 2008."Very Large Scale Neighborhood Search Techniques in Timetabling Problems."
Carol Myers and James B. Orlin. In Proceedings of Practice and Theory of Automated Timetabling VI, edited by Edmund K. Burke and Hana Rudová. Berlin, Germany: September 2007."A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization."
James B. Orlin. In Integer Programming and Combinatorial Optimization: Proceedings of the 12th International IPCO Conference. Lecture Notes in Computer Science, edited by David P. Williamson and Matteo Fischetti. Berlin, Germany: June 2007."Very Large-Scale Neighborhood Search: Theory, Algorithms and Applications."
Ahuja, Ravindra K., Özlem Ergun, James B. Orlin and Abraham P. Punnen. In Handbook of Approximation Algorithms and Metaheuristics, edited by Teofilo F. Gonzalez , 20-21. Boca Raton, Florida: Chapman & Hall, 2007."A Versatile Scheme for Routing Highly Variable Traffic in Service Overlays and IP Backbones."
M. Kodialam, T.V. Lakshman, James B. Orlin and Sudipta Sengupta. In INFOCOM 2006 25th IEEE International Conference on Computer Communications, New York, NY: April 2006."Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems."
Agustin Bompadre and James B. Orlin. In Proceedings of the 11th International IPCO Conference, edited by Michael Jünger and Volker Kaibel. Berlin, Germany: June 2005."Solving Multi-Criteria Combined Through Fleet Assignment Models."
Ahuja, Ravindra K., Jian Liu, Jon Goodstein, Amit Mukherjee, James B. Orlin and Dushyant Sharma. In Operations Research in Space and Air, 233-256. New York, NY: Springer US, 2003."Branch and Bound Algorithms for the Test Cover Problem."
Koen M. J. De Bontridder, B. J. Lageweg, Jan K. Lenstra, James B. Orlin and Leen Stougie. In Proceedings of the 10th Annual European Symposium on Algorithms (ESA), edited by Rajeev Raman and Rolf Möhring. Berlin, Germany: September 2002."Applications of Network Optimization."
Ahuja, Ravindra K., Thomas L. Magnanti, James B. Orlin, and M.R. Reddy. In Handbooks in Operations Research and Management Science, Volume 7: Network Models, 1-84. Amsterdam, The Netherlands: Elsevier, North Holland, 1995."On Very Large Scale Assignment Problems."
Hager, William W., D. W. Hearn and Panos M. Pardalos. In Large Scale Optimization: State of the Art, 206-244. Dordrecht, The Netherlands: Kluwer Academic Publishers, 1994."A Technique for Speeding up the Solution of the Lagrangean Dual."
Dimitris Bertsimas, and James B. Orlin. In Proceedings of the Second Conference on Integer Programming and Combinatorial Optimization, edited by Egon Balas, Gerard Cornujelos, and Rajgopal Kannan. Pittsburgh, PA: May 1992."Network Flows."
Ahuja, Ravindra K., Thomas L. Magnanti and James B. Orlin. In Handbooks in Operations Research and Management Science, Volume 1: Optimization, 211-369. Amsterdam, The Netherlands: North Holland, 1989."Algorithms for Problems on Dynamic/Periodic Graphs."
Orlin, James B. In Progress in Combinatorial Optimization, edited by William Pulleyblank , 273-294. Toronto, Canada: Academic Press, 1984."Dynamic Network Flows."
Orlin, Jim B. PhD diss., Stanford University, 1981."The Complexity of Dynamic Languages and Dynamic Optimization Problems."
James B. Orlin. In STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing, New York, NY: May 1981.