Home > Research > Browse

Results for combinatorial optimisation

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. Arc routing problems

    Eglese, R. & Letchford, A., 30/01/2024, (Accepted/In press) Encyclopedia of Optimization. Pardalos, P. & Prokopyev, O. (eds.). 3rd ed. Springer

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNEntry for encyclopedia/dictionary

  3. On cut polytopes and graph minors

    Kaparis, K., Letchford, A. & Mourtos, I., 30/11/2023, In: Discrete Optimization. 50, 100807.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  4. On some lower bounds for the permutation flowshop problem

    Letchford, A., Dang, T. & Caceres Gelvez, S., 30/11/2023, In: Computers and Operations Research. 159, 9 p., 106320.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  5. A survey on exact algorithms for the maximum flow and minimum-cost flow problems

    Cruz Mejía, O. & Letchford, A., 30/09/2023, In: Networks. 82, 2, p. 167-176 10 p.

    Research output: Contribution to Journal/MagazineReview articlepeer-review

  6. Fast upper and lower bounds for a large-scale real-world arc routing problem

    Boyacı, B., Dang, T. & Letchford, A., 31/01/2023, In: Networks. 81, 1, p. 107-124 18 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  7. Improving a constructive heuristic for the general routing problem

    Boyacı, B., Dang, T. & Letchford, A., 31/01/2023, In: Networks. 81, 1, p. 93-106 14 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

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

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

  10. The Boolean quadric polytope

    Letchford, A., 1/05/2022, The Quadratic Unconstrained Binary Optimization Problem: Theory, Algorithms, and Applications. Punnen, A. (ed.). Cham, Switzerland: Springer, p. 97-120 24 p.

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNChapter (peer-reviewed)peer-review

  11. Generalised 2-circulant inequalities for the max-cut problem

    Kaparis, K., Letchford, A. & Mourtos, I., 31/03/2022, In: Operations Research Letters. 50, 2, p. 122-128 7 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

More results »

??????

  1. Cutting-Plane Approaches to Integer Programming

    Letchford, A., Amaral, A., Caprara, A., Fischetti, M. & Lodi, A.

    1/01/97 → …

    Project: NonFunded ProjectResearch

  2. Algorithms for the Travelling Salesman Problem

    Letchford, A., Caprara, A., Fischetti, M., Fleischer, L., Lodi, A., Dehghan Nasiri, S. & Pearson, N.

    1/01/99 → …

    Project: NonFunded ProjectResearch

  3. Algorithms for Vehicle Routing Problems

    Letchford, A., Eglese, R., Lysgaard, J., Dehghan Nasiri, S. & Salazar-González, J.

    1/01/03 → …

    Project: NonFunded ProjectResearch