Home > Research > Researchers > Professor Adam Letchford > Publications

Research

Professor Adam Letchford

Professor

76 - 100 out of 177Page size: 25
RSS feed of this list
  1. 2012
  2. 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/Magazine › Journal article › peer-review

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  23. Published

    Review of “Orbital branching”

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

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

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

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

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

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

Previous 1 2 3 4 5 6 7 8 Next

Back to top