M. Milanic, J.B. Orlin, and G. Rudolf.  "Complexity Results for Equistable Graphs and Related Classes."  January 2009.

J. B. Orlin, K. Madduri, and K. Subramani, “A Faster Algorithm for the Single Source Shortest Path Problem with Few Distinct Positive Lengths.”  August, 2008.

V. Farias, R. Levi, and J.B. Orlin, and G. Perakis. “Dynamic Pricing with Learning - State-Space Collapse and Fully Polynomial Time Approximation Scheme”.  Extended Abstract. November 2007.

D. Hochbaum and J.B. Orlin, “Pseudoflow algorithm in O(mn log n2m) time”.  Extended Abstract.  November 2007. 

 J.B. Orlin, and X. Yang. “Maximum Capacity-to-Cost Ratio Path Problem and its Inverse Problem” with Technical Report, October 2006.

J.B. Orlin, “Sensitivity Analysis for the Critical Path Method.”  September 2004.

 M. Dror, J.B. Orlin, and M. Zhu “Packing Shelves with Divisible Items.” September, 2004.

H. Safer, J.B. Orlin, and M. Dror. “Fully Polynomial Approximation in Multi-Criteria Combinatorial Optimization.” February 2004.

T.C. Lai and J.B. Orlin, “The Complexity of Preprocessing.” October 2003.

M. Kodialam and J.B. Orlin, "Topological Ordering of Periodic Graphs."  June 1998.

H. Safer and J.B. Orlin, "Fast Approximation Schemes for Multi-Criteria Combinatorial Optimization." Sloan School Working paper 3756-95,  January 1995.

H. Safer and J.B. Orlin, "Fast Approximation Schemes for Multi-Criteria Flow, Knapsack, and Scheduling Problems." Sloan School Working paper 3757-95, January 1995.

Y. Lee and J.B. Orlin, "QuickMatch: A Very Fast Algorithm for the Assignment Problem." MIT Sloan School Working Paper 3547-93.  March 1993.

P.M. Thompson and J.B. Orlin "The Theory of Cyclic Transfers." M.I.T.  Operations Research Center Report OR 200-89, 1989.

H.N. Psaraftis, J.B. Orlin, D. Bienstock, and P. Thompson,"Analysis and Solution Algorithms of Sealift Routing and Scheduling Problems: Final Report." MIT Sloan School Working Paper 1700-85, 1985.

J.B. Orlin.  “The Complexity of Dynamic/Periodic Languages and Optimization Problems" MIT Sloan School working paper 1679-85.  July, 1985.  

J.B. Orlin.  “Genuinely Polynomial Simplex and Non Simplex Algorithms for the Minimum Cost Flow Problem." MIT Sloan School working paper 1615-84.  December, 1984. 

Ph.D. Thesis.  "Dynamic Network Flows", Stanford University, 1981.  Thesis supervisor:  Arthur F. Veinott, Jr.