James Orlin

E. Pennell Brooks (1917) Professor in Management
Professor of Operations Research

Biography | Selected Publications

“Fast Algorithms for Convex Cost Flow Problems on Circles, Lines, and Trees.” Orlin, James B., and Balachandran Vaidyanathan (December 2013). Networks, 62(4), 288-296.

“On the hardness of finding subsets with equal average.” Elkind, Edith, and James B. Orlin (July 2013). Information Processing Letters, 113(13): 477–480.

“Simplifications and speedups of the pseudoflow algorithm.” Hochbaum, Dorit S., and James B. Orlin (January 2013). Networks, 61(1): 40-57.

“A Computationally Fast FPTAS for Convex Stochastic Dynamic Programs.” ​Halman, Nir, Giacamo Nannicini, and James B. Orlin. Proceedings of the European Symposium on Algorithms, 2013, 577-588.

“Max flows in O(nm) time or better.” Orlin, James B. Proceedings of the 2013 Symposium on the Theory of Computing.  765-774.

“A Simple Approximation Algorithm for Computing Arrow-Debreu Prices.” Ghiyasvand, Mehdi, and James B. Orlin (2012). Operations Research, 60(5): 1245-1248. (2012)

"Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-sizing Problems When Data Is Given By an Oracle." Halman, Nir, James B. Orlin, David Simchi-Levi (2012). Operations Research, 60(2): 429-446. (2012)

“Complexity Results for Equistable Graphs and Related Classes.” ​Milanič, Martin, James B. Orlin, and Gábor Rudolf (August 2011). Annals of Operations Research 188(1): 359-370.

"End-to-end restorable oblivious routing of hose model traffic." Kodialam, Muralidharan S., T. V. Lakshman, James B. Orlin, and Sudipta Sengupta (August 2011). IEEE/ACM Transactions on Networking, 19(4): 1223-1236.

“Adaptive Data-Driven Inventory Control Policies Based on Kaplan-Meir Estimator.” Huh, Woonghee Tim, Retsef Levi, Paat Rusmevichientong, and James B. Orlin (2011). Operations Research, 59(4): 929–941. (2011)

“D. Ray Fulkerson.” ​Bland, Robert G., and James B. Orlin. In Assad, Arjang A., and Saul I. Gass (eds.), Profiles in Operations Research. International Series in Operations Research & Management Science, 147. Springer Science (2011), 509-527. (2011)

“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 (June 2010). Journal of Discrete Algorithms 8(2): 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 (June 2010). Discrete Mathematics, Algorithms and Applications, 2(2): 189-198.

“Improved Algorithms for Computing Fisher's Market Clearing Prices." Orlin, James B. Proceedings of the 2010 Symposium on the Theory of Computing.

“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 (August 2009). Mathematics of Operations Research, 34(3): 674-685.

“Oblivious routing of highly variable traffic in service overlays and IP backbones.” ​Kodialam, Murali, T.V. Lakshman, James B. Orlin, and Sudipta Sengupta (April 2009). IEEE/ACM Transactions on Networking, 17(2): 459-472.

“A Simple Combinatorial Algorithm for Submodular Function Minimization.” Iwata, Satoru, and James B. Orlin. Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009, 1230-1237.

“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 Badiru, Adedeji B., and Marlin U. Thomas (eds.), Handbook of Military Industrial Engineering. CRC Press, 2009.

“Incremental Network Optimization: Theory & Algorithms.” ​Şeref, Onur, Ravindra K. Ahuja, and James B. Orlin (2009). Operations Research, 57(3): 586-594. (2009)

“Integer programming: optimization and evaluation are equivalent.” Orlin, James B., Abraham P. Punnen, and Andreas S. Schulz, in F. Dehne, M. Gavrilova, J.-R. Sack, and C.D. Tóth (eds.): Proceedings of the 11th International Symposium on Algorithms and Data Structures, Lecture Notes in Computer Science 5664, 2009, 519-529.  (2009)

