Results for cutting planes

Publications & Outputs

1. 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/Magazine › Journal article › peer-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/ISSN › Chapter (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 Journal/Magazine › Journal article › peer-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 Journal/Magazine › Journal article › peer-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 Journal/Magazine › Journal article › peer-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 Journal/Magazine › Journal article › peer-review

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

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

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

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

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

More results »

??????

1. Cutting-Plane Approaches to Integer Programming

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

   1/01/97 → …

   Project: NonFunded Project › Research