Home > Research > Researchers > Professor Adam Letchford > Publications

Research

Professor Adam Letchford

Professor

101 - 125 out of 177Page size: 25
RSS feed of this list
Sort by: Type
  1. Journal article
  2. 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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  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

    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

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

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

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

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

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

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

Previous 1 2 3 4 5 6 7 8 Next

Back to top