“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 (December 2008). Marketing Letters, 19(3-4): 337-354.

“The Locomotive Routing Problem.” Vaidyanathan, Balachandran, Ravindra K. Ahuja, and James B. Orlin (November 2008). Transportation Science, 42(4): 492-507.

“On ε-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization.” Orlin, James B. Andreas S. Schulz, and Sudipta Sengupta (May 2008). Discrete Optimization, 5(2): 550-561.

"Scale-invariant Clustering with Minimum Volume Ellipsoids." ​Kumar, Mahesh, and James B. Orlin (April 2008). Computers and Operations Research, 35(4): 1017-1029.

“Scheduling Malleable Tasks with Interdependent Processing Rates: Comments and Observations.” Burke, Edmund K., Moshe Dror, and James B. Orlin (2008). Discrete Applied Mathematics, 156(5): 620-626. (2008)

“A Simple Method for Improving the Primal Simplex Method for the Multicommodity Flow Problem." Bompadre, Agustín, and James B. Orlin (January 2008). Networks, 51(1): 63-77.

“A Fast, Simpler Algorithm for the Matroid Parity Problem.”  Orlin, James B.  Proceedings of the 2008 IPCO conference, Bertolini, Italy.

“Exact and Heuristic Methods for the Weapon Target Assignment Problem.” ​Ahuja, Ravindra K., Arvind Kumar, Krishna C. Jha, and James B. Orlin (November 2007). Operations Research, 55(6): 1136–1146.

“Greedoid-Based Noncompensatory Inference.” ​Yee, Michael, Ely Dahan, John R. Hauser, and James B. Orlin (July/August 2007). Marketing Science, 26(4): 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 (June 2007). IEEE Journal on Selected Areas in Communication, 25(5): 934-948.

“A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization.” Orlin, James B. In Integer Programming and Combinatorial Optimization: Proceedings of the 12th International IPCO ConferenceLecture Notes in Computer Science, 4513: 240-251. Berlin: Springer Verlag, 2007. (2007)

“A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model.” ​Ahuja, Ravindra K., Jon Goodstein, Amit Mukherjee, James B. Orlin, and Dushyant Sharma (2007). INFORMS Journal of Computing, 19(3): 416-428. (2007)

“Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets.” Dror, Moshe, and James B. Orlin (2007). SIAM Journal on Discrete Mathematics, 21(4): 1019-1034. (2007)

“Lexicographically Minimum and Maximum Load Linear Programming Problems.” ​Nace, Dritan, and James B. Orlin (2007). Operations Research, 55(1) 182-187. (2007)

“Probabilistic Analysis of Unit Demand Vehicle Routing Problems.” ​Bompadre, Agustín, Moshe Dror, and James B. Orlin (2007). Journal of Applied Probability, 44: 259-278. (2007)

“Very Large Scale Neighborhood Search Techniques in Timetabling Problems.” Myers, Carol, and James B. Orlin (2007). In Burke, E.K. and H. Rudová (eds.): Proceedings of Practice and Theory of Automated Timetabling VI 2006Lecture Notes in Computer Science, 3867: 24–39. Springer-Verlag Berlin Heidelberg, 2007.

"Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem." ​Ahuja, Ravindra K., Krishna C. Jha, James B. Orlin, and Dushyant Sharma (Fall 2007). INFORMS Journal of Computing, 19(4): 646-657.

“Improved Bounds for Vehicle Routing Solutions.” Bompadre, Agustín, Moshe Dror, and James B. Orlin (December 2006). Discrete Optimization, 3(4): 299-316.

"The TSP and the Sum of its Marginal Values." ​Dror, Moshe, Yusin Lee, James B. Orlin, and Valentin Polishchuk (August 2006). International Journal of Computational Geometry and Applications 16(4): 333-343.

