"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.