Home > Research > Browse

Results for global optimisation

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/MagazineJournal articlepeer-review

  2. A binarisation heuristic for non-convex quadratic programming with box constraints

    Galli, L. & Letchford, A. N., 1/09/2018, In: Operations Research Letters. 46, 5, p. 529-533 5 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  3. Unbounded convex sets for non-convex mixed-integer quadratic programming

    Burer, S. & Letchford, A., 1/02/2014, In: Mathematical Programming. 143, 1-2, p. 231-256 26 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

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

  5. On non-convex quadratic programming with box constraints

    Burer, S. & Letchford, A. N., 2009, In: SIAM Journal on Optimization. 20, 2, p. 1073-1089 17 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review