Up a level |

Number of items: **7**.

Fortini, M., Letchford, A. N., Lodi, A., & Wenger, K. M. (2011). Computing compatible tours for the symmetric traveling salesman problem. *Mathematical Programming Computation*, *3*(1), 59-78.
External link

Fleischer, L. K., Letchford, A. N., & Lodi, A. (2006). Polynomial-time separation of a superclass of simple comb inequalities. *Mathematics of Operations Research*, *31*(4), 696-713.
External link

Letchford, A. N., Lodi, A., Cochran, J. J., Cox, L. A., Keskinocak, P., Kharoufeh, J. P., & Smith, J. C. (2010). Mathematical programming approaches to the traveling salesman problem. In *Wiley encyclopedia of operations research and management science* .
External link

Letchford, A. N., & Lodi, A. (2003). Primal separation algorithms. *4OR*, *1*(3), 209-224.
External link

Letchford, A. N., & Lodi, A. (2002, May). *Polynomial-time separation of simple comb inequalities * [Paper]. 9th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2002), Cambridge, MA, United states.
External link

Letchford, A. N., & Lodi, A. (2002). Strengthening Chvatal-Gomory cuts and Gomory fractional cuts. *Operations Research Letters*, *30*(2), 74-82.
External link

Letchford, A. N., & Lodi, A. (2001, March). *An augment-and-branch-and-cut framework for mixed 0-1 programming * [Paper]. 5th International Workshop on Combinatorial Optimization, Aussois, France.
External link