Home > Research > Browse

Results for branch-and-cut

Publications & Outputs

  1. 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 journalJournal article

  2. 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 journalJournal article

  3. 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 journalJournal article

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

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

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

  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 journalJournal article

  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 journalJournal article

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

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

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

More results »