Home > Research > Researchers > Professor Adam Letchford > Publications

Research

Professor Adam Letchford

Head of Department, Professor

141 - 150 out of 180Page size: 10
RSS feed of this list
  1. 2006
  2. 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

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

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

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

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

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

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

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

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

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

Previous 1...11 12 13 14 15 16 17 18 Next

Back to top