Home > Research > Researchers > Professor Adam Letchford > Publications

Research

Professor Adam Letchford

Professor

1 - 100 out of 190Page size: 100
RSS feed of this list
  1. 2021
  2. Published

    Valid inequalities for quadratic optimisation with domain constraints

    Galli, L. & Letchford, A., 31/08/2021, In: Discrete Optimization. 41, 19 p., 100661.

    Research output: Contribution to journal › Journal article › peer-review

  3. E-pub ahead of print

    Newsvendor problems: An integrated method for estimation and optimisation

    Letchford, A., Liu, C. & Svetunkov, I., 16/08/2021, In: European Journal of Operational Research.

    Research output: Contribution to journal › Journal article › peer-review

  4. Published

    A separation algorithm for the simple plant location problem

    Galli, L. & Letchford, A., 31/07/2021, In: Operations Research Letters. 49, 4, p. 610-615 6 p.

    Research output: Contribution to journal › Journal article › peer-review

  5. Published

    On the complexity of surrogate and group relaxation for integer linear programs

    Dokka, T., Letchford, A. & Mansoor, H., 31/07/2021, In: Operations Research Letters. 49, 4, p. 530-534 5 p.

    Research output: Contribution to journal › Journal article › peer-review

  6. Published

    Strengthened clique-family inequalities for the stable set polytope  

    Letchford, A. & Ventura, P., 31/07/2021, In: Operations Research Letters. 49, 4, p. 586-589 4 p.

    Research output: Contribution to journal › Journal article › peer-review

  7. Published

    Vehicle routing on road networks: how good is Euclidean approximation?

    Boyacı, B., Dang, T. & Letchford, A., 1/05/2021, In: Computers and Operations Research. 129, 13 p., 105197.

    Research output: Contribution to journal › Journal article › peer-review

  8. E-pub ahead of print

    On matchings, T-joins and arc routing problems

    Boyacı, B., Dang, T. & Letchford, A., 5/03/2021, In: Networks.

    Research output: Contribution to journal › Journal article › peer-review

  9. Published

    Facets from gadgets

    Letchford, A. & Vu, A., 1/01/2021, In: Mathematical Programming. 185, 1-2, p. 297-314 18 p.

    Research output: Contribution to journal › Journal article › peer-review

  10. 2020
  11. Published

    The stable set problem: clique and nodal inequalities revisited

    Letchford, A., Rossi, F. & Smriglio, S., 30/11/2020, In: Computers and Operations Research. 123, 16 p., 105024.

    Research output: Contribution to journal › Journal article › peer-review

  12. Published

    On matroid parity and matching polytopes

    Kaparis, K., Letchford, A. & Mourtos, I., 30/09/2020, In: Discrete Applied Mathematics. 284, p. 322-331 10 p.

    Research output: Contribution to journal › Journal article › peer-review

  13. Published

    Lifting the knapsack cover inequalities for the knapsack polytope

    Letchford, A. & Souli, G., 1/09/2020, In: Operations Research Letters. 48, 5, p. 607-611 5 p.

    Research output: Contribution to journal › Journal article › peer-review

  14. Published

    Using ℓp-norms for fairness in combinatorial optimisation

    Bektas, T. & Letchford, A., 1/08/2020, In: Computers and Operations Research. 120, 11 p., 104975.

    Research output: Contribution to journal › Journal article › peer-review

  15. E-pub ahead of print

    Biperspective functions for mixed-integer fractional programs with indicator variables

    Letchford, A., Ni, Q. & Zhong, Z., 30/05/2020, In: Mathematical Programming. 0, p. 0-0 17 p.

    Research output: Contribution to journal › Journal article › peer-review

  16. Published

    Adaptive policies for perimeter surveillance problems

    Grant, J. A., Leslie, D. S., Glazebrook, K., Szechtman, R. & Letchford, A., 16/05/2020, In: European Journal of Operational Research. 283, 1, p. 265-278 14 p.

    Research output: Contribution to journal › Journal article › peer-review

  17. Published

    Valid inequalities for mixed-integer programmes with fixed charges on sets of variables

    Letchford, A. & Souli, G., 1/05/2020, In: Operations Research Letters. 48, 3, p. 240-244 5 p.

    Research output: Contribution to journal › Journal article › peer-review

  18. E-pub ahead of print

    A cut-and-branch algorithm for the quadratic knapsack problem

    Djeumou Fomeni, F., Kaparis, K. & Letchford, A., 4/03/2020, In: Discrete Optimization. 18 p., 100579.

    Research output: Contribution to journal › Journal article › peer-review

  19. Published

    A heuristic for fair dynamic resource allocation in over-loaded OFDMA systems

    Letchford, A., Ni, Q. & Zhong, Z., 1/02/2020, In: Journal of Heuristics. 26, 1, p. 21-32 12 p.

    Research output: Contribution to journal › Journal article › peer-review

  20. 2019
  21. Published

    New valid inequalities for the fixed-charge and single-node flow polytopes

    Letchford, A. & Souli, G., 1/09/2019, In: Operations Research Letters. 47, 5, p. 353-357 5 p.

    Research output: Contribution to journal › Journal article › peer-review

  22. Published

    Detecting changes in slope with an L0 penalty

    Fearnhead, P., Maidstone, R. & Letchford, A., 1/06/2019, In: Journal of Computational and Graphical Statistics. 28, 2, p. 265-275 11 p.

    Research output: Contribution to journal › Journal article › peer-review

  23. Published

    On lifted cover inequalities: a new lifting procedure with unusual properties

    Letchford, A. N. & Souli, G., 17/01/2019, In: Operations Research Letters. 47, 2, p. 83-88 6 p.

    Research output: Contribution to journal › Journal article › peer-review

  24. Published

    The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time

    Letchford, A. N. & Salazar Gonzalez, J. J., 1/01/2019, In: European Journal of Operational Research. 272, 1, p. 24–31 8 p.

    Research output: Contribution to journal › Journal article › peer-review

  25. 2018
  26. Published

    A guide to conic optimisation and its applications

    Letchford, A. N. & Parkes, A. J., 11/2018, In: RAIRO Operations Research. 52, 4, p. 1087-1106 20 p.

    Research output: Contribution to journal › Journal article › peer-review

  27. Published

    New valid inequalities and facets for the simple plant location problem

    Galli, L., Letchford, A. N. & Miller, S., 16/09/2018, In: European Journal of Operational Research. 269, 3, p. 824-833 10 p.

    Research output: Contribution to journal › Journal article › peer-review

  28. Published

    A binarisation heuristic for non-convex quadratic programming with box constraints

    Galli, L. & Letchford, A. N., 1/09/2018, In: Operations Research Letters. 46, 5, p. 529-533 5 p.

    Research output: Contribution to journal › Journal article › peer-review

  29. Published

    A heuristic for maximising energy efficiency in OFDMA systems with QoS constraints

    Letchford, A. N., Ni, Q. & Zhong, Z., 1/07/2018, Combinatorial Optimization: 5th International Symposium. Lee, J., Rinaldi, G. & Mahjoub, A. R. (eds.). Springer, p. 303-312 10 p. (Lecture Notes in Computer Science; vol. 10856).

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

  30. Published

    A note on the 2-circulant inequalities for the max-cut problem

    Kaparis, K. & Letchford, A. N., 07/2018, In: Operations Research Letters. 46, 4, p. 443-447 5 p.

    Research output: Contribution to journal › Journal article › peer-review

  31. Published

    A two-level graph partitioning problem arising in mobile wireless communications

    Fairbrother, J., Letchford, A. N. & Briggs, K., 04/2018, In: Computational Optimization and Applications. 69, 3, p. 653-676 24 p.

    Research output: Contribution to journal › Journal article › peer-review

  32. 2017
  33. Published

    Projection results for the k-partition problem

    Fairbrother, J. & Letchford, A. N., 8/11/2017, In: Discrete Optimization. 26, p. 97-111 15 p.

    Research output: Contribution to journal › Journal article › peer-review

  34. Published

    A note on representations of linear inequalities in non-convex mixed-integer quadratic programs

    Letchford, A. N. & Grainger, D., 6/11/2017, In: Operations Research Letters. 45, 6, p. 631-634 4 p.

    Research output: Contribution to journal › Journal article › peer-review

  35. Published

    An exact algorithm for a resource allocation problem in mobile wireless communications

    Letchford, A. N., Ni, Q. & Zhong, Z., 09/2017, In: Computational Optimization and Applications. 68, 2, p. 193-208 16 p.

    Research output: Contribution to journal › Journal article › peer-review

  36. Published

    On the Lovász theta function and some variants

    Galli, L. & Letchford, A. N., 27/07/2017, In: Discrete Optimization. 25, p. 159-174 16 p.

    Research output: Contribution to journal › Journal article › peer-review

  37. 2016
  38. Published

    Strengthening Chvátal-Gomory cuts for the stable set problem

    Letchford, A. N., Marzi, F., Rossi, F. & Smriglio, S., 10/09/2016, Combinatorial Optimization: 4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers. Cerulli, R., Fujishige, S. & Mahjoub, A. R. (eds.). Berlin: Springer, p. 201-212 12 p. (Lecture Notes in Computer Science; vol. 9849).

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

  39. Published

    Some hard combinatorial optimisation problems from mobile wireless communications

    Letchford, A. N., 18/05/2016. 2 p.

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

  40. Published

    Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem

    Letchford, A. & Salazar Gonzalez, J. J., 16/05/2016, In: European Journal of Operational Research. 251, 1, p. 74-84 11 p.

    Research output: Contribution to journal › Journal article › peer-review

  41. 2015
  42. Published

    Review of "Integer Programming” by Conforti et al.

    Letchford, A. & Marecek, J., 1/10/2015, In: Interfaces. 45, 5, p. 481-482 2 p.

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

  43. Published

    The Steiner travelling salesman problem with correlated costs

    Letchford, A. & Nasiri, S., 16/08/2015, In: European Journal of Operational Research. 245, 1, p. 62–69 8 p.

    Research output: Contribution to journal › Journal article › peer-review

  44. Published

    Ellipsoidal relaxations of the stable set problem: theory and algorithms

    Giandomenico, M., Letchford, A., Rossi, F. & Smriglio, S., 1/08/2015, In: SIAM Journal on Optimization. 25, 3, p. 1944-1963 20 p.

    Research output: Contribution to journal › Journal article › peer-review

  45. Published

    Stronger multi-commodity flow formulations of the capacitated vehicle routing problem

    Letchford, A. & Salazar Gonzalez, J. J., 1/08/2015, In: European Journal of Operational Research. 244, 3, p. 730-738 9 p.

    Research output: Contribution to journal › Journal article › peer-review

  46. Published

    The simple plant location problem: new inequalities, facets and separation algorithms

    Letchford, A., Galli, L. & Miller, S., 13/07/2015.

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

  47. Published

    Preface: The 2013 Newton Institute programme on polynomial optimisation

    Letchford, A., Lasserre, J. B., Parrilo, P. A. & Steurer, D., 07/2015, In: Mathematical Programming. 151, 2, p. 375–377 3 p.

    Research output: Contribution to journal › Editorial › peer-review

  48. Published

    A cut-and-branch algorithm for the quadratic knapsack problem

    Letchford, A., Djeumou Fomeni, F. & Kaparis, K., 15/06/2015.

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

  49. Published

    Cutting planes for RLT relaxations of mixed 0-1 polynomial programs

    Djeumou Fomeni, F., Kaparis, K. & Letchford, A., 2015, In: Mathematical Programming. 151, 2, p. 639–658 20 p.

    Research output: Contribution to journal › Journal article › peer-review

  50. 2014
  51. Published

    Pricing routines for vehicle routing with time windows on road networks

    Letchford, A., Nasiri, S. D. & Oukil, A., 11/2014, In: Computers and Operations Research. 51, p. 331-337 7 p.

    Research output: Contribution to journal › Journal article › peer-review

  52. Published

    A new separation algorithm for the Boolean quadric and cut polytopes

    Letchford, A. & Sorensen, M. M., 2/08/2014, In: Discrete Optimization. 14, p. 61-71 11 p.

    Research output: Contribution to journal › Journal article › peer-review

  53. Published

    An aggressive reduction scheme for the simple plant location problem

    Letchford, A. & Miller, S., 1/05/2014, In: European Journal of Operational Research. 234, 3, p. 674-682 9 p.

    Research output: Contribution to journal › Journal article › peer-review

  54. Published

    A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs

    Galli, L. & Letchford, A., 04/2014, In: Optimization Letters. 8, 4, p. 1213-1224 12 p.

    Research output: Contribution to journal › Journal article › peer-review

  55. Published

    Unbounded convex sets for non-convex mixed-integer quadratic programming

    Burer, S. & Letchford, A., 1/02/2014, In: Mathematical Programming. 143, 1-2, p. 231-256 26 p.

    Research output: Contribution to journal › Journal article › peer-review

  56. Published

    A dynamic programming heuristic for the quadratic knapsack problem

    Djeumou Fomeni, F. & Letchford, A., 02/2014, In: INFORMS Journal on Computing. 26, 1, p. 173-182 10 p.

    Research output: Contribution to journal › Journal article › peer-review

  57. Published

    Iterated Chvatal-Gomory cuts and the geometry of numbers

    Aliev, I. & Letchford, A., 2014, In: SIAM Journal on Optimization. 24, 3, p. 1294-1312 19 p.

    Research output: Contribution to journal › Journal article › peer-review

  58. Published

    Pricing routines for vehicle routing with time windows on road networks

    Letchford, A. & Nasiri, S. D., 2014, Lancaster University: The Department of Management Science, 20 p. (Lancaster University Management School Working Paper Series; vol. 2014, no. 2).

    Research output: Working paper

  59. 2013
  60. Published

    A polyhedral approach to the single row facility layout problem

    Amaral, A. R. S. & Letchford, A., 10/2013, In: Mathematical Programming. 141, 1-2, p. 453-477 25 p.

    Research output: Contribution to journal › Journal article › peer-review

  61. Published

    Computing upper bounds for the stable set problem using Lagrangian relaxation

    Letchford, A., 05/2013.

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

  62. Published

    Compact formulations of the Steiner traveling salesman problem and related problems

    Letchford, A. & Nasiri, S. D., 2013, In: European Journal of Operational Research. 228, 1, p. 83-92 10 p.

    Research output: Contribution to journal › Journal article › peer-review

  63. 2012
  64. Published

    A new separation algorithm for the Boolean quadric and cut polytopes

    Letchford, A., 08/2012.

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

  65. Published

    Cutting planes for a stochastic network loading problem

    Letchford, A., 07/2012. 1 p.

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

  66. Published

    On the gap inequalities for the max-cut problem

    Letchford, A., 07/2012. 1 p.

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

  67. Published

    Complexity results for the gap inequalities for the max-cut problem

    Galli, L., Kaparis, K. & Letchford, A. N., 05/2012, In: Operations Research Letters. 40, 3, p. 149-152 4 p.

    Research output: Contribution to journal › Journal article › peer-review

  68. Published

    Fast bounding procedures for large instances of the simple plant location problem

    Letchford, A. N. & Miller, S. J., 05/2012, In: Computers and Operations Research. 39, 5, p. 985-990 6 p.

    Research output: Contribution to journal › Journal article › peer-review

  69. Published

    A polyhedral approach to the single-row facility layout problem

    Letchford, A., 03/2012.

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

  70. Published

    Binary positive semidefinite matrices and associated integer polytopes

    Letchford, A. N. & Sorensen, M. M., 02/2012, In: Mathematical Programming. 131, 1-2, p. 253-271 19 p.

    Research output: Contribution to journal › Journal article › peer-review

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

  72. 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 › Journal article › peer-review

  73. Published

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

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

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

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

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

  76. 2011
  77. 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 › Journal article › peer-review

  78. Published

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

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

    Research output: Contribution to journal › Journal article › peer-review

  79. Published

    Some unbounded convex sets arising in non-convex MIQP

    Letchford, A., 06/2011.

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

  80. Published

    Convex hulls for non-convex mixed-integer quadratic programs

    Letchford, A., 05/2011.

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

  81. Published

    A tutorial on non-convex mixed-integer nonlinear programming

    Letchford, A., 04/2011.

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

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

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

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

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

  86. 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 › Journal article › peer-review

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

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

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

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

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

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

  93. Published

    Review of “Orbital branching”

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

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

  94. 2010
  95. 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 › Journal article › peer-review

  96. Published

    Generalised network design polyhedra

    Letchford, A., 05/2010.

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

  97. Published

    An introduction to approximation algorithms

    Letchford, A., 03/2010.

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

  98. Published

    Some convex sets related to non-convex quadratic optimisation problems

    Letchford, A., 03/2010.

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

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

  100. 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 › Journal article › peer-review

  101. 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 › Journal article › peer-review

  102. Published

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

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

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

  103. Published

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

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

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

  104. Published

    Review of "Extended formulations in combinatorial optimization"

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

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

  105. Published

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

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

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

  106. Published

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

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

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

  107. 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 › Journal article › peer-review

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

  109. 2009
  110. Published

    A branch-and-cut algorithm for single-row facility layout problems

    Letchford, A., 09/2009.

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

  111. Published

    A polyhedral approach to single-row facility layout problems

    Letchford, A., 07/2009.

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

  112. Published

    Knapsack-based cutting planes for the max-cut problem

    Letchford, A., 04/2009.

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

  113. Published

    Mixed-integer non-linear programming: a survey

    Letchford, A., 02/2009.

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

Previous 1 2 Next

Back to top