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