Items where Author is "Lodi, A"

Fortini, M and Letchford, A N and Lodi, A and Wenger, K M (2011) Computing compatible tours for the traveling salesman problem. Mathematical Programming Computation, 3 (1). pp. 59-78. ISSN 1867-2957

Letchford, A N and Lodi, A (2011) Mathematical programming approaches to the traveling salesman problem. In: Wiley Encyclopedia of Operations Research and Management Science :. John Wiley and Sons Ltd, Chichester. ISBN 9780470400630

Letchford, A N and Lodi, A (2007) The traveling salesman problem : a book review. 4OR: A Quarterly Journal of Operations Research, 5 (4). pp. 315-317. ISSN 1619-4500

Fleischer, L K and Letchford, A N and Lodi, A (2006) Polynomial-time separation of a superclass of simple comb inequalities. Mathematics of Operations Research, 31 (4). pp. 696-713. ISSN 0364-765X

Letchford, A N and Lodi, A (2003) Polynomial-time separation of simple comb inequalities. Working Paper. The Department of Management Science, Lancaster University.

Letchford, A N and Lodi, A (2003) An augment-and-branch-and-cut framework for mixed 0-1 programming. In: Combinatorial Optimization : Eureka! You Shrink. Lecture Notes in Computer Science . Springer, FRA, pp. 119-133. ISBN 3-540-00580-3

Lodi, A and Letchford, A N (2002) Polynomial-time separation of simple comb inequalities. In: Integer Programming and Combinatorial Optimization : Proceedings of the 9th International IPCO Conference. Lecture Notes in Computer Science . Springer, USA, pp. 93-108. ISBN 3-540-43676-6