Results for traveling salesman problem

Publications & Outputs

1. Compact formulations of the Steiner traveling salesman problem and related problems

   Letchford, A. & Nasiri, S. D., 2013, In: European Journal of Operational Research. 228, 1, p. 83-92 10 p.

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

2. Computing compatible tours for the traveling salesman problem

   Fortini, M., Letchford, A. N., Lodi, A. & Wenger, K. M., 2011, In: Mathematical Programming Computation. 3, 1, p. 59-78 20 p.

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

3. The compatible tour heuristic for the symmetric traveling salesman problem

   Fortini, M., Letchford, A. N., Lodi, A. & Wenger, K. M., 2010, 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., 2008, In: Discrete Optimization. 5, 2, p. 220-230 11 p.

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

5. Good triangulations yield good tours

   Letchford, A. N. & Pearson, N., 2008, In: Computers and Operations Research. 35, 2, p. 638-647 10 p.

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

6. Binary clutter inequalities for integer programs

   Letchford, A. N., 2003, In: Mathematical Programming. 98, 1-3, p. 201-221 21 p.

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