"Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems."

Agustin ​Bompadre and James B. Orlin. In Proceedings of the 11th International IPCO Conference, edited by Michael Jünger and Volker Kaibel. Berlin, Germany: June 2005.

"Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs."

Ramaswamy, Ramkumar, James B. Orlin and Nilopal Chakravarti. Mathematical Programming Vol. 102, No. 2 (2005): 355-369.

"Approximate Local Search in Combinatorial Optimization."

​Orlin, James B., Abraham P. Punnen, and Andreas S. Schulz. SIAM Journal on Computing Vol. 33, No. 5 (2004): 1201-1214.

"The Extended Neighborhood: Definition and Characterization."

​Orlin, James B. and Dushyant Sharma. Mathematical Programming Vol. 101, No. 3 (2004): 537-559.

"A Neighborhood Search Algorithm for the Combined Through and Fleet Assignment Model with Time Windows."

Ahuja, Ravindra K., Jian Liu, James B. Orlin, Jon Goodstein and Amit Mukherjee. Network Vol. 44, No. 2 (2004): 160-171.

"A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem."

Ahuja, Ravindra K., Dorit S. Hochbaum and James B. Orlin. Algorithmica Vol. 39, No. 3 (2004): 189-208.