Home > Research > Researchers > Professor Adam Letchford > Publications

Research

Professor Adam Letchford

Professor

151 - 175 out of 180Page size: 25
RSS feed of this list
  1. 2003
  2. 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

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

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

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

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

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

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

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

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

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

  13. Published

    Multistars, partial multistars and the capacitated vehicle routing problem

    Lysgaard, J., Eglese, R. W. & Letchford, A. N., 2002, In: Mathematical Programming. 94, 1, p. 21-40 20 p.

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

  14. Published

    Polynomial-time separation of simple comb inequalities

    Lodi, A. & Letchford, A. N., 2002, Integer Programming and Combinatorial Optimization: Proceedings of the 9th International IPCO Conference. Cook, W. J. & Schulz, A. S. (eds.). Berlin: Springer, p. 93-108 16 p. (Lecture Notes in Computer Science; vol. 2337).

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

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

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

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

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

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

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

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

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

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

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

  27. 1999
  28. Published

    On comb separation for the TSP

    Letchford, A., 10/01/1999, p. 4. 1 p.

    Research output: Contribution to conference - Without ISBN/ISSN › Conference paper › peer-review

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

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

Previous 1...3 4 5 6 7 8 Next

Back to top