"Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem."

Golfarb, Donald, Zhiying Jin and James B. Orlin. Mathematics of Operations Research Vol. 22, No. 4 (1997): 793-802.

"A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows."

Orlin, James B. Mathematical Programming Vol. 78, No. 2 (1997): 109-129.

"Optimized Crossover for the Independent Set Problem."

Aggarwal, Charu C., James B. Orlin and Ray P. Tai. Operations Research Vol. 45, No. 2 (1997): 226-234.

"Computational Investigations of Maximum Flow Algorithms."

Ahuja, Ravindra K., Murali Kodialam, Ajay K. Mishra and James B. Orlin. European Journal of Operations Research Vol. 97, No. 3 (1997): 509-542.

"Equivalence of Primal and Dual Simplex Algorithms for the Maximum Flow Problem."

Ahuja, Ravindra K. and James B. Orlin. Operations Research Letters Vol. 20, No. 3 (1997): 101-108.

"A Parametric Worst Case Analysis for a Machine Scheduling Problem."

​Mireault, Paul, James B. Orlin, and Rakesh V. Vohra. Operations Research Vol. 45, No. 1 (1997): 116-125.