“A Dynamic Programming Methodology in Very Large Scale Neighborhood Search Applied to the Traveling Salesman Problem.” ​Ergun, Özlem, and James B. Orlin (March 2006). Discrete Optimization 3(1): 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 (March 2006). Journal of Heuristics, 12(1-2): 1381-1231.

"Fast Neighborhood Search for the Single Machine Total Weighted Tardiness Problem." ​Ergun, Özlem, and James B. Orlin (January 2006). Operations Research Letters, 34(1): 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 (January 2006). Journal of the Association of Computing Machinery, 53(1) 1-65.

“A Versatile Scheme for Routing Highly Variable Traffic in Service Overlays and IP Backbones.” ​Kodialam, M., T.V. Lakshman, James B. Orlin, and Sudipta Sengupta.  Proceedings of the INFOCOM 2006 25th IEEE International Conference on Computer Communications, 2006, 1-12.

“Very large-scale neighborhood search: Theory, algorithms and applications.” ​Ahuja, Ravindra K., Özlem Ergun, James B. Orlin and Abraham P. Punnen. In Gonzalez, Teofilo F. (ed.), Handbook of Approximation Algorithms and Metaheuristics. Chapman & Hall: Crc Computer & Information Science Series, 2006.

"Solving Real-Life Locomotive Scheduling Problems." Ahuja, Ravindra K., Jian Liu, James B. Orlin, Dushyant Sharma, and Larry A. Shughart (2005). Transportation Science, 39(4): 503-517. (2005)

"Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs." ​Ramaswamy, Ramkumar, James B. Orlin, and Nilopal Chakravarti (2005). Mathematical Programming, 102: 355-369. (2005)

“Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems.” ​Bompadre, Agustin, and James B. Orlin. Proceedings of the 11th International IPCO Conference, Berlin, Germany, 2005, 437-451.

"The Extended Neighborhood: Definition and Characterization." ​Orlin, James B., and Dushyant Sharma (December 2004). Mathematical Programming, 101(3): 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, Amit Mukherjee (September 2004). Networks, 44(2) 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 (2004). Algorithmica, 39(3): 189-208. (2004)

"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á (2004). Management Science, 50(6): 749-760. (2004)

“Approximate Local Search in Combinatorial Optimization.” ​Orlin, James B., Abraham P. Punnen, and Andreas S. Schulz (2004). SIAM Journal on Computing, 33(5): 1201-1214. (2004)

"Dynamic Shortest Paths Minimizing Travel Times and Costs." Ahuja, Ravindra K., James B. Orlin, Stefano Pallottino, and Maria Grazia Scutellà (July 2003). Networks, 41(4): 197-205.

"Solving the Convex Cost Integer Dual Network Flow Problem." ​Ahuja, Ravindra K., Dorit S. Hochbaum, and James B. Orlin (July 2003). Management Science, 49(7): 950-964.

"A Composite Neighborhood Search Algorithm for the Capacitated Minimum Spanning Tree Problem." ​Ahuja, Ravindra K., James B. Orlin, and Dushyant Sharma (2003). Operations Research Letters, 31: 185-194. (2003)

"Solving Multi-Criteria Combined Through Fleet Assignment Models." Ahuja, Ravindra K., Jian Liu, Jon Goodstein, Amit Mukherjee, James B. Orlin, and Dushyant Sharma. Chapter 13 in Ciriani, Tito A., Georgio Fasano, Stefano Gliozzi, and Roberto Tadei (eds.), Operations Research in Space and Air. Kluwer Academic Publishers, 2003, 233-256.

"Combinatorial Algorithms for Inverse Network Flow Problems." ​Ahuja, Ravindra K., and James B. Orlin (2002). Networks, 40(4): 181-187. (2002)

"A Survey of Very Large Scale Neighborhood Search Techniques." ​Ahuja, Ravindra K., Özlem Ergun, James B. Orlin, and Abraham P. Punnen (November 2002). Discrete Applied Mathematics, 23(1-3): 75-102.

