Home > Research > Optimisation > Publications & Outputs
View graph of relations

Optimisation

  1. Published

    Vehicle routing on road networks: how good is Euclidean approximation?

    Boyacı, B., Dang, T. & Letchford, A., 1/05/2021, In: Computers and Operations Research. 129, 13 p., 105197.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  2. Published

    Valid inequalities for mixed-integer programmes with fixed charges on sets of variables

    Letchford, A. & Souli, G., 1/05/2020, In: Operations Research Letters. 48, 3, p. 240-244 5 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  3. Published

    Using ℓp-norms for fairness in combinatorial optimisation

    Bektas, T. & Letchford, A., 1/08/2020, In: Computers and Operations Research. 120, 11 p., 104975.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  4. Published

    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

  5. Published

    Tie-breaking can maximize fairness without sacrificing throughput in D2D-assisted networks

    Mancuso, V., Asadi, A. & Jacko, P., 26/07/2016, WoWMoM 2016 - 17th International Symposium on a World of Wireless, Mobile and Multimedia Networks. Institute of Electrical and Electronics Engineers Inc., 7523498

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

  6. Published

    The Steiner travelling salesman problem with correlated costs

    Letchford, A. & Nasiri, S., 16/08/2015, In: European Journal of Operational Research. 245, 1, p. 62–69 8 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  7. Published

    The stable set problem: clique and nodal inequalities revisited

    Letchford, A., Rossi, F. & Smriglio, S., 30/11/2020, In: Computers and Operations Research. 123, 16 p., 105024.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  8. Published

    The Quadratic Shortest Path Problem: Complexity, Approximability, and Solution Methods

    Rostami, B., Chassein, A., Hopf, M., Frey, D., Buchheim, C., Malucelli, F. & Goerigk, M., 16/07/2018, In: European Journal of Operational Research. 268, 2, p. 473-485 13 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  9. Published

    The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time

    Letchford, A. N. & Salazar Gonzalez, J. J., 1/01/2019, In: European Journal of Operational Research. 272, 1, p. 24–31 8 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  10. Published

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

    The algorithm selection problem for solving Sudoku with metaheuristics

    Notice, D., Kheiri, A. & Pavlidis, N., 3/07/2023.

    Research output: Contribution to conference - Without ISBN/ISSN Conference paperpeer-review

  12. Published

    Stronger multi-commodity flow formulations of the capacitated vehicle routing problem

    Letchford, A. & Salazar Gonzalez, J. J., 1/08/2015, In: European Journal of Operational Research. 244, 3, p. 730-738 9 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  13. Published

    Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem

    Letchford, A. & Salazar Gonzalez, J. J., 16/05/2016, In: European Journal of Operational Research. 251, 1, p. 74-84 11 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  14. Published

    Strengthening Chvátal-Gomory cuts for the stable set problem

    Letchford, A. N., Marzi, F., Rossi, F. & Smriglio, S., 10/09/2016, Combinatorial Optimization: 4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers. Cerulli, R., Fujishige, S. & Mahjoub, A. R. (eds.). Berlin: Springer, p. 201-212 12 p. (Lecture Notes in Computer Science; vol. 9849).

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

  15. Published

    Strengthened clique-family inequalities for the stable set polytope  

    Letchford, A. & Ventura, P., 31/07/2021, In: Operations Research Letters. 49, 4, p. 586-589 4 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  16. Published

    Stochastic Models for Dynamic Resource Allocation

    Yarahmadi, A., 22/02/2023, Lancaster University. 197 p.

    Research output: ThesisDoctoral Thesis

  17. Published

    Some hard combinatorial optimisation problems from mobile wireless communications

    Letchford, A. N., 18/05/2016. 2 p.

    Research output: Contribution to conference - Without ISBN/ISSN Conference paperpeer-review

  18. Published

    Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology

    Engau, A., 27/03/2014, In: Asia-Pacific Journal of Operational Research. 31, 4, 18 p., 1450022.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  19. Forthcoming

    Solving Optimal Transmission Switching Problem via DC Power Flow Approximation

    Li, L., Dokka Venkata Satyanaraya, T. & Lulli, G., 23/02/2023, (Accepted/In press) 2023 IEEE PES General Meeting. IEEE, p. 1-5 5 p.

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

  20. Published

    Robust Network Capacity Expansion with Non-linear Costs

    Garuba, F., Goerigk, M. & Jacko, P., 15/11/2019, 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2019. Cacchiani, V. & Marchetti-Spaccamela, A. (eds.). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, p. 5.1-5.13 13 p. (OASICS; vol. 75).

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

  21. Published

    Robust and stochastic approaches to network capacity design under demand uncertainty

    Garuba, F., 06/2020, Lancaster University. 180 p.

    Research output: ThesisDoctoral Thesis

  22. Published

    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

  23. E-pub ahead of print

    Representative scenario construction and preprocessing for robust combinatorial optimization problems

    Goerigk, M. & Hughes, M., 29/10/2018, (E-pub ahead of print) In: Optimization Letters. 15 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  24. Published

    Recent Advances in Selection Hyper-heuristics

    Drake, J. H., Kheiri, A., Özcan, E. & Burke, E. K., 1/09/2020, In: European Journal of Operational Research. 285, 2, p. 405-428 24 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  25. Published

    Proper efficiency and tradeoffs in multiple criteria and stochastic optimization

    Engau, A., 2017, In: Mathematics of Operations Research. 42, 1, p. 119-134 16 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

Previous 1 2 3 4 5 6 Next

Back to top