Home > Research > Browse

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 journalJournal article

  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 journalJournal article

  3. Exploiting planarity in separation routines for the TSP

    Letchford, A., 07/2006.

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

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

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

  6. A faster exact separation algorithm for simple comb inequalities

    Letchford, A., 03/2004. 1 p.

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

  7. 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 journalJournal article

  8. Good allocations for traveling salesman and vehicle routing games

    Letchford, A., 02/2003. 1 p.

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

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

  10. On clutters, cutting planes and combs

    Letchford, A., 05/2002. 2 p.

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

  11. Polynomial-time separation of simple comb inequalities

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

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

More results »

??????

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