Professor Adam Letchford
BA (Hons) Nottingham, MSc and PhD Lancaster
Professor of Optimisation
Personal Webpage
http://www.lancs.ac.uk/staff/letchfoa/
Department
Management Science
Organisational Roles
Chair of the Management Science Research Steering Committee
Coordinator of the LANCS optimisation cluster
Coordinator of the Optimisation Research Centre
External Roles
Associate Editor of:
- Mathematical Programming Series A (2003-date)
- Mathematical Programming Computations (2008-date)
- Discrete Optimization (2009-date)
- Computational Optimization & Applications (2005-2009)
Fellow of the Operational Research Society
Member of the peer review college of the Engineering and Physical Sciences Research Council (2006-date)
Regular writer for Mathematical Reviews (2007-date)
Research Interests
Professor Letchford's research is in optimisation, i.e., finding the best solution to problems that have a huge (possibly infinite) number of solutions. Optimisation is an inter-disciplinary subject, lying at the interface between Operational Research, Computer Science, Applied Mathematics and Engineering.
Professor Letchford concentrates mainly on methods for solving optimisation problems to proven optimality, rather than heuristic methods. He also has a particular interest in combinatorial optimisation problems, i.e., problems in which variables are restricted to take integer (whole-number) values.
Current Research
Professor Letchford is currently the holder of an EPSRC Advanced Research Fellowship. During the period of the fellowship (2006-2011), he is concentrating on problems that have both combinatorial and non-linear aspects.
View all publications (67)
Journal/Serial (52)
Chapter in Book (8)
Working Paper (7)
Selected Publications
- Kaparis K and Letchford AN, forthcoming, 'Separation algorithms for 0 - 1 knapsack polytopes', Mathematical Programming
- Capara A and Letchford AN, forthcoming, 'New techniques for cost sharing in combinatorial optimization games', Mathematical Programming
- Giandomenico M, Letchford AN, Rossi F and Smriglio S, 2009, 'An application of the Lovasz-Schrijver M(K,K) operator to the stable set problem', Mathematical Programming, vol 120(2), pp 381-401
- Letchford AN and Oukil A, 2009, 'Exploiting sparsity in pricing routines for the capacitated arc routing problem', Computers and Operations Research, vol 36(7), pp 2320-2327
- Burer S and Letchford AN, 2009, 'On non-convex quadratic programming with box constraints', SIAM Journal on Optimization, vol 20(2), pp 1073-1089
- Letchford AN, Reinelt G. and Theis DO, 2008, 'Odd minimum cut-sets and b-matchings revisited', SIAM Journal of Discrete Mathematics, vol 22(4), pp 1480-1487
- Letchford AN and Pearson N, 2008, 'Good triangulations yield good tours', Computers and Operations Research, vol 35(2), pp 638-647
- Letchford AN and Pearson N, 2008, 'Exploiting planarity in separation routines for the symmetric travelling salesman problem', Discrete Optimization, vol 5(2), pp 220-230
- Kaparis K and Letchford AN, 2008, 'Local and global lifted cover inequalities for the multidimensional knapsack problem', European Journal of Operational Research, vol 186(1), pp 91-103
- Letchford AN and Sorensen MM, 2008, 'Binary positive semidefinite matrices and associated integer polytopes', in Integer Programming and Combinatorial Optimization 13, Lecture Notes in Computer Science, Vol. 5035, (eds) Lodi A, Rinaldi G and Panconesi A, Springer, Berlin, pp 125-139, ISBN: 3540688862
