2010 – Current

B.  Vaidyanathan and J.B. Orlin, “Fast Algorithms for Convex Cost Flow Problems on Circles, Lines, and Trees.”  (2013) Accepted for publication in Networks.

N. Halman, G. Nannicini, and J.B. Orlin, “A Fast FPTAS for Convex Stochastic Dynamic Programs”, (2013) to appear in the Proceedings of the 2013 European Symposium on Algorithms.

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

E. Elkind, and J.B. Orlin, “On the hardness of finding subsets with equal average.” Information Processing Letters 113, (2013), 477–480.

D. Hochbaum and J.B. Orlin, “Simplifications and speedups of the pseudoflow algorithm.”  Networks 61, (2013) 40-57

M. Ghiyasvand and J.B. Orlin, “An improved approximation algorithm for computing Arrow-Debreu prices.” Operations Research 60, (2012) 1245-1248.

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

M. Kodialam, T. V. Lakshman, J. B. Orlin, and S. Sengupta. “End-to-end restorable oblivious routing of hose model traffic." IEEE/ACM Trans. Netw. 19, 4 (2011), 1223-1236.

T. Huh, R. Levi, P. Rusmevichientong and J .B. Orlin. “Adaptive Data-Driven Inventory Control Policies Based on Kaplan-Meir Estimator” Operations Research 59, (2011) 929–941

M. Milanic, J. B Orlin, and G. Rudolf,  “Complexity Results for Equistable Graphs and Related Classes” Annals of Operations Research 188 (2011), 359-370.

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

 M. Dror, J.B. Orlin, and M. Zhu “Packing Shelves with Items that Divide the Shelves' Length: A Case of a Universal Number Partition Problem”, Discrete Mathematics, Algorithms and Applications 2, (2010) 189-198.

J. B. Orlin, K. Madduri, K. Subramani, and M. Williamson, “A Faster Algorithm for the Single Source Shortest Path Problem with Few Distinct Positive Lengths.” Journal of Discrete Algorithms 8, (2010) 189-198.

2000 – 2009

R.K. Ahuja, J.B. Orlin, and O. Şeref. “Incremental Network Optimization: Theory & Algorithms.”  March 2007.  Operations Research 57, (2009) 586-594

S. Iwata and J.B. Orlin, “A Simple Combinatorial Algorithm for Submodular Function Minimization.”  Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, (2009) 1230-1237.

N. Halman, D. Klabjan, M. Mostagir, J.B. Orlin, 
and D. Simchi-Levi, “A Fully Polynomial Time Approximation Scheme for Single-Item Stochastic Lot-Sizing Problems with Discrete Demand”Mathematics of Operations Research 34, (2009), 674-685.

J.B. Orlin, “A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization.”  Math Programming 118, (2009) 237-251 

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

O. Netzer , O. Toubia , E. Bradlow, E. Dahan , T. Evgeniou , F.M. Feinberg , E.M. Feit , S.K. Hui , J.C. Liechty, J.B. Orlin, and V.R. Rao, “Beyond Conjoint Analysis:  Advances in Preference Measurement.”  Marketing Letters 19, (2008) 337-354. 

B. Vaidyanathan, R.K Ahuja, and J.B. Orlin “The Locomotive Routing Problem”, Transportation Science, 42, (2008) 492-507. 

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

E.K. Burke, M. Dror, and J.B. Orlin, “Scheduling Malleable Tasks with Interdependent Processing Rates:  Comments and Observations”,  Discrete Applied Mathematic 156 (2008) 620-626.

