"A Survey of Very Large Scale Neighborhood Search Techniques."

Ahuja, Ravindra K., Özlem Ergun, James B. Orlin and Abraham P. Punnen. Discrete Applied Mathematics Vol. 23, No. 1-3 (2002): 75-102.

"Branch and Bound Algorithms for the Test Cover Problem."

Koen M. J. De Bontridder, B. J. Lageweg, Jan K. Lenstra, James B. Orlin and Leen Stougie. In Proceedings of the 10th Annual European Symposium on Algorithms (ESA), edited by Rajeev Raman and Rolf Möhring. Berlin, Germany: September 2002.

"Minimum Time and Minimum Cost Path Problems in Street Networks with Periodic Traffic Lights."

​Ahuja, Ravindra K., James B. Orlin, Steffano Pallotino, and Maria Grazia Scutella. Transportation Science Vol. 36, No. 3 (2002): 326-336.

"A Network Simplex Algorithm with O(n) Consecutive Degenerate Pivots."

Ahuja, Ravindra K., James B. Orlin, Prabha Sharma and P.T. Sokkalingam. Operations Research Letters Vol. 30, No. 3 (2002): 141-148.

"On Multi-Route Maximum Flows in Networks."

Aggarwal, Charu C. and James B. Orlin. Networks Vol. 39, No. 1 (2002): 43-52.

"Multi-exchange Neighborhood Search Algorithms for the Capacitated Minimum Spanning Tree Problem."

Ahuja, Ravindra K., James B. Orlin and Dushyant Sharma. Mathematical Programming Vol. 91, No. 1 (2001): 71-97.