Home > Research > Researchers > Professor Adam Letchford > Publications

Research

Professor Adam Letchford

Professor

1 - 100 out of 180Page size: 100
RSS feed of this list
  1. Published

    Iterated Chvatal-Gomory cuts and the geometry of numbers

    Aliev, I. & Letchford, A., 2014, In: SIAM Journal on Optimization. 24, 3, p. 1294-1312 19 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  2. Published

    A polyhedral approach to the single row facility layout problem

    Amaral, A. R. S. & Letchford, A., 10/2013, In: Mathematical Programming. 141, 1-2, p. 453-477 25 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  3. Published

    A new lower bound for the minimum linear arrangement of a graph

    Amaral, A., Caprara, A., Letchford, A. N. & Salazar-Gonzalez, J.-J., 20/02/2008, In: Electronic Notes in Discrete Mathematics. 30, p. 87-92

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  4. Published

    Using ℓp-norms for fairness in combinatorial optimisation

    Bektas, T. & Letchford, A., 1/08/2020, In: Computers and Operations Research. 120, 11 p., 104975.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  5. Published

    Matheuristics: survey and synthesis

    Boschetti, M., Letchford, A. & Maniezzo, V., 30/11/2023, In: International Transactions in Operational Research. 30, 6, p. 2840-2866 27 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  6. Published

    Vehicle routing on road networks: how good is Euclidean approximation?

    Boyacı, B., Dang, T. & Letchford, A., 1/05/2021, In: Computers and Operations Research. 129, 13 p., 105197.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  7. Published

    On matchings, T-joins and arc routing problems

    Boyacı, B., Dang, T. & Letchford, A., 31/01/2022, In: Networks. 79, 1, p. 20-31 12 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  8. Published

    Improving a constructive heuristic for the general routing problem

    Boyacı, B., Dang, T. & Letchford, A., 31/01/2023, In: Networks. 81, 1, p. 93-106 14 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  9. Published

    Fast upper and lower bounds for a large-scale real-world arc routing problem

    Boyacı, B., Dang, T. & Letchford, A., 31/01/2023, In: Networks. 81, 1, p. 107-124 18 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  10. Published

    On non-convex quadratic programming with box constraints

    Burer, S. & Letchford, A. N., 2009, In: SIAM Journal on Optimization. 20, 2, p. 1073-1089 17 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  11. Published

    Non-convex mixed-integer nonlinear programming: a survey

    Burer, S. & Letchford, A., 2012, In: Surveys in Operations Research and Management Science. 17, 2, p. 97-106 10 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  12. Published

    Unbounded convex sets for non-convex mixed-integer quadratic programming

    Burer, S. & Letchford, A., 1/02/2014, In: Mathematical Programming. 143, 1-2, p. 231-256 26 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  13. Published

    On the separation of maximally violated mod-k cuts

    Caprara, A., Fischetti, M. & Letchford, A. N., 2000, In: Mathematical Programming. 87, 1, p. 37-56 20 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  14. Published

    On the separation of split cuts and related inequalities

    Caprara, A. & Letchford, A. N., 2003, In: Mathematical Programming. 94, 2-3, p. 279-294 16 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  15. Published

    On the separation of maximally violated mod-k cuts

    Caprara, A., Fischetti, M. & Letchford, A. N., 1999, Integer Programming and Combinatorial Optimization: Proceedings of the 7th International IPCO Conference. Cornuéjols, G., Burkard, R. E. & Woeginger, G. J. (eds.). Berlin: Springer, p. 87-98 12 p. (Lecture Notes in Computer Science ; vol. 1610).

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

  16. Published

    Computing good allocations for combinatorial optimization games

    Caprara, A. & Letchford, A. N., 2005, Lancaster University: The Department of Management Science, (Management Science Working Paper Series).

    Research output: Working paper

  17. Published

    New techniques for cost sharing in combinatorial optimization games

    Caprara, A. & Letchford, A. N., 2010, In: Mathematical Programming. 124, 1-2, p. 93-118 26 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  18. Published

    Decorous lower bounds for minimum linear arrangement

    Caprara, A., Letchford, A. N. & Salazar, J. J., 2011, In: INFORMS Journal on Computing. 23, 1, p. 26-40 15 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  19. Published

    Lower bounds for the minimum linear arrangement of a graph

    Caprara, A., Letchford, A. & Salazar Gonzalez, J. J., 1/08/2010, In: Electronic Notes in Discrete Mathematics. 36, p. 843-849 7 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  20. Published

    Preface: Combinatorial optimization

    Clark, A., Eglese, R., Letchford, A. & Wright, M., 2008, In: Discrete Applied Mathematics. 156, 3, p. 289-290 2 p.

    Research output: Contribution to Journal/Magazine › Editorial › peer-review

  21. Published

    Rules from behaviour: the use of a computational 'rule-finder' as a tool for social psychology

    Clarke, D. D. & Letchford, A. N., 1995, In: British Psychological Society Social Psychology Section Newsletter. 33, p. 4-13 10 p.

    Research output: Contribution to Journal/Magazine › Letter › peer-review

  22. Published

    A cutting plane algorithm for the general routing problem

    Corberan, A., Sanchis, J. M. & Letchford, A. N., 2001, In: Mathematical Programming. 90, 2, p. 291-316 26 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  23. Published

    A survey on exact algorithms for the maximum flow and minimum-cost flow problems

    Cruz Mejía, O. & Letchford, A., 30/09/2023, In: Networks. 82, 2, p. 167-176 10 p.

    Research output: Contribution to Journal/Magazine › Review article › peer-review

  24. Published

    A dynamic programming heuristic for the quadratic knapsack problem

    Djeumou Fomeni, F. & Letchford, A., 02/2014, In: INFORMS Journal on Computing. 26, 1, p. 173-182 10 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  25. Published

    Cutting planes for RLT relaxations of mixed 0-1 polynomial programs

    Djeumou Fomeni, F., Kaparis, K. & Letchford, A., 2015, In: Mathematical Programming. 151, 2, p. 639–658 20 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  26. Published

    A cut-and-branch algorithm for the quadratic knapsack problem

    Djeumou Fomeni, F., Kaparis, K. & Letchford, A., 31/05/2022, In: Discrete Optimization. 44, 2, 18 p., 100579.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  27. Published

    On the complexity of surrogate and group relaxation for integer linear programs

    Dokka, T., Letchford, A. & Mansoor, H., 31/07/2021, In: Operations Research Letters. 49, 4, p. 530-534 5 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  28. Published

    Revisiting surrogate relaxation for the multidimensional knapsack problem

    Dokka, T., Letchford, A. & Mansoor, H., 30/11/2022, In: Operations Research Letters. 50, 6, p. 674-678 5 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  29. Published

    A new branch-and-cut algorithm for capacitated vehicle routing problems

    Eglese, R. W., Letchford, A. N. & Lysgaard, J., 2003, Lancaster University: The Department of Management Science, (Management Science Working Paper Series).

    Research output: Working paper

  30. Published

    Polyhedral theory for arc routing problems

    Eglese, R. W. & Letchford, A. N., 2000, Arc Routing : Theory, Solutions and Applications. Dordrecht: Kluwer Academic Publishers, p. 199-230 32 p.

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

  31. Published

    The rural postman problem with deadline classes

    Eglese, R. W. & Letchford, A. N., 16/03/1998, In: European Journal of Operational Research. 105, 3, p. 390-400 11 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  32. Published

    General routing problem

    Eglese, R. & Letchford, A., 4/09/2008, Encyclopedia of Optimization. Floudas, C. & Pardalos, P. (eds.). 2nd ed. New York: Springer, p. 1252-1254 3 p.

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Entry for encyclopedia/dictionary

  33. Published

    Arc routing problems

    Eglese, R. & Letchford, A., 10/02/2024, Encyclopedia of Optimization. Pardalos, P. & Prokopyev, O. (eds.). 3rd ed. Cham: Springer, 6 p.

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Entry for encyclopedia/dictionary

  34. Published

    A two-level graph partitioning problem arising in mobile wireless communications

    Fairbrother, J., Letchford, A. N. & Briggs, K., 04/2018, In: Computational Optimization and Applications. 69, 3, p. 653-676 24 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  35. Published

    Projection results for the k-partition problem

    Fairbrother, J. & Letchford, A. N., 8/11/2017, In: Discrete Optimization. 26, p. 97-111 15 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  36. Published

    Detecting changes in slope with an L0 penalty

    Fearnhead, P., Maidstone, R. & Letchford, A., 1/06/2019, In: Journal of Computational and Graphical Statistics. 28, 2, p. 265-275 11 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  37. Published

    Generalised network design polyhedra

    Feremans, C., Labbé, M., Letchford, A. N. & Salazar-González, J.-J., 09/2011, In: Networks. 58, 2, p. 125-136 12 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  38. Published

    Polynomial-time separation of a superclass of simple comb inequalities

    Fleischer, L. K., Letchford, A. N. & Lodi, A., 2006, In: Mathematics of Operations Research. 31, 4, p. 696-713 18 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  39. Published

    Maths of OR – Reflections from the Committee

    Fliege, J., Letchford, A. & Tilley, D., 1/08/2021, Mathematics Today, 57, 4, p. 115 1 p.

    Research output: Contribution to specialist publication › Article

  40. Published

    The compatible tour heuristic for the symmetric traveling salesman problem

    Fortini, M., Letchford, A. N., Lodi, A. & Wenger, K. M., 2010, Lancaster University: The Department of Management Science, (Management Science Working Paper Series).

    Research output: Working paper

  41. Published

    Computing compatible tours for the traveling salesman problem

    Fortini, M., Letchford, A. N., Lodi, A. & Wenger, K. M., 2011, In: Mathematical Programming Computation. 3, 1, p. 59-78 20 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  42. Published

    Small bipartite subgraph polytopes

    Galli, L. & Letchford, A. N., 2010, In: Operations Research Letters. 38, 5, p. 337-340 4 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  43. Published

    Reformulating mixed-integer quadratically constrained quadratic programs

    Galli, L. & Letchford, A. N., 2011, Lancaster University: The Department of Management Science, 23 p. (Management Science Working Paper Series; vol. 2011, no. 7).

    Research output: Working paper

  44. Published

    Gap inequalities for non-convex mixed-integer quadratic programs

    Galli, L., Kaparis, K. & Letchford, A. N., 2011, In: Operations Research Letters. 39, 5, p. 297-300 4 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  45. Published

    Complexity results for the gap inequalities for the max-cut problem

    Galli, L., Kaparis, K. & Letchford, A. N., 05/2012, In: Operations Research Letters. 40, 3, p. 149-152 4 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  46. Published

    Gap inequalities for the max-cut problem: a cutting-plane algorithm

    Galli, L., Kaparis, K. & Letchford, A., 2012, Combinatorial Optimization: Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers. Mahjoub, A. R. (ed.). Berlin: Springer, p. 178-188 11 p. (Lecture Notes in Computer Science; vol. 7422).

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

  47. Published

    A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs

    Galli, L. & Letchford, A., 04/2014, In: Optimization Letters. 8, 4, p. 1213-1224 12 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  48. Published

    On the Lovász theta function and some variants

    Galli, L. & Letchford, A. N., 27/07/2017, In: Discrete Optimization. 25, p. 159-174 16 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  49. Published

    New valid inequalities and facets for the simple plant location problem

    Galli, L., Letchford, A. N. & Miller, S., 16/09/2018, In: European Journal of Operational Research. 269, 3, p. 824-833 10 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  50. Published

    A binarisation heuristic for non-convex quadratic programming with box constraints

    Galli, L. & Letchford, A. N., 1/09/2018, In: Operations Research Letters. 46, 5, p. 529-533 5 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  51. Published

    A separation algorithm for the simple plant location problem

    Galli, L. & Letchford, A., 31/07/2021, In: Operations Research Letters. 49, 4, p. 610-615 6 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  52. Published

    Valid inequalities for quadratic optimisation with domain constraints

    Galli, L. & Letchford, A., 31/08/2021, In: Discrete Optimization. 41, 19 p., 100661.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  53. Published

    On upper bounds for the multiple knapsack assignment problem

    Galli, L. & Letchford, A., 1/05/2024, In: Operations Research Letters. 54, 6 p., 107104.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  54. Forthcoming

    On a hierarchy of polytopes for integer quadratic programming

    Galli, L. & Letchford, A., 8/05/2025, (Accepted/In press) Mathematics, Algorithms and the Art and Science of Decision-Making. Barbato, M., Bianchessi, N. & Boggio Tomasaz, A. (eds.). Springer

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

  55. Published

    Exploring the relationship between max-cut and stable set relaxations

    Giandomenico, M. & Letchford, A. N., 03/2006, In: Mathematical Programming. 106, 1, p. 159-175 17 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  56. Published

    An application of the Lovasz-Schrijver M(K,K) operator to the stable set problem

    Giandomenico, M., Letchford, A. N., Rossi, F. & Smriglio, S., 2009, In: Mathematical Programming. 120, 2, p. 381-401 21 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  57. Published

    A new approach to the stable set problem based on ellipsoids

    Giandomenico, M., Letchford, A. N., Rossi, F. & Smriglio, S., 2011, Integer Programming and Combinatorial Optimization : Proceedings of the 15th International IPCO Conference. Günlük, O. & Woeginger, G. (eds.). Berlin: Springer, p. 223-234 12 p. (Lecture Notes in Computer Science; vol. 6655).

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

  58. Published

    A new approach to the stable set problem based on ellipsoids

    Giandomenico, M., Letchford, A. N., Rossi, F. & Smriglio, S., 2011, Lancaster University: The Department of Management Science, (Management Science Working Paper Series).

    Research output: Working paper

  59. Published

    Ellipsoidal relaxations of the stable set problem: theory and algorithms

    Giandomenico, M., Letchford, A., Rossi, F. & Smriglio, S., 1/08/2015, In: SIAM Journal on Optimization. 25, 3, p. 1944-1963 20 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  60. Published

    Approximating the Lovász θ function with the subgradient method

    Giandomenico, M., Letchford, A. N., Rossi, F. & Smriglio, S., 5/06/2013, In: Electronic Notes in Discrete Mathematics. 41, p. 157-164 8 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  61. Published

    Adaptive policies for perimeter surveillance problems

    Grant, J. A., Leslie, D. S., Glazebrook, K., Szechtman, R. & Letchford, A., 16/05/2020, In: European Journal of Operational Research. 283, 1, p. 265-278 14 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  62. Published

    Local and global lifted cover inequalities for the multidimensional knapsack problem

    Kaparis, K. & Letchford, A. N., 1/04/2008, In: European Journal of Operational Research. 186, 1, p. 91-103 13 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  63. Published

    Cover Inequalities

    Kaparis, K. & Letchford, A. N., 02/2011, Wiley Encyclopedia of Operations Research and Management Science. Cochran, J. J., Cox, L. A., Keskinocak, P., Kharoufeh, J. P. & Smith, J. C. (eds.). Wiley

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Entry for encyclopedia/dictionary

  64. Published

    Separation algorithms for 0-1 knapsack polytopes

    Kaparis, K. & Letchford, A., 07/2010, In: Mathematical Programming. 124, 1-2, p. 69-91 23 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  65. Published

    A note on the 2-circulant inequalities for the max-cut problem

    Kaparis, K. & Letchford, A. N., 07/2018, In: Operations Research Letters. 46, 4, p. 443-447 5 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  66. Published

    On matroid parity and matching polytopes

    Kaparis, K., Letchford, A. & Mourtos, I., 30/09/2020, In: Discrete Applied Mathematics. 284, p. 322-331 10 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  67. Published

    Generalised 2-circulant inequalities for the max-cut problem

    Kaparis, K., Letchford, A. & Mourtos, I., 31/03/2022, In: Operations Research Letters. 50, 2, p. 122-128 7 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  68. Published

    On cut polytopes and graph minors

    Kaparis, K., Letchford, A. & Mourtos, I., 30/11/2023, In: Discrete Optimization. 50, 100807.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  69. Published

    Editorial: Mixed integer programming

    Lee, J. & Letchford, A. N., 1/03/2007, In: Discrete Optimization. 4, 1, p. 1-2 2 p.

    Research output: Contribution to Journal/Magazine › Editorial › peer-review

  70. Published

    Binary clutter inequalities for integer programs

    Letchford, A. N., 2002, Lancaster University: The Department of Management Science, (Management Science Working Paper Series).

    Research output: Working paper

  71. Published

    Polynomial-time separation of simple comb inequalities

    Letchford, A. N. & Lodi, A., 2003, Lancaster University: The Department of Management Science, (Management Science Working Paper Series).

    Research output: Working paper

  72. Published

    Analysis of upper bounds for the pallet loading problem

    Letchford, A. N. & Amaral, A. R. S., 2001, In: European Journal of Operational Research. 132, 3, p. 582-593 12 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  73. Published

    Separating a superclass of comb inequalities in planar graphs

    Letchford, A. N., 2000, In: Mathematics of Operations Research. 25, 3, p. 443-454 12 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  74. Published

    The general routing polyhedron: a unifying framework

    Letchford, A. N., 1/01/1999, In: European Journal of Operational Research. 112, 1, p. 122-133 12 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  75. Published

    Action rules extracted by machine induction from feature-coded self reports

    Letchford, A. N. & Clarke, D. D., 1998, In: Journal of Social Behavior and Personality. 13, p. 33-50 18 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  76. Published

    New inequalities for the general routing problem

    Letchford, A. N., 24/01/1997, In: European Journal of Operational Research. 96, 2, p. 317-322 6 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  77. Published

    The general routing problem

    Letchford, A. N. & Eglese, R. W., 2001, Encyclopedia of Optimization, Vol II (E - Integer). Floudas, C. H. & Pardalos, P. M. (eds.). Dordrecht: Kluwer Academic Publishers, p. 206-207 2 p.

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Entry for encyclopedia/dictionary

  78. Published

    Totally tight Chvatal-Gomory cuts

    Letchford, A. N., 2002, In: Operations Research Letters. 30, 2, p. 71-73 3 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  79. Published

    Strengthening Chvatal-Gomory cuts and Gomory fractional cuts

    Letchford, A. N. & Lodi, A., 04/2002, In: Operations Research Letters. 30, 2, p. 74-82 9 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  80. Published

    On disjunctive cuts for combinatorial optimization

    Letchford, A. N., 09/2001, In: Journal of Combinatorial Optimization. 5, 3, p. 299-315 17 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  81. Published

    Primal cutting plane algorithms revisited

    Letchford, A. N. & Lodi, A., 08/2002, In: Mathematical Methods of Operational Research. 56, 1, p. 67-81 15 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  82. Published

    An augment-and-branch-and-cut framework for mixed 0-1 programming

    Letchford, A. N. & Lodi, A., 2003, Combinatorial Optimization : Eureka! You Shrink. Jünger, M., Reinelt, G. & Rinaldi, G. (eds.). Berlin: Springer, p. 119-133 15 p. (Lecture Notes in Computer Science ; vol. 2570).

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

  83. Published

    Binary clutter inequalities for integer programs

    Letchford, A. N., 2003, In: Mathematical Programming. 98, 1-3, p. 201-221 21 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  84. Published

    Primal separation algorithms

    Letchford, A. N. & Lodi, A., 10/2003, In: 4OR: A Quarterly Journal of Operations Research. 1, 3, p. 209-224 16 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  85. Published

    A new branch-and-cut algorithm for the capacitated vehicle routing problem

    Letchford, A. N., Eglese, R. W. & Lysgaard, J., 2004, In: Mathematical Programming. 100, 2, p. 423-445 23 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  86. Published

    A faster exact separation algorithm for blossom inequalities

    Letchford, A. N., Reinelt, G. & Theis, D. O., 2004, Integer Programming and Combinatorial Optimization : Proceedings of the 10th International IPCO Conference. Nemhauser, G. & Bienstock, D. (eds.). Berlin: Springer, p. 19-52 34 p. (Lecture Notes in Computer Science; vol. 3064).

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed)

  87. Published

    A fast algorithm for minimum weight odd cuts and circuits in planar graphs

    Letchford, A. N. & Pearson, N., 2005, In: Operations Research Letters. 33, 6, p. 625-628 4 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  88. Published

    Projection results for vehicle routing

    Letchford, A. N. & Salazar, J. J., 2006, In: Mathematical Programming. 105, 2-3, p. 251-274 24 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  89. Published

    Exploiting planarity in separation routines for the symmetric travelling salesman problem

    Letchford, A. N. & Pearson, N., 2005, Lancaster University: The Department of Management Science, (Management Science Working Paper Series).

    Research output: Working paper

  90. Published

    Allocation of school bus contracts by integer programming

    Letchford, A. N., 1996, In: Journal of the Operational Research Society. 47, 3, p. 369-372 4 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  91. Published

    Review of "Introduction to the Theory of Cooperative Games"

    Letchford, A. N., 2004, In: Journal of the Operational Research Society. 55, 7, p. 787-788 2 p.

    Research output: Contribution to Journal/Magazine › Book/Film/Article review › peer-review

  92. Published

    Review of "The Vehicle Routing Problem"

    Letchford, A. N., 07/2004, In: Operations Research Letters. 32, 4, p. 392-393 2 p.

    Research output: Contribution to Journal/Magazine › Book/Film/Article review › peer-review

  93. Published

    Review of "Approximation Algorithms"

    Letchford, A. N., 07/2002, In: Journal of the Operational Research Society. 53, 7, p. 807-808 2 p.

    Research output: Contribution to Journal/Magazine › Book/Film/Article review › peer-review

  94. Published

    Review of "Model Building in Mathematical Programming"

    Letchford, A. N., 2000, In: Journal of the Operational Research Society. 51, 10, p. 1212-1213 2 p.

    Research output: Contribution to Journal/Magazine › Book/Film/Article review › peer-review

  95. Published

    Odd minimum cut-sets and b-matchings revisited

    Letchford, A. N., Reinelt, G. & Theis, D. O., 2008, In: SIAM Journal on Discrete Mathematics. 22, 4, p. 1480-1487 8 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  96. Published

    Review of "Optimization with binet matrices"

    Letchford, A. N., 2007, In: Mathematical Reviews.

    Research output: Contribution to Journal/Magazine › Book/Film/Article review › peer-review

  97. Published

    A branch-and-cut algorithm for the capacitated open vehicle routing problem

    Letchford, A. N., Lysgaard, J. & Eglese, R. W., 2006, Lancaster University: The Department of Management Science, (Management Science Working Paper Series).

    Research output: Working paper

  98. Published

    Review of "Theory of Linear and Integer Programming"

    Letchford, A. N., 2000, In: Journal of the Operational Research Society. 51, 7, p. 892-893 2 p.

    Research output: Contribution to Journal/Magazine › Book/Film/Article review › peer-review

  99. Published

    Good triangulations yield good tours

    Letchford, A. N. & Pearson, N., 2008, In: Computers and Operations Research. 35, 2, p. 638-647 10 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  100. Published

    Exploiting planarity in separation routines for the symmetric travelling salesman problem

    Letchford, A. N. & Pearson, N., 2008, In: Discrete Optimization. 5, 2, p. 220-230 11 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

Previous 1 2 Next

Back to top