J.B. Orlin, A.S. Schulz, and S. Sengupta, “On e-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization”.  Extended Abstract. Thirty-Second Annual ACM Symposium on Theory of Computing (STOC '00).  Discrete Optimization 5, (2008), 550-561.

M. Kumar and J.B. Orlin, "Scale-invariant Clustering with Minimum Volume Ellipsoids", Computers and Operations Research 35, (2008) 1017- 1029.

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

R.K. Ahuja, J. Goodstein, A. Mukherjee, J.B. Orlin, and D. Sharma, “A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model”, INFORMS Journal of Computing.  19, (2007), 416-428

M. Kodialam, T.V. Lakshman,  J.B. Orlin, and S. Sengupta, “Pre-Configuring IP-over-Optical Networks to Handle Router Failures and Unpredictable Traffic”,  IEEE Journal on Selected Areas in Communication 25 (2007) 934-948.

E. Dahan, J. Hauser, J.B. Orlin, and M. Yee, “Greedoid-Based Noncompensatory Inference”, Marketing Science  26 (2007), 532-549

R.K. Ahuja, K. Jha, J.B. Orlin, and D. Sharma, "Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem", INFORMS Journal of Computing. 2007 19, (2007), 646-657.

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

R.K. Ahuja, J. Goodstein, J. Liu, A. Mukherjee, J.B. Orlin, and D. Sharma, “Exact and Heuristic Methods for the Weapon Target Assignment Problem”,  Operations Research 55, (2007), 1136–1146.

A. Bompadre, M. Dror, and J.B. Orlin, “Probabilistic Analysis of Unit Demand Vehicle Routing Problems”,  J. Appl. Probab.  44, (2007), 259-278.

C. Myers and J.B. Orlin, “Very Large Scale Neighborhood Search Techniques in Timetabling Problems”,  E.K. Burke and H. Rudov´a (Eds.): Proceedings of PATAT 2006, LNCS 3867, 24–39, 2007.    Springer-Verlag Berlin Heidelberg 2007.

J. Csirik, D.S. Johnson, C.Kenyon, J.B. Orlin, P. Shor, and R. Weber “On the Sum-of-Squares Algorithm for Bin Packing”,  Extended abstract. Thirty-Second Annual ACM Symposium on Theory of Computing (STOC '00).  Journal of the Association of Computing Machinery 53 (2006), 1-65.

M. Dror, Y. Lee, J.B. Orlin, and V. Polishchuk, "The TSP and the Sum of its Marginal Values", International Journal of Computational Geometry and Applications 16, (2006) 333-343.

Ö. Ergun, J.B. Orlin, and A. Steele-Feldman. "Creating Very Large Scale Neighborhoods out of Smaller Ones by Compounding Moves: A Study on the Vehicle Routing Problem", Journal of Heuristics 12, (2006), 1381-1231.

Ö. Ergun and J.B. Orlin, “A Dynamic Programming Methodology in Very Large Scale Neighborhood Search Applied to the Traveling Salesman Problem”, Discrete Optimization 3 (2006), 78-85.

Ö. Ergun and J.B. Orlin, "Fast Neighborhood Search for the Single Machine Total Weighted Tardiness Problem ", OR Letters 34, (2006), 41-45.

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

A. Bompadre, M. Dror, and J.B. Orlin, “Improved Bounds for Vehicle Routing Solutions”, Discrete Optimization 3, (2006) 299-316.

R.K. Ahuja, Ö. Ergun, J.B. Orlin and A. Punnen, “Very large-scale neighborhood search: Theory, algorithms and applications”   In Handbook of Approximation Algorithms and Metaheuristics, T. Gonzalez, ed. (Chapman & Hall/Crc Computer & Information Science Series) 2006.

J.B. Orlin, R. Ramaswamy and N. Chakravarty. "Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs", Mathematical Programming 102, (2005) 355-369.

R.K. Ahuja, J. Liu, J.B. Orlin, D. Sharma, and L. Shughart, "Solving Real-Life Locomotive Scheduling Problems", Transportation Science 39 (2005) 503-517.

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

R.K. Ahuja, D. Hochbaum, and  J.B. Orlin,  A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem”,  Algorithmica 39, (2004), 189 – 208.

J.B. Orlin, A. Punnen, and A.S. Schulz, “Approximate Local Search in Combinatorial Optimization”, an extended abstract was published in the Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, (2004) 580-589.   SIAM Journal on Computing 33, (2004) 1201-1214.

R.K. Ahuja, J.B. Orlin, S. Pallottino, M. Scaparra, and M.Scutellá. "A Multi-exchange Heuristic for the Single Source Capacitated Facility Location Problem", Management Science 50, (2004) 749-760.

J.B. Orlin and D. Sharma, "The Extended Neighborhood: Definition and Characterization", Mathematical Programming 101, (2004) 537-559.

R.K. Ahuja, J. Goo dstein, J. Liu,  A. Mukherjee, and J.B. Orlin, “A Neighborhood Search Algorithm for the Combined Through and Fleet Assignment Model with Time Windows”,  Networks 44, (2004) 160-171.

R.K. Ahuja, J.B. Orlin, and D. Sharma, "A Composite Neighborhood Search Algorithm for the Capacitated Minimum Spanning Tree Problem", Operations Research Letters 31, (2003), 185-194.

R.K. Ahuja, D. Hochbaum, and J.B. Orlin, "Solving the Convex Cost Integer Dual Network Flow Problem", Appeared in the 1999 IPCO proceedings. Management Science 49, (2003), 950-964.

R.K. Ahuja, J.B. Orlin, S. Pallottino, and M.G. Scutellà, "Dynamic Shortest Paths Minimizing Travel Times and Costs", Networks, 41, (2003) 197-205.

R.K. Ahuja, J. Goodstein, J. Liu, A. Mukherjee, J.B. Orlin, and D. Sharma, "Solving Multi-Criteria Combined Through Fleet Assignment Models", Chapter 13 in Operations Research in Space and Air. Edited by Tito A. Ciriani, Georgio Fasano, Stefano Gliozzi, and Roberto Tadei. Kluwer Academic Publishers, (2003), 233-256.

C. Aggarwal and J.B. Orlin, "On Multi-Route Maximum Flows in Networks", Networks 39, (2002), 43-52.

R.K. Ahuja, Ö. Ergun, J.B. Orlin, and A. Punnen, "A Survey of Very Large Scale Neighborhood Search Techniques", Discrete Applied Mathematics 23 (2002), 75-102.

R.K. Ahuja, J.B. Orlin, S. Pallotino, and M.G. Scutella, "Minimum Time and Minimum Cost Path Problems in Street Networks with Periodic Traffic Lights", Transportation Science 36, (2002) 326-336.

R.K. Ahuja, J.B. Orlin, P. Sharma, and P. T. Sokkalingam, "A Network Simplex Algorithm with O(n) Consecutive Degenerate Pivots", OR Letters 30, (2002), 141-148.

R.K. Ahuja and J.B. Orlin, "Combinatorial Algorithms for Inverse Network Flow Problems", Networks40, (2002) 181-187.

K.M.J. de Bontridder, B. J. Lageweg, J.K. Lenstra, J.B. Orlin,  and L. Stougie, "Branch and Bound Algorithms for the Test Cover Problem", an extended abstract in Proceedings of the 10th Annual European Symposium on Algorithms (ESA), (2002) 223—233.

R.K. Ahuja and J.B. Orlin, "A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints", Operations Research 49, (2001)

R.K. Ahuja and J.B. Orlin, "Inverse Optimization, Part I: Linear Programming and General Problem", Operations Research 49, (2001), 771-783.

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

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

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

R.K. Ahuja and J.B. Orlin, "A Faster Algorithm for the Inverse Spanning Tree Problem", Journal of Algorithms 34, (2000) 177-193.

R.K. Ahuja, J.B. Orlin, and D. Sharma, "Very large scale neighborhood search", International Transactions in Operations Research 7, (2000)  301-317.


1990 – 1999

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

R.K. Ahuja, J.B. Orlin, G. Sechi, and P. Zuddas, "Algorithms for the Simple Equal Flow Problem", Management Science 45, (1999), 1440-1455.

L. Fleischer and J.B. Orlin, “Optimal Rounding of Fractional, Stationary, Dynamic Flows When Fl ows are Instantaneous”, SIAM Journal of Discrete Mathematics 13 (1999) 145-153.

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

C. Aggarwal, R.K. Ahuja, J. Hao, and J.B. Orlin, "Diagnosing Infeasibilities in Network Flow Problems", Mathematical Programming 81, (1998), 263-280.

P. Mireault, J.B. Orlin, and R.V. Vohra, "A Parametric Worst Case Analysis for a Machine Scheduling Problem",  Operations Research 45, (1997), 116-125.

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

C.C. Aggarwal, J.B. Orlin, and R.P. Tai, "Optimized Crossover for the Independent Set Problem", Operations Research 45, (1997), 226-234.

R. K. Ahuja and J.B. Orlin, “Equivalence of Primal and Dual Simplex Algorithms for the Maximum Flow Problem” >, Sloan School Working paper 3884-96, March 1996. Operations Research Letters 20, (1997) 101-108.

R.K. Ahuja, M. Kodialam A.K. Mishra, and J.B. Orlin, "Computational Investigations of Maximum Flow Algorithms", European Journal of Operations Research 97, (1997), 509-542.

Golfarb, Z. Jin, and J.B. Orlin, “Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem”, Mathematics of Operations Research 22, (1997), 793-802.

R. Shull, A. Shuchat, J.B. Orlin and M.L. Gardner, "Arc Weighting in Hidden Bicircular Networks", Congressus Numerantium 125 (1997) 161-171.

R. K. Ahuja, J.B. Orlin, "Use of Representative Operation Counts in Computational Testings of Algorithms",  Informs Journal of Computing 8, (1996), 318-330

R.K. Ahuja and J.B. Orlin, "A Capacity Scaling Algorithm for the Constrained Maximum Flow Problem", Networks 2 5, (1995), 89-98.

T.J. Hudson, L.D. Stein, S.S. Gerety, A.B. Castle, J.B. Orlin et al, "An STS-based Map of the Human Genome",  Science 270, (1995), 1945-1954.

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

R.K. Ahuja, J.B. Orlin, C. Stein, and R.E. Tarjan, "Improved Algorithms for Bipartite Network Flow", SIAM Journal of Computing 23, (1994), 906-933.

J. Hao and J.B. Orlin, "A Faster Algorithm for Finding a Minimum Cut in a Graph", Journal of Algorithms 17, (1994), 424-446.

Y. Lee and J.B. Orlin, "On Very Large Scale Assignment Problems", In Large Scale Optimization: State of the Art, W.W. Hager, D. W. Hearn and P.M Pardalos, Editors.  Kluwer Academic Publishers, Dordrecht, The Netherlands, (1994), 206-244.

R. Shull, A.H. Shuchat, J.B. Orlin, and M.L. Gardner, "Recognizing Hidden Bicircular Networks", Discrete Applied Mathematics 41, (1993), 13-53.

S. Mizuno, R. Saigal, and J.B. Orlin, "Determination of Optimal Vertices from Feasible Solutions in Unimodular Linear Programming",  Mathematical Programming 59, (1993), 23-32.

J.B. Orlin, S.A. Plotkin, and E. Tardos, "Polynomial Dual Network Simplex Algorithms", Mathematical Programming 60, (1993), 255-276.

J.B. Orlin and C. Stein, "Parallel Algorithms for the Assignment and Minimum Cost Flow Problems", OR Letters 14, (1993), 181-186.

M. Hartmann and J.B. Orlin, "Finding Minimum Cost to Time Ratio Cycles with Small Integral Transit Times", Networks 23, (1993), 567-574.

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

Bertsimas and J.B. Orlin, "A Technique for Speeding up the Solution of the Lagrangian Dual", Mathematical Programming 63, (1994), 23-46.

J.B. Orlin and R. K. Ahuja, "New Scaling Algorithms for the Assignment and Minimum Cycle Mean Problems", Mathematical Programming 54, (1992), 41-56.

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

R.K. Ahuja, A.V. Goldberg, J.B. Orlin, and R.E. Tarjan, "Finding Minimum-Cost Flows by Double Scaling", Mathematical Programming 53, (1992), 243-266.

R.K. Ahuja and J.B. Orlin, "Distance-Directed Algorithms for Maximum Flow and Parametric Maximum Flow Problems”, Naval Research Logistics, 38, (1990), 413-430.

R.K. Ahuja, T.L. Magnanti and J.B. Orlin, "Recent Advances in Network Flows", Siam Review 33, (1991), 175-219.

N. Young, R.E. Tarjan and J.B. Orlin, "Faster Parametric Shortest Path and Minimum Balance Algorithms", Networks, 21, (1991), 205-221.

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

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

R.K. Ahuja, K. Mehlhorn, J.B. Orlin, and R.E. Tarjan, "Faster Algorithms for the Shortest Path Problem",  Journal of the Association of Computing Machinery 37, (1990), 213-223.


1977 – 1989

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

R. Shull, J.B. Orlin, A.H. Shuchat, and M.L. Gardner, "The Structure of Bases in Bicircular Matroids", Discrete Applied Mathematics, 23, (1989) 267-283.

R.K. Ahuja, J.B. Orlin, and R.E. Tarjan, "Improved Time Bounds for the Maximum Flow Problem", SIAM J. of Computing 18, (1989), 939-954.

R.K Ahuja, T.L. Magnanti, and J.B. Orlin, "Network Flows", Chapter IV of the Handbooks in Operations Research and Management Science, Volume 1: Optimization, eds. G.L. Nemhauser, A.H.G. Rinnooy Kan, and M.J. Todd, North Holland, 1989, 211-369.

T.L. Magnanti and J.B. Orlin, "Parametric Linear Programming and Anti-Cycling Pivoting Rules", Mathematical Programming 41, (1988), 317-325.

J.B. Orlin, "A Faster Strongly Polynomial Algorithm for the Minimum Cost Flow Problem”, Proceedings of the 20th Annual ACM Conference on the Symposium of Computing.  ACM Press.  (1988), 377-387.  Operations Research 41, (1993), 338-350.

J.B. Orlin, "A Dual Version of Tardos's Algorithm for Linear Programming."  O.R. Letters 5, (1986), 221-226.

Z. Miller and J.B. Orlin, "NP-completeness for Minimizing Maximum Edge Length in Grid Embeddings", Journal of Algorithms, 6, (1985), 10-16.

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

S.C. Graves and J.B. Orlin, "A Minimum Concave Cost Dynamic Network Flow Problem, with an Application to Lot-Sizing", Networks, 15, (1985), 59-71.

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

J.B. Orlin, "Some Very Easy Knapsack/Partition Problems", Operations Research, 33, (1985), 1154-1160.

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

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

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

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

J.B. Orlin, "Algorithms for Problems on Dynamic/Periodic Graphs", in Progress in Combinatorial Optimization,  William Pulleyblank,  ed., Academic Press, Toronto, 1984,  273-294.

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

J.B. Orlin, "Dynamic Matchings and Quasidynamic Fractional Matchings I", Networks, 13, (1983), 551-562.

J.B. Orlin, "Dynamic Matchings and Quasidynamic Fractional Matchings II", Networks, 13, (1983), 563-580.

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

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

A.K. Chakravarty, J.B. Orlin, and U.G. Rothblum, "A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Grouping for Joint Replenishment”, Operations Research, 30, (1982), 1018-1022.

J.B. Orlin, M.A. Bonuccelli, and D.P. Bovet, “An O(n2) Algorithm for Coloring Proper Circular Arc Graphs”, SIAM J. Alg. Disc. Meth. , 2, (1981), 88-93.

R.M. Karp and J.B. Orlin, "Parametric Shortest Path Algorithms with an Application to Cyclic Staffing", Discrete Applied Mathematics, 3, (1981), 37-45.

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

J.J. Bartholdi III, J.B. Orlin, and H.D. Ratliff, “Cyclic Scheduling via Integer Programs with Circular Ones", Operations Research, 28, (1980), 1074-1085.

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

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

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