"A Network Simplex Algorithm with O(n) Consecutive Degenerate Pivots." ​Ahuja, Ravindra K., James B. Orlin, Prabha Sharma, and P.T. Sokkalingam (June 2002). Operations Research Letters, 30(3): 141-148.

"On Multi-Route Maximum Flows in Networks." ​Aggarwal, Charu C., and James B. Orlin (January 2002). Networks, 39(1): 43-52.

"Branch and Bound Algorithms for the Test Cover Problem." ​De Bontridder, Koen M.J., B. J. Lageweg, Jan K. Lenstra, James B. Orlin,  and Leen Stougie. Extended abstract in Proceedings of the 10th Annual European Symposium on Algorithms (ESA), 2002, 223—233.

"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 (2002). Transportation Science, 36(3): 326-336. (2002)

"A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints." Ahuja, Ravindra K., and James B. Orlin (September/October 2001). Operations Research, 49(5): 784-789

"Inverse Optimization, Part I: Linear Programming and General Problem." ​Ahuja, Ravindra K., and James B. Orlin (September/October 2001). Operations Research, 49(5): 771-783.

“Multi-exchange Neighborhood Search Algorithms for the Capacitated Minimum Spanning Tree Problem." Ahuja, Ravindra K., James B. Orlin and Dushyant Sharma (2001). Mathematical Programming, 91: 71-97 (2001)

“A Greedy Genetic Algorithm for the Quadratic Assignment Problem.” Ahuja, Ravindra K., James B. Orlin, and Ashish Tiwari (2000). Computers and Operations Research, 27(10): 917-934. (2000)

"A Faster Algorithm for the Inverse Spanning Tree Problem." ​Ahuja, Ravindra K., and James B. Orlin (2000). Journal of Algorithms, 34(1): 177-193. (2000)

“New Polynomial-Time Cycle-Canceling Algorithms for Minimum Cost Flows.” ​Sokkalingam, P.T., Ravindra K. Ahuja, James B. Orlin (2000). Networks, 36: 53-63. (2000)

“Optimal Rounding of Fractional, Stationary, Dynamic Flows When Flows are Instantaneous.” ​Fleischer, Lisa, and James B. Orlin (2000). SIAM Journal of Discrete Mathematics, 13(2): 145-153. (2000)

"Very large scale neighborhood search." Ahuja, Ravindra K., James B. Orlin, and Dushyant Sharma (2000). International Transactions in Operations Research, 7: 301-317. (2000)

"Solving inverse spanning tree problems through network flow techniques." Ahuja, Ravindra K., James B. Orlin, and P.T. Sokkalingam (April 1999). Operations Research, 47: 291-300.

"Algorithms for the Simple Equal Flow Problem." ​Ahuja, Ravindra K., James B. Orlin, Giovanni Sechi, and Paola Zuddas (1999). Management Science, 45(10): 1440-1455. (1999)

"Diagnosing Infeasibilities in Network Flow Problems." ​Aggarwal, Charu C., Ravindra K. Ahuja, Jianxu Hao, and James B. Orlin (May 1998). Mathematical Programming, 81(3): 263-280.

"A Scaling Algorithm for Multicommodity Flow Problems." ​Schneur, Rina R., and James B. Orlin (1998). Operations Research, 46(2): 231-246. (1998)

“Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem.” ​Golfarb, Donald, Zhiying Jin, and James B. Orlin (November 1997). Mathematics of Operations Research, 22(4): 793-802.

"A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows." Orlin, James B. (1997). Mathematical Programming, 78(2): 109-129. (1997)

"Computational Investigations of Maximum Flow Algorithms." ​Ahuja, Ravindra K., Murali Kodialam, Ajay K. Mishra, and James B. Orlin (March 1997). European Journal of Operations Research, 97(3): 509-542.

“Equivalence of Primal and Dual Simplex Algorithms for the Maximum Flow Problem.” Ahuja, Ravindra K., and James B. Orlin (March 1997). Operations Research Letters, 20(3): 101-108.

