Home > Research > Researchers > Professor Adam Letchford > Publications

Research

Professor Adam Letchford

Professor

126 - 150 out of 177Page size: 25
RSS feed of this list
  1. 2008
  2. Published

    Review of "New cutting-planes for the time and/or precedence-constrained ATSP and directed VRP"

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

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

  3. Published

    Review of "On clique separators, nearly chordal graphs and the maximum weight stable set problem"

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

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

  4. Published

    Review of "Projected Chvátal-Gomory cuts for mixed integer linear programs"

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

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

  5. 2007
  6. Published

    The traveling salesman problem: a book review

    Letchford, A. N. & Lodi, A., 12/2007, In: 4OR: A Quarterly Journal of Operations Research. 5, 4, p. 315-317 3 p.

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

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

  8. Published

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

    Letchford, A. N., Lysgaard, J. & Eglese, R. W., 2007, In: Journal of the Operational Research Society. 58, 12, p. 1642-1651 10 p.

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

  9. Published

    Review of "A new min-cut max-flow ratio for multicommodity flows"

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

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

  10. Published

    Review of "Integer programming formulations for the two 4-hop constrained paths problem"

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

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

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

  12. Published

    Review of "Using critical sets to solve the maximum independent set problem"

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

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

  13. Published

    Review of "Using mixed-integer programming to solve power grid blackout problems"

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

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

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

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

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

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

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

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

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

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

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

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

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

  28. 2003
  29. 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

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

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

Previous 12 3 4 5 6 7 8 Next

Back to top