Home > Research > Browse

Results for cutting planes

Publications & Outputs

  1. Valid inequalities for quadratic optimisation with domain constraints

    Galli, L. & Letchford, A., 15/07/2021, (Accepted/In press) In: Discrete Optimization.

    Research output: Contribution to journalJournal articlepeer-review

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

  3. 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 journalJournal articlepeer-review

  4. 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 journalJournal articlepeer-review

  5. 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 journalJournal articlepeer-review

  6. 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 journalJournal articlepeer-review

  7. Knapsack-based cutting planes for the max-cut problem

    Letchford, A., 04/2009.

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

  8. Separation algorithms for 0-1 knapsack polytopes

    Letchford, A., 11/2008. 1 p.

    Research output: Contribution to conference - Without ISBN/ISSN Conference paperpeer-review

  9. 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 journalJournal articlepeer-review

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

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

More results »

??????

  1. Cutting-Plane Approaches to Integer Programming

    Letchford, A., Amaral, A., Caprara, A., Fischetti, M. & Lodi, A.

    1/01/97 → …

    Project: NonFunded ProjectResearch