The sequencing of point operations on a CNC-machining centre using a microcomputer

References

• CHRISTOFIDES , N. , 1975 , Graph Theory An Algorithmic Approach ( New York Academic Press ).
   Google Scholar
• HELD , M. and KARP , R. M. , 1970 , The travelling salesman problem and minimum spanning trees . Operations Research , 18 , 1138 – 1162 .
   Web of Science ®Google Scholar
• HELD , M. and KARP , R. M. , 1971 , The travelling salesman problem and minimum spanning trees, part II . Mathematical Programming , 1 , 6 – 25 .
   Google Scholar
• JONGENS , K. and VOLGENANT , T. , 1985 , The symmetric clustered travelling salesman problem . European Journal of Operational Research , 19 , 68 – 75 .
   Web of Science ®Google Scholar
• LAWLER , E. L. , LENSTRA , J. K. , RINNOOY KAN , A. H. C. and SHMOYS , D. B. , 1985 , The Travelling Salesman Problem , ( Chichester Wiley ).
   Google Scholar
• LIN , S. , 1965 , Computer solutions of the travelling salesman problem . Bell System Technical Journal , 44 , 2245 – 2269 .
   Google Scholar
• LOKIN , F. C. J. , 1978 , Procedures for traveling salesman problems with additional constraints . European Journal of Operational Research , 3 , 135 – 141 .
   Google Scholar
• VOLGENANT , T. and JONKER , R. , 1982 , A branch and bound algorithm for the travelling salesman problem based on 1-tree relaxation . European Journal of Operational Research , 9 , 83 – 89 .
   Google Scholar