Home > Research > Browse

Research

Results for travelling salesman problem

Publications & Outputs

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

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

  3. Computing good allocations for combinatorial optimization games

    Caprara, A. & Letchford, A. N., 2005, Lancaster University: The Department of Management Science, (Management Science Working Paper Series).

    Research output: Working paper

  4. Exploiting planarity in separation routines for the symmetric travelling salesman problem

    Letchford, A. N. & Pearson, N., 2005, Lancaster University: The Department of Management Science, (Management Science Working Paper Series).

    Research output: Working paper

  5. Primal separation algorithms

    Letchford, A. N. & Lodi, A., 10/2003, In: 4OR: A Quarterly Journal of Operations Research. 1, 3, p. 209-224 16 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  6. Polynomial-time separation of simple comb inequalities

    Letchford, A. N. & Lodi, A., 2003, Lancaster University: The Department of Management Science, (Management Science Working Paper Series).

    Research output: Working paper

  7. Binary clutter inequalities for integer programs

    Letchford, A. N., 2002, Lancaster University: The Department of Management Science, (Management Science Working Paper Series).

    Research output: Working paper

  8. Polynomial-time separation of simple comb inequalities

    Lodi, A. & Letchford, A. N., 2002, Integer Programming and Combinatorial Optimization: Proceedings of the 9th International IPCO Conference. Cook, W. J. & Schulz, A. S. (eds.). Berlin: Springer, p. 93-108 16 p. (Lecture Notes in Computer Science; vol. 2337).

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

  9. On the separation of maximally violated mod-k cuts

    Caprara, A., Fischetti, M. & Letchford, A. N., 1999, Integer Programming and Combinatorial Optimization: Proceedings of the 7th International IPCO Conference. Cornuéjols, G., Burkard, R. E. & Woeginger, G. J. (eds.). Berlin: Springer, p. 87-98 12 p. (Lecture Notes in Computer Science ; vol. 1610).

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

??????

  1. Algorithms for the Travelling Salesman Problem

    Letchford, A. (Principal Investigator), Caprara, A. (Researcher), Fischetti, M. (Researcher), Fleischer, L. (Researcher), Lodi, A. (Researcher), Dehghan Nasiri, S. (PhD Student) & Pearson, N. (PhD Student)

    1/01/99 → …

    Project: NonFunded Project › Research