Polygon plate-cutting with a given order

References

• Hoeft , J. and Palekar , U.S. ( 1997 ) Heuristics for the plate-cutting traveling salesman problem . IIE Transactions , 29 , 719 – 731 .
   Web of Science ®Google Scholar
• Laporte , G. , Mercure , H. and Nobert , Y. ( 1987 ) Generalized traveling salesman problem through n clusters . Discrete Applied Mathematics , 18 , 185 – 197 .
   Web of Science ®Google Scholar
• Noon , C.E. and Bean , J.C. ( 1993 ) An efficient transformation of the generalized traveling salesman problem . INFOR , 31 , 39 – 44 .
   Web of Science ®Google Scholar
• Dror , M. , Stern , H. and Trudeau , P. ( 1987 ) Postman tour on graph with precedence relation on arcs . Networks , 17 , 283 – 294 .
   Web of Science ®Google Scholar
• Dror , M. and Langevin , A. ( 1997 ) A generalized traveling salesman problem approach to the directed clustered rural postman problem . Transportation Science , 31 , 187 – 192 .
   Web of Science ®Google Scholar