"A Parametric Worst Case Analysis for a Machine Scheduling Problem." ​Mireault, Paul, James B. Orlin, and Rakesh V. Vohra (1997). Operations Research, 45(1): 116-125. (1997)

"Arc Weighting in Hidden Bicircular Networks." Shull, Randy, Alan Shuchat, James B. Orlin and Marianne L. Gardner (1997). Congressus Numerantium, 125: 161-171. (1997)

"Optimized Crossover for the Independent Set Problem." ​Aggarwal, Charu C., James B. Orlin, and Ray P. Tai (1997). Operations Research, 45(2): 226-234. (1997)

"Use of Representative Operation Counts in Computational Testings of Algorithms." ​Ahuja, Ravindra, K., James B. Orlin (1996). Informs Journal of Computing, 8(3): 318-330. (1996)

"A Capacity Scaling Algorithm for the Constrained Maximum Flow Problem." Ahuja, ​Ravindra K., and James B. Orlin (March 1995). Networks, 25(2): 89-98.

"An STS-based map of the human genome." ​Hudson, T.J., L.D. Stein, S.S. Gerety, A.B. Castle, J.B. Orlin et al. (1995). Science, 270: 1945-1954. (1995)

"Applications of Network Optimization." ​Ahuja, Ravindra K., Thomas L. Magnanti, James B. Orlin, and M.R. Reddy. Chapter 1 in Ball, M. O., Thomas L. Magnanti, C. L. Monma, and G.L. Nemhauser (eds.), the Handbooks in Operations Research and Management Science, Volume 7: Network Models. Elsevier, North Holland, 1995. 1-84.

"A Faster Algorithm for Finding a Minimum Cut in a Graph." ​Hao, Jianxu, and James B. Orlin (November 1994). Journal of Algorithms 17(3): 424-446.

"A Technique for Speeding up the Solution of the Lagrangian Dual." ​Bertsimas, Dimitris, and James B. Orlin (January 1994). Mathematical Programming, 63(1): 23-46.

"Improved Algorithms for Bipartite Network Flow." ​Ahuja, Ravindra K., James B. Orlin, Clifford Stein, and Robert E. Tarjan (1994). SIAM Journal of Computing, 23: 906-933. (1994)

"On Very Large Scale Assignment Problems." ​Lee, Yusin, and James B. Orlin. In Hager, William W., D. W. Hearn, and Panos M. Pardalos (eds.), Large Scale Optimization: State of the Art. Dordrecht, The Netherlands: Kluwer Academic Publishers, 1994, 206-244.

"Parallel Algorithms for the Assignment and Minimum Cost Flow Problems." ​Orlin, James B. and Clifford Stein (November 1993). Operations Research Letters, 14(4): 181-186.

"Finding Minimum Cost to Time Ratio Cycles with Small Integral Transit Times." ​Hartmann, Mark, and James B. Orlin (September 1993). Networks, 23(6): 567-574.

"Polynomial Dual Network Simplex Algorithms." ​Orlin, James B., Serge A. Plotkin, and Éva Tardos (June 1993). Mathematical Programming, 60(1-3): 255-276.

"A Faster Strongly Polynomial Algorithm for the Minimum Cost Flow Problem.” Orlin, James B. (March/April 1993). Operations Research, 41(2): 338-350.

"Determination of Optimal Vertices from Feasible Solutions in Unimodular Linear Programming." ​Mizuno, Shinji, Romesh Saigal, and James B. Orlin (March 1993). Mathematical Programming, 59(1-3): 23-32.

"Recognizing Hidden Bicircular Networks." ​Shull, Randy, Alan H. Shuchat, James B. Orlin, and Marianne L. Gardner (January 1993). Discrete Applied Mathematics, 41(1): 13-53.

Network Flows: Theory, Algorithms, and Applications. Ahuja, Ravindra K., Thomas L. Magnanti, and James B. Orlin. Englewood Cliffs, N.J.: Prentice Hall, 1993.

