Home > Research > Browse

Results for knapsack problems

Publications & Outputs

  1. On upper bounds for the multiple knapsack assignment problem

    Galli, L. & Letchford, A., 13/03/2024, (E-pub ahead of print) In: Operations Research Letters. 54, 6 p., 107104.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  2. Revisiting surrogate relaxation for the multidimensional knapsack problem

    Dokka, T., Letchford, A. & Mansoor, H., 30/11/2022, In: Operations Research Letters. 50, 6, p. 674-678 5 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  3. A cut-and-branch algorithm for the quadratic knapsack problem

    Djeumou Fomeni, F., Kaparis, K. & Letchford, A., 31/05/2022, In: Discrete Optimization. 44, 2, 18 p., 100579.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  4. Lifting the knapsack cover inequalities for the knapsack polytope

    Letchford, A. & Souli, G., 1/09/2020, In: Operations Research Letters. 48, 5, p. 607-611 5 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  5. On lifted cover inequalities: a new lifting procedure with unusual properties

    Letchford, A. N. & Souli, G., 17/01/2019, In: Operations Research Letters. 47, 2, p. 83-88 6 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review