| 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 | 835 | 2004 |
| Non-convex mixed-integer nonlinear programming: a survey S Burer, AN Letchford Surveys in Operations Research and Management Science 17 (2), 97-106, 2012 | 804 | 2012 |
| 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 | 207 | 2007 |
| Projection results for vehicle routing AN Letchford, JJ Salazar-González Mathematical Programming 105 (2-3), 251-274, 2006 | 176 | 2006 |
| 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 | 153 | 2013 |
| A polyhedral approach to the single row facility layout problem ARS Amaral, AN Letchford Mathematical programming 141 (1-2), 453-477, 2013 | 134 | 2013 |
| Separation algorithms for 0-1 knapsack polytopes K Kaparis, AN Letchford Mathematical programming 124 (1-2), 69-91, 2010 | 128 | 2010 |
| On nonconvex quadratic programming with box constraints S Burer, AN Letchford SIAM Journal on Optimization 20 (2), 1073-1089, 2009 | 127 | 2009 |
| Operational Research: methods and applications F Petropoulos, G Laporte, E Aktas, SA Alumur, C Archetti, H Ayhan, ... Journal of the Operational Research Society 75 (3), 423-617, 2024 | 120 | 2024 |
| On the separation of split cuts and related inequalities A Caprara, AN Letchford Mathematical Programming 94 (2-3), 279-294, 2003 | 115 | 2003 |
| Multistars, partial multistars and the capacitated vehicle routing problem AN Letchford, RW Eglese, J Lysgaard Mathematical Programming 94 (1), 21-40, 2002 | 115 | 2002 |
| Strengthening Chvátal–Gomory cuts and Gomory fractional cuts AN Letchford, A Lodi Operations Research Letters 30 (2), 74-82, 2002 | 97 | 2002 |
| On the separation of maximally violated mod-k cuts A Caprara, M Fischetti, AN Letchford Mathematical Programming 87 (1), 37-56, 2000 | 95 | 2000 |
| Stronger multi-commodity flow formulations of the capacitated vehicle routing problem AN Letchford, JJ Salazar-González European Journal of Operational Research 244 (3), 730-738, 2015 | 93 | 2015 |
| A cutting plane algorithm for the general routing problem A Corberáan, AN Letchford, JM Sanchis Mathematical programming 90 (2), 291-316, 2001 | 84 | 2001 |
| Odd Minimum Cut Sets and b-Matchings Revisited AN Letchford, G Reinelt, DO Theis SIAM Journal on Discrete Mathematics 22 (4), 1480-1487, 2008 | 79 | 2008 |
| Exploiting sparsity in pricing routines for the capacitated arc routing problem AN Letchford, A Oukil Computers & Operations Research 36 (7), 2320-2327, 2009 | 78 | 2009 |
| A faster exact separation algorithm for blossom inequalities AN Letchford, G Reinelt, DO Theis International Conference on Integer Programming and Combinatorial …, 2004 | 74 | 2004 |
| A dynamic programming heuristic for the quadratic knapsack problem FD Fomeni, AN Letchford INFORMS Journal on Computing 26 (1), 173-182, 2014 | 71 | 2014 |
| Analysis of upper bounds for the pallet loading problem AN Letchford, A Amaral European Journal of Operational Research 132 (3), 582-593, 2001 | 71 | 2001 |
Richard W. EgleseProfessor Emeritus, Lancaster UniversityVerified email at lancaster.ac.uk