"New Scaling Algorithms for the Assignment and Minimum Cycle Mean Problems." ​Orlin, James B., and Robert K. Ahuja (February 1992). Mathematical Programming, 54(1-3): 41-56.

"The Scaling Network Simplex Algorithm." Ahuja, Robert K., and James B. Orlin (February 1992). Operations Research, 40, Supplement 1, S5-S13.

"Finding Minimum-Cost Flows by Double Scaling." ​Ahuja, Ravindra K., Andrew V. Goldberg, James B. Orlin, and Robert E. Tarjan (January 1992). Mathematical Programming, 53(1-3), 243-266.

"Single Transferable Vote Resists Strategic Voting." Bartholdi III, John J., and James B. Orlin (October 1991). Social Choice and Welfare, 8(4): 341-354.

"Distance-Directed Algorithms for Maximum Flow and Parametric Maximum Flow Problems.” ​Ahuja, Ravindra K., and James B. Orlin (June 1990). Naval Research Logistics, 38(3): 413-430. (1991)

"Recent Advances in Network Flows." ​Ahuja, Ravindra K., Thomas L. Magnanti, and James B. Orlin (1991). Siam Review, 33(2): 175-219. (1991)

"Faster Parametric Shortest Path and Minimum Balance Algorithms." ​Young, Neal E., Robert E. Tarjan, James B. Orlin (March 1991). Networks, 21(2): 205-221.

"Solving the Linear Matroid Parity Problem as a Sequence of Matroid Intersection Problems.” Orlin, James B., and John H. Vande Vate (May 1990). Mathematical Programming, 47(1-3): 81-106.

"Faster Algorithms for the Shortest Path Problem." ​Ahuja, Ravindra K., Kurt Mehlhorn, James B. Orlin, and Robert E. Tarjan (April 1990). Journal of the Association of Computing Machinery 37(2): 213-223.

Single Transferable Vote Resists Strategic Voting (1990)

"Improved Time Bounds for the Maximum Flow Problem." ​Ahuja, Ravindra K., James B. Orlin, and Robert E. Tarjan (October 1989). SIAM Journal of Computing, 18(5), 939-954.

"The Structure of Bases in Bicircular Matroids." ​Shull, Randy, James B. Orlin, Alan H. Shuchat, and Marianne L. Gardner (1989). Discrete Applied Mathematics, 23(3): 267-283. (1989)

"A Fast and Simple Algorithm for the Maximum Flow Problem." Ahuja, Ravindra K., and James B. Orlin (1989). Operations Research, 37(5): 748-759. (1989)

"Network Flows." ​Ahuja, Ravindra K., Thomas L. Magnanti, and James B. Orlin. Chapter IV in Nemhauser, George L., A.H.G. Rinnooy Kan, and Michael J. Todd (eds.), the Handbooks in Operations Research and Management Science, Volume 1: Optimization. North Holland, 1989, 211-369.

"Parametric Linear Programming and Anti-Cycling Pivoting Rules." Magnanti, Thomas L., and James B. Orlin (May 1988). Mathematical Programming, 41(1-3): 317-325.

"A Dual Version of Tardos's Algorithm for Linear Programming." Orlin, James B. (November 1986). Operations Research Letters, 5(5), 221-226.

On the Complexity of Four Polyhedral Set Containment Problems.” Freund, Robert M. and James B. Orlin. Mathmatical Programming Vol. 33, No. 2 (1985): 133-145. (1985)

"Some Very Easy Knapsack/Partition Problems." Orlin, James B. (September/October 1985). Operations Research, 33(5): 1154-1160.

"A Finitely Convergent Cutting Plane Technique." Orlin, James B. (May 1985). Operations Research Letters, 4(1): 1-4.

"Computing Optimal Scalings by Parametric Network Algorithms." Orlin, James B., and Uriel G. Rothblum (May 1985). Mathematical Programming, 32(1): 1-10.

