Home > Research > Researchers > Professor Adam Letchford > Publications

Professor Adam Letchford

Head of Department, Professor

  1. 2010
  2. Published

    Separation algorithms for 0-1 knapsack polytopes

    Kaparis, K. & Letchford, A., 07/2010, In: Mathematical Programming. 124, 1-2, p. 69-91 23 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  3. Published

    Integer quadratic quasi-polyhedra

    Letchford, A. N., 2010, Integer Programming and Combinatorial Optimization: Proceedings of the 14th International IPCO Conference. Eisenbrand, F. & Shepherd, F. B. (eds.). Berlin: Springer, p. 258-270 13 p. (Lecture Notes in Computer Science; vol. 6080).

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

  4. Published

    New techniques for cost sharing in combinatorial optimization games

    Caprara, A. & Letchford, A. N., 2010, In: Mathematical Programming. 124, 1-2, p. 93-118 26 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  5. Published

    On a class of metrics related to graph layout problems

    Letchford, A. N., Reinelt, G., Seitz, H. & Theis, D. O., 2010, In: Linear Algebra and its Applications. 433, 11-12, p. 1760-1777 18 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  6. Published

    Review of "Applying mod-k-cuts for solving linear ordering problems"

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

    Research output: Contribution to Journal/MagazineBook/Film/Article reviewpeer-review

  7. Published

    Review of "Coefficient strengthening: a tool for reformulating mixed-integer programs"

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

    Research output: Contribution to Journal/MagazineBook/Film/Article reviewpeer-review

  8. Published

    Review of "Extended formulations in combinatorial optimization"

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

    Research output: Contribution to Journal/MagazineBook/Film/Article reviewpeer-review

  9. Published

    Review of "Gear composition of stable set polytopes and G-perfection"

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

    Research output: Contribution to Journal/MagazineBook/Film/Article reviewpeer-review

  10. Published

    Review of "Minimal inequalities for an infinite relaxation of integer programs"

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

    Research output: Contribution to Journal/MagazineBook/Film/Article reviewpeer-review

  11. 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/MagazineJournal articlepeer-review

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

  13. 2009
  14. Published

    An application of the Lovasz-Schrijver M(K,K) operator to the stable set problem

    Giandomenico, M., Letchford, A. N., Rossi, F. & Smriglio, S., 2009, In: Mathematical Programming. 120, 2, p. 381-401 21 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  15. Published

    Exploiting sparsity in pricing routines for the capacitated arc routing problem

    Letchford, A. N. & Oukil, A., 2009, In: Computers and Operations Research. 36, 7, p. 2320-2327 8 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  16. Published

    On non-convex quadratic programming with box constraints

    Burer, S. & Letchford, A. N., 2009, In: SIAM Journal on Optimization. 20, 2, p. 1073-1089 17 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  17. Published

    Review of "A note on the continuous mixing sets"

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

    Research output: Contribution to Journal/MagazineBook/Film/Article reviewpeer-review

  18. Published

    Review of "Generalized mixed integer rounding inequalities: facets for infinite group polyhedra

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

    Research output: Contribution to Journal/MagazineBook/Film/Article reviewpeer-review

  19. Published

    Review of "Local cuts revisited"

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

    Research output: Contribution to Journal/MagazineBook/Film/Article reviewpeer-review

  20. Published

    Review of "MIR closures of polyhedral sets"

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

    Research output: Contribution to Journal/MagazineBook/Film/Article reviewpeer-review

  21. 2008
  22. 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/ISSNEntry for encyclopedia/dictionary

  23. Published

    Local and global lifted cover inequalities for the multidimensional knapsack problem

    Kaparis, K. & Letchford, A. N., 1/04/2008, In: European Journal of Operational Research. 186, 1, p. 91-103 13 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  24. Published

    A new lower bound for the minimum linear arrangement of a graph

    Amaral, A., Caprara, A., Letchford, A. N. & Salazar-Gonzalez, J.-J., 20/02/2008, In: Electronic Notes in Discrete Mathematics. 30, p. 87-92

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  25. Published

    Binary positive semidefinite matrices and associated integer polytopes

    Letchford, A. N. & Sorensen, M. M., 2008, Integer Programming and Combinatorial Optimization : Proceedings of the 13th International IPCO Conference. Lodi, A., Panconesi, A. & Rinaldi, G. (eds.). Berlin: Springer, p. 125-139 15 p. (Lecture Notes in Computer Science; vol. 5035).

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

  26. 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/MagazineJournal articlepeer-review

  27. 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/MagazineJournal articlepeer-review

  28. 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/MagazineJournal articlepeer-review

  29. Published

    Preface: Combinatorial optimization

    Clark, A., Eglese, R., Letchford, A. & Wright, M., 2008, In: Discrete Applied Mathematics. 156, 3, p. 289-290 2 p.

    Research output: Contribution to Journal/MagazineEditorialpeer-review

  30. Published

    Review of "A branch-and-cut algorithm for a resource-constrained scheduling problem"

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

    Research output: Contribution to Journal/MagazineBook/Film/Article reviewpeer-review

  31. Published

    Review of "FPTAS for optimizing polynomials over the mixed-integar points of polytopes in fixed dimension"

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

    Research output: Contribution to Journal/MagazineBook/Film/Article reviewpeer-review

  32. 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/MagazineBook/Film/Article reviewpeer-review

  33. 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/MagazineBook/Film/Article reviewpeer-review

  34. 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/MagazineBook/Film/Article reviewpeer-review

  35. 2007
  36. 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/MagazineBook/Film/Article review

  37. 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/MagazineEditorialpeer-review

  38. 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/MagazineJournal articlepeer-review

  39. 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/MagazineBook/Film/Article reviewpeer-review

  40. 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/MagazineBook/Film/Article reviewpeer-review

  41. Published

    Review of "Optimization with binet matrices"

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

    Research output: Contribution to Journal/MagazineBook/Film/Article reviewpeer-review

  42. 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/MagazineBook/Film/Article reviewpeer-review

  43. 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/MagazineBook/Film/Article reviewpeer-review

  44. 2006
  45. 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/MagazineJournal articlepeer-review

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

  47. 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/MagazineJournal articlepeer-review

  48. 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/MagazineJournal articlepeer-review

  49. 2005
  50. 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/MagazineJournal articlepeer-review

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

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

  53. 2004
  54. 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/MagazineBook/Film/Article reviewpeer-review

  55. 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/ISSNChapter (peer-reviewed)

  56. 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/MagazineJournal articlepeer-review

  57. 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/MagazineBook/Film/Article reviewpeer-review

Back to top