Home > Research > Researchers > Professor Adam Letchford > Publications

Research

Professor Adam Letchford

Professor

26 - 50 out of 177Page size: 25
RSS feed of this list
  1. 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

  2. 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

  3. 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

  4. 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

  5. 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

  6. 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

  7. 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

  8. 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

  9. 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

  10. 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

  11. 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

  12. 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

  13. 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

  14. 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

  15. 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

  16. 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

  17. 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

  18. 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

  19. 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

  20. 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

  21. 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

  22. 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

  23. 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

  24. 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

  25. 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

Previous 1 2 3 4 5 6 7 8 Next

Back to top