"NP-completeness for Minimizing Maximum Edge Length in Grid Embeddings." ​Miller, Zevi, and James B. Orlin (March 1985). Journal of Algorithms, 6(1): 10-16.

"A Minimum Concave Cost Dynamic Network Flow Problem, with an Application to Lot-Sizing." Orlin, James B. (Spring 1985). Networks, 15(1): 59-71.

"Consecutive Optimizors for a Partitioning Problem with Applications to Optimal Inventory Grouping for Joint Replenishment." ​Chakravarty, A. K., James B. Orlin, and Uriel G. Rothblum (1985). Operations Research, 33(4), 820-832. (1985)

"On the Complexity of Four Polyhedral Set containment Problems." Freund, Robert M., and James B. Orlin (1985). Mathematical Programming, 33(2): 1-7. (1985)

"On the Simplex Algorithm for Networks and Generalized Networks." Orlin, James B. (1985). Mathematical Programming Study, 24: 166-178. (1985)

"Algorithms for Problems on Dynamic/Periodic Graphs." Orlin, James B. (1984). In Pulleyblank, William (ed.), Progress in Combinatorial Optimization. Toronto: Academic Press1984, 273-294. (1984)

"Minimum Convex Cost Dynamic Network Flows." Orlin, James B. (1984). Mathematics of Operations Research, 9(2): 190-207. (1984)

"Dynamic Matchings and Quasidynamic Fractional Matchings I." Orlin, James B. (Winter 1983). Networks, 13(4): 551-562.

"Dynamic Matchings and Quasidynamic Fractional Matchings II." Orlin, James B. (Winter 1983). Networks, 13(4): 563-580.

"Maximum Throughput Dynamic Network Flows." Orlin, James B. (1983). Mathematical Programming, 27: 214-223. (1983)

"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 (September/October 1982). Operations Research, 30(5): 1018-1022.

"Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets." Orlin, James B. (July/August 1982). Operations Research, 30: 760-776.

"A Polynomial Algorithm for Integer Programming Covering Problems Satisfying the Integer Round-up Property.” Orlin, James B. (1982). Mathematical Programming, 22(1): 231-235. (1982)

"The Complexity of Dynamic Languages and Dynamic Optimization Problems." Orlin, James B. Transactions of the 13th Annual ACM Symposium on The Theory of Computing:  May, 1981 218-227.

"Parametric Shortest Path Algorithms with an Application to Cyclic Staffing." ​Karp, Richard M., and James B. Orlin (February 1981). Discrete Applied Mathematics, 3(1): 37-45.

“An O(n2) Algorithm for Coloring Proper Circular Arc Graphs.” Orlin, James B., Maurizio A. Bonuccelli, and Daniel P. Bovet (1981). SIAM Journal on Algebraic and Discrete Methods, 2(2): 88-93. (1981)

“Cyclic Scheduling via Integer Programs with Circular Ones." ​Bartholdi III, John J., James B. Orlin, and H. Donald Ratliff (September/October 1980). Operations Research, 28(5): 1074-1085.

"Line-digraphs, Arborescences, and theorems of Tutte and Knuth." Orlin, James B. (1978). Journal of Combinatorial Theory, Series B, 25(2): 187-198. (1978)

"Contentment in Graph Theory: Covering Graphs with Cliques." Orlin, James B. (1977). Indigationes Mathematicae, 80(5): 406-424 (1977)

"The Minimal Integral Separator of a Threshold Graph." Orlin, James B. (1977). Annals of Discrete Mathematics, 1: 415-419. (1977)

View complete list of publications (PDF) >>


Contact Information
Office: E62-570
Tel: (617) 253-6606
Fax: (617) 258-7579
Support Staff
Name: Tyler Morse
Tel: (617) 253-2656

Research Center(s)

General Expertise
Algorithms; Combinatorial optimization; Computational complexity; Computational economics; Heuristics; Logistcs; Mathematical programming; Network optimization; Optimization; Robust optimization; Transportation; Vehicle routing