Adam N. Letchford
Adam N. Letchford
Professor of Optimisation, Lancaster University
Verified email at lancaster.ac.uk - Homepage
TitleCited byYear
A new branch-and-cut algorithm for the capacitated vehicle routing problem
J Lysgaard, AN Letchford, RW Eglese
Mathematical Programming 100 (2), 423-445, 2004
4942004
Non-convex mixed-integer nonlinear programming: a survey
S Burer, AN Letchford
Surveys in Operations Research and Management Science 17 (2), 97-106, 2012
3302012
A branch-and-cut algorithm for the capacitated open vehicle routing problem
AN Letchford, J Lysgaard, RW Eglese
Journal of the Operational Research Society 58 (12), 1642-1651, 2007
1282007
Projection results for vehicle routing
AN Letchford, JJ Salazar-González
Mathematical Programming 105 (2-3), 251-274, 2006
1042006
On the separation of split cuts and related inequalities
A Caprara, AN Letchford
Mathematical Programming 94 (2-3), 279-294, 2003
1002003
Multistars, partial multistars and the capacitated vehicle routing problem
AN Letchford, RW Eglese, J Lysgaard
Mathematical Programming 94 (1), 21-40, 2002
882002
Separation algorithms for 0-1 knapsack polytopes
K Kaparis, AN Letchford
Mathematical programming 124 (1-2), 69-91, 2010
852010
On the separation of maximally violated mod-k cuts
A Caprara, M Fischetti, AN Letchford
Mathematical Programming 87 (1), 37-56, 2000
842000
Strengthening Chvátal–Gomory cuts and Gomory fractional cuts
AN Letchford, A Lodi
Operations Research Letters 30 (2), 74-82, 2002
822002
A polyhedral approach to the single row facility layout problem
ARS Amaral, AN Letchford
Mathematical programming 141 (1-2), 453-477, 2013
81*2013
On nonconvex quadratic programming with box constraints
S Burer, AN Letchford
SIAM Journal on Optimization 20 (2), 1073-1089, 2009
772009
Compact formulations of the Steiner traveling salesman problem and related problems
AN Letchford, SD Nasiri, DO Theis
European Journal of Operational Research 228 (1), 83-92, 2013
662013
Exploiting sparsity in pricing routines for the capacitated arc routing problem
AN Letchford, A Oukil
Computers & Operations Research 36 (7), 2320-2327, 2009
652009
A faster exact separation algorithm for blossom inequalities
AN Letchford, G Reinelt, DO Theis
International Conference on Integer Programming and Combinatorial …, 2004
632004
A cutting plane algorithm for the general routing problem
A Corberáan, AN Letchford, JM Sanchis
Mathematical programming 90 (2), 291-316, 2001
592001
Analysis of upper bounds for the pallet loading problem
AN Letchford, A Amaral
European Journal of Operational Research 132 (3), 582-593, 2001
582001
Odd minimum cut sets and b-matchings revisited
AN Letchford, G Reinelt, DO Theis
SIAM Journal on Discrete Mathematics 22 (4), 1480-1487, 2008
562008
New inequalities for the general routing problem
AN Letchford
European Journal of Operational Research 96 (2), 317-322, 1997
521997
Separating a superclass of comb inequalities in planar graphs
AN Letchford
Mathematics of Operations Research 25 (3), 443-454, 2000
512000
The rural postman problem with deadline classes
AN Letchford, RW Eglese
European Journal of Operational Research 105 (3), 390-400, 1998
501998
The system can't perform the operation now. Try again later.
Articles 1–20