Home > Research > Browse

Research

Results for branch-and-cut

Publications & Outputs

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

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

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

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

  5. The ring/k-rings network design problem: model and branch-and-cut algorithm

    Rodriguez-Martin, I., Salazar-Gonzalez, J-J. & Yaman, H., 09/2016, In: Networks. 68, 2, p. 130-140 11 p.

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

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

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

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

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

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

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

More results »