![]() | Up a level |
Letchford, A. N., & Lodi, A. (2007). The traveling salesman problem: a book review. 4OR, 5(4), 315-317. External link
Letchford, A. N., & Lodi, A. (2002). Primal cutting plane algorithms revisited. Mathematical Methods of Operations Research, 56(1), 67-81. 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