Home > Research > Researchers > Professor Adam Letchford > Publications

Research

Professor Adam Letchford

Professor

1 - 100 out of 180Page size: 100
RSS feed of this list
  1. 1995
  2. Published

    Rules from behaviour: the use of a computational 'rule-finder' as a tool for social psychology

    Clarke, D. D. & Letchford, A. N., 1995, In: British Psychological Society Social Psychology Section Newsletter. 33, p. 4-13 10 p.

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

  3. 1996
  4. Published

    Allocation of school bus contracts by integer programming

    Letchford, A. N., 1996, In: Journal of the Operational Research Society. 47, 3, p. 369-372 4 p.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  33. 2003
  34. 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

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

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

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

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

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

  40. 2004
  41. 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)

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

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

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

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

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

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

  49. 2006
  50. 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

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

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

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

  54. 2007
  55. 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

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

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

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

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

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

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

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

  63. 2008
  64. 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/ISSN › Chapter (peer-reviewed) › peer-review

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

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

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

  68. 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/Magazine › Editorial › peer-review

  69. 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/Magazine › Book/Film/Article review › peer-review

  70. 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/Magazine › Book/Film/Article review › peer-review

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

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

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

  74. 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/Magazine › Journal article › peer-review

  75. 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/Magazine › Journal article › peer-review

  76. 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/ISSN › Entry for encyclopedia/dictionary

  77. 2009
  78. 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/Magazine › Journal article › peer-review

  79. 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/Magazine › Journal article › peer-review

  80. 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/Magazine › Journal article › peer-review

  81. Published

    Review of "A note on the continuous mixing sets"

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

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

  82. 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/Magazine › Book/Film/Article review › peer-review

  83. Published

    Review of "Local cuts revisited"

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

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

  84. Published

    Review of "MIR closures of polyhedral sets"

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

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

  85. 2010
  86. 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/ISSN › Chapter (peer-reviewed) › peer-review

  87. 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/Magazine › Journal article › peer-review

  88. 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/Magazine › Journal article › peer-review

  89. Published

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

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

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

  90. Published

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

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

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

  91. Published

    Review of "Extended formulations in combinatorial optimization"

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

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

  92. Published

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

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

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

  93. Published

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

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

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

  94. 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/Magazine › Journal article › peer-review

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

  96. 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/Magazine › Journal article › peer-review

  97. Published

    Lower bounds for the minimum linear arrangement of a graph

    Caprara, A., Letchford, A. & Salazar Gonzalez, J. J., 1/08/2010, In: Electronic Notes in Discrete Mathematics. 36, p. 843-849 7 p.

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

  98. 2011
  99. Published

    A new approach to the stable set problem based on ellipsoids

    Giandomenico, M., Letchford, A. N., Rossi, F. & Smriglio, S., 2011, Integer Programming and Combinatorial Optimization : Proceedings of the 15th International IPCO Conference. Günlük, O. & Woeginger, G. (eds.). Berlin: Springer, p. 223-234 12 p. (Lecture Notes in Computer Science; vol. 6655).

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

  100. Published

    A new approach to the stable set problem based on ellipsoids

    Giandomenico, M., Letchford, A. N., Rossi, F. & Smriglio, S., 2011, Lancaster University: The Department of Management Science, (Management Science Working Paper Series).

    Research output: Working paper

  101. Published

    A polyhedral approach to the single row facility layout problem

    Letchford, A. N. & Amaral, A., 2011, Lancaster University: The Department of Management Science, (Management Science Working Paper Series).

    Research output: Working paper

  102. Published

    Computing compatible tours for the traveling salesman problem

    Fortini, M., Letchford, A. N., Lodi, A. & Wenger, K. M., 2011, In: Mathematical Programming Computation. 3, 1, p. 59-78 20 p.

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

  103. Published

    Decorous lower bounds for minimum linear arrangement

    Caprara, A., Letchford, A. N. & Salazar, J. J., 2011, In: INFORMS Journal on Computing. 23, 1, p. 26-40 15 p.

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

  104. Published

    Gap inequalities for non-convex mixed-integer quadratic programs

    Galli, L., Kaparis, K. & Letchford, A. N., 2011, In: Operations Research Letters. 39, 5, p. 297-300 4 p.

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

  105. Published

    Mathematical programming approaches to the traveling salesman problem

    Letchford, A. N. & Lodi, A., 2011, Wiley Encyclopedia of Operations Research and Management Science. Cochran, J. J., Cox, L. A., Keskinocak, P., Kharoufeh, J. P. & Smith, J. C. (eds.). Chichester: John Wiley and Sons Ltd

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Entry for encyclopedia/dictionary

  106. Published

    Reformulating mixed-integer quadratically constrained quadratic programs

    Galli, L. & Letchford, A. N., 2011, Lancaster University: The Department of Management Science, 23 p. (Management Science Working Paper Series; vol. 2011, no. 7).

    Research output: Working paper

  107. Published

    Review of “On the Chvátal rank of linear relaxations of the stable set polytope”

    Letchford, A., 2011, In: Mathematical Reviews.

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

  108. Published

    Review of “On the dominant of the s-t cut polytope: vertices, facets and adjacency”

    Letchford, A., 2011, In: Mathematical Reviews.

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

  109. Published

    Review of “Orbital branching”

    Letchford, A., 2011, In: Mathematical Reviews.

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

  110. Published

    Cover Inequalities

    Kaparis, K. & Letchford, A. N., 02/2011, Wiley Encyclopedia of Operations Research and Management Science. Cochran, J. J., Cox, L. A., Keskinocak, P., Kharoufeh, J. P. & Smith, J. C. (eds.). Wiley

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Entry for encyclopedia/dictionary

  111. Published

    Generalised network design polyhedra

    Feremans, C., Labbé, M., Letchford, A. N. & Salazar-González, J.-J., 09/2011, In: Networks. 58, 2, p. 125-136 12 p.

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

  112. Published

    On the membership problem for the {0, 1/2}-closure

    Letchford, A. N., Pokutta, S. & Schulz, A., 09/2011, In: Operations Research Letters. 39, 5, p. 301-304 4 p.

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

  113. 2012
  114. Published

    Gap inequalities for the max-cut problem: a cutting-plane algorithm

    Galli, L., Kaparis, K. & Letchford, A., 2012, Combinatorial Optimization: Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers. Mahjoub, A. R. (ed.). Berlin: Springer, p. 178-188 11 p. (Lecture Notes in Computer Science; vol. 7422).

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

  115. Published

    Non-convex mixed-integer nonlinear programming: a survey

    Burer, S. & Letchford, A., 2012, In: Surveys in Operations Research and Management Science. 17, 2, p. 97-106 10 p.

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

  116. Published

    Review of “Projecting systems of linear inequalities with binary variables”

    Letchford, A., 2012, In: Mathematical Reviews.

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

  117. Published

    Review of “The Chvátal-Gomory closure of a strictly convex body”.

    Letchford, A., 2012, In: Mathematical Reviews. MR2828758.

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

  118. Published

    Review of “The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization”

    Letchford, A., 2012, In: Interfaces. 42, 3, p. 324-325 2 p.

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

Previous 1 2 Next

Back to top