Home > Research > Browse

Research

Results for knapsack problems

Publications & Outputs

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

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

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

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

  5. Separation algorithms for 0-1 knapsack polytopes

    Letchford, A., 11/2008. 1 p.

    Research output: Contribution to conference - Without ISBN/ISSN › Conference paper › peer-review

  6. Separation algorithms for 0-1 knapsack polytopes

    Letchford, A., 01/2008. 1 p.

    Research output: Contribution to conference - Without ISBN/ISSN › Conference paper › peer-review