The Two-Period Travelling Salesman Problem Applied to Milk Collection in Ireland

Computational Optimization and Applications

Volumn 7, Issue 3, 1997, Pages 291-306

  Butler, Martin ^a   Williams, H Paul ^b   Yarrow, Leslie Ann ^c  

^a UNIVERSITY COLLEGE DUBLIN   (Ireland)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^c BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

Branch and Bound; Cutting planes; Inequalities; Travelling salesman problem

Indexed keywords

ALGEBRA; COMPUTATIONAL METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING;

SYMMETRIC TRAVELLING SALESMAN PROBLEM (STSP);

OPTIMIZATION;

EID: 0031147031     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008608828763     Document Type: Article

References (13)

1. E. Balas, "The prize collecting travelling salesman problem," Networks, vol. 19, pp. 621-636, 1989.
2. P. Bauer, "The circuit polytope: Facets," Report no. 94, p. 153, University of Köln, 1994.
3. M. Fischetti, J.J. Salazar, and P. Toth, "The symmetric generalised travelling salesman polytope," Technical Report DEIS, University of Bologna, 1994.
4. M. Fischetti, J.J. Salazar, and P. Toth, "A branch-and-cut algorithm for the symmetric generalised travelling salesman problem," Technical Report DEIS, University of Bologna, 1994.
5. M. Grötschel and M.W. Padberg, "On the symmetric travelling salesman problem I: Inequalities," Mathematical Programming, vol. 16, pp. 265-280, 1979.
6. A.H. Land, "The solution of 100-city symmetric travelling salesman problems," Research Project, London School of Economics, 1979.
7. E.L. Lawler, J.K. Lenstra, A.H. Rinnooy Kan, and D.B. Shmoys (Eds.), The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimisation, Wiley: Chichester, 1985.
8. P. Miliotis, "Integer programming approaches to the travelling salesman problem," Mathematical Program-ming, vol. 10, pp. 367-378, 1976.
9. P. Miliotis, "Using cutting planes to solve the symmetric travelling salesman problem," Mathematical Programming, vol. 15, pp. 177-178, 1978.
10. G. Nemhauser and L. Wolsey, Integer Programming and Combinatorial Optimisation, Wiley, 1988.
11. M.W. Padberg and G. Rinaldi, "Optimisation of a 532-city symmetric travelling salesman problem by branch and cut," Operations Research Letters, vol. 6, pp. 1-7, 1987.
12. G. Rinaldi and L.A. Yarrow, Optimising a 48-City Travelling Salesman Problem: A Case Study in Combinatorial Problem Solving, preprint R122, IASI-CNR: Rome, 1989.
13. XPRESS-MP Reference Manual, Dash Associates, Blisworth House, Church Lane, Blisworth, Northants NN7 3BX, UK, 1993.