메뉴 건너뛰기




Volumn , Issue , 2001, Pages 138-147

Optimal covering tours with turn costs

Author keywords

Approximation algorithms; Covering; Lawn mowing; M guillotine subdivisions; Manufacturing; Milling; NC machining; NP completeness; Polynomial time approximation scheme (PTAS); Traveling salesman problem (TSP); Turn costs

Indexed keywords


EID: 64049083912     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (47)

References (34)
  • 4
    • 0346172087 scopus 로고    scopus 로고
    • Optimal covering tours with turn costs
    • Technical Report 674, TU Berlin, Available at
    • E. M. Arkin, M. A. Bender, E. D. Demaine, S. P. Fekete, J. S. B. Mitchell, and S. Sethia. Optimal covering tours with turn costs. Technical Report 674, TU Berlin, 2000. Available at http://www.math.tu-berlin. de/coga/publications/techreports/2000/ Report-674-2000.html.
    • (2000)
    • Arkin, E.M.1    Bender, M.A.2    Demaine, E.D.3    Fekete, S.P.4    Mitchell, J.S.B.5    Sethia, S.6
  • 5
    • 64049097014 scopus 로고    scopus 로고
    • E. M. Arkin, S. P. Fekete, and J. S. B. Mitchell. The lawnmower problem. In Proc. 5th Canad. Conf. Comput. Geom., pp. 461-466, 1993.
    • E. M. Arkin, S. P. Fekete, and J. S. B. Mitchell. The lawnmower problem. In Proc. 5th Canad. Conf. Comput. Geom., pp. 461-466, 1993.
  • 7
    • 8444226342 scopus 로고    scopus 로고
    • Optimization problems related to zigzag pocket machining
    • E. M. Arkin, M. Held, and C. L. Smith. Optimization problems related to zigzag pocket machining. Algorithmica, 26(2), pp. 197-236, 2000.
    • (2000) Algorithmica , vol.26 , Issue.2 , pp. 197-236
    • Arkin, E.M.1    Held, M.2    Smith, C.L.3
  • 8
    • 64049112095 scopus 로고
    • Minimumlink watchman tours
    • Technical report, SUNY Stony Brook
    • E.M. Arkin, J. S. B. Mitchell, and C. Piatko. Minimumlink watchman tours. Technical report, SUNY Stony Brook, 1994.
    • (1994)
    • Arkin, E.M.1    Mitchell, J.S.B.2    Piatko, C.3
  • 9
    • 0031645196 scopus 로고    scopus 로고
    • Approximation algorithms for multiple-tool miling
    • June 07-10, Minneapolis, Minnesota, United States [doi〉10.1145/276884.276918
    • Sunil Arya, Siu-Wing Cheng, David M. Mount, Approximation algorithms for multiple-tool miling, Proceedings of the fourteenth annual symposium on Computational geometry, p.297-306, June 07-10, 1998, Minneapolis, Minnesota, United States [doi〉10.1145/276884.276918]
    • (1998) Proceedings of the fourteenth annual symposium on Computational geometry , pp. 297-306
    • Arya, S.1    Cheng, S.-W.2    Mount, D.M.3
  • 10
    • 77957088264 scopus 로고    scopus 로고
    • A. A. Assad and B. L. Golden. Arc routing methods and applications. In M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, editors, Network Routing, 8 of Handbooks in Operations Research and Management Science, pp. 375-483. Elsevier Science, Amsterdam, 1995.
    • A. A. Assad and B. L. Golden. Arc routing methods and applications. In M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, editors, Network Routing, volume 8 of Handbooks in Operations Research and Management Science, pp. 375-483. Elsevier Science, Amsterdam, 1995.
  • 11
    • 0033225636 scopus 로고    scopus 로고
    • The Directed Rural Postman Problem with Turn Penalties
    • April
    • Enrique Benavent, David Soler, The Directed Rural Postman Problem with Turn Penalties, Transportation Science, v.33 n.4, p.408-418, April 1999
    • (1999) Transportation Science , vol.33 , Issue.4 , pp. 408-418
    • Benavent, E.1    Soler, D.2
  • 12
    • 51249179364 scopus 로고
    • Triangulating a simple polygon in linear time
    • Bernard Chazelle, Triangulating a simple polygon in linear time, Discrete & Computational Geometry, v.6 n.5, p.485-524, 1991
    • (1991) Discrete & Computational Geometry , vol.6 , Issue.5 , pp. 485-524
    • Chazelle, B.1
  • 13
    • 64049093256 scopus 로고    scopus 로고
    • 3. Clossey, G. Laporte, and P. Soriano. Solving arc routing problems with turn penalties. Technical Report G-2000-05, Le Groupe d'etudes et de recherche en analyse des decisions, Montreal, Canada, 2000.
    • 3. Clossey, G. Laporte, and P. Soriano. Solving arc routing problems with turn penalties. Technical Report G-2000-05, Le Groupe d'etudes et de recherche en analyse des decisions, Montreal, Canada, 2000.
  • 15
    • 0000238217 scopus 로고
    • Arc routing problems, part I: The Chinese postman problem
    • H. A. Eiselt, M. Gendreau, and G. Laporte. Arc routing problems, part I: The Chinese postman problem. Operations Research, 43(2), pp. 231-242, 1995.
    • (1995) Operations Research , vol.43 , Issue.2 , pp. 231-242
    • Eiselt, H.A.1    Gendreau, M.2    Laporte, G.3
  • 16
    • 0000624218 scopus 로고
    • Arc routing problems, part II: The rural postman problem
    • H. A. Eiselt, M. Gendreau, and G. Laporte. Arc routing problems, part II: The rural postman problem. Operations Research, 43(3), pp. 399-414, 1995.
    • (1995) Operations Research , vol.43 , Issue.3 , pp. 399-414
    • Eiselt, H.A.1    Gendreau, M.2    Laporte, G.3
  • 17
    • 0041120435 scopus 로고
    • Ph.D. thesis, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada
    • S. P. Fekete. Geometry and the Travelling Salesman Problem. Ph.D. thesis, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada, 1992.
    • (1992) Geometry and the Travelling Salesman Problem
    • Fekete, S.P.1
  • 21
    • 64049091759 scopus 로고    scopus 로고
    • Martin Held, On the computational geometry of pocket machining, Springer-Verlag New York, Inc., New York, NY, 1991
    • Martin Held, On the computational geometry of pocket machining, Springer-Verlag New York, Inc., New York, NY, 1991
  • 24
    • 0002737249 scopus 로고
    • Computational complexity and the traveling salesman problem
    • E. Lawler, J. Lenstra, A. R. Kan, and D. Shmoys, editors, John Wiley & Sons, New York
    • D. S. Johnson and C. H. Papadimitriou. Computational complexity and the traveling salesman problem. In E. Lawler, J. Lenstra, A. R. Kan, and D. Shmoys, editors, The Traveling Salesman Problem, pp. 68-74. John Wiley & Sons, New York, 1985.
    • (1985) The Traveling Salesman Problem , pp. 68-74
    • Johnson, D.S.1    Papadimitriou, C.H.2
  • 25
    • 0042314676 scopus 로고
    • Link length of rectilinear Hamiltonian tours on grids
    • E. Kranakis, D. Krizanc, and L. Meertens. Link length of rectilinear Hamiltonian tours on grids. Ars Combinatoria, 38, pp. 177-192, 1994.
    • (1994) Ars Combinatoria , vol.38 , pp. 177-192
    • Kranakis, E.1    Krizanc, D.2    Meertens, L.3
  • 29
    • 0002008783 scopus 로고    scopus 로고
    • Geometric shortest paths and network optimization
    • J.-R. Sack and J. Urrutia, editors, chapter 15, pp, Elsevier Science Publishers B.V. North-Holland, Amsterdam
    • J. S. B. Mitchell. Geometric shortest paths and network optimization. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, chapter 15, pp. 633-701. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
    • (2000) Handbook of Computational Geometry , pp. 633-701
    • Mitchell, J.S.B.1
  • 30
    • 64049094185 scopus 로고    scopus 로고
    • E. M. Molada and D. S. Ferngmdez. Exact solution of the Chinese postman problem with turn penalties. In XV Congress on Differential Equations and Applications/V Congress on Applied Mathematics, I, II (Spanish), Colecc. Congr., 9, pp. 1111-1115, 1998.
    • E. M. Molada and D. S. Ferngmdez. Exact solution of the Chinese postman problem with turn penalties. In XV Congress on Differential Equations and Applications/V Congress on Applied Mathematics, volume I, II (Spanish), Colecc. Congr., 9, pp. 1111-1115, 1998.
  • 33
    • 84869270439 scopus 로고    scopus 로고
    • D. West. An Introduction to Graph Theory. Prentice Hall, 1995. Erik D. Demaine, Sándor P. Fekete, Shmuel Gal, Online searching with turn cost, Theoretical Computer Science, v.361 n.2, p.342-355, 1 September 2006
    • D. West. An Introduction to Graph Theory. Prentice Hall, 1995. Erik D. Demaine, Sándor P. Fekete, Shmuel Gal, Online searching with turn cost, Theoretical Computer Science, v.361 n.2, p.342-355, 1 September 2006


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.