{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:25:26Z","timestamp":1773617126723,"version":"3.50.1"},"reference-count":23,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Autom Remote Control"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1134\/s0005117921030073","type":"journal-article","created":{"date-parts":[[2021,3,21]],"date-time":"2021-03-21T08:02:36Z","timestamp":1616313756000},"page":"468-480","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Software for the Problem of Constructing Cutting Tool Paths in\nCAD\/CAM Systems for Technological Preparation of Cutting Processes"],"prefix":"10.1134","volume":"82","author":[{"given":"T. A.","family":"Makarovskikh","sequence":"first","affiliation":[]},{"given":"A. V.","family":"Panyukov","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2021,3,21]]},"reference":[{"key":"2107_CR1","doi-asserted-by":"publisher","first-page":"1865","DOI":"10.1007\/s00170-016-8609-1","volume":"87","author":"R. Dewil","year":"2016","unstructured":"Dewil, R., Vansteenwegen, P., and Cattrysse, D., A review of cutting path\nalgorithms for laser cutters, Int. J. Adv. Manuf.\nTechnol., 2016, vol. 87, pp. 1865\u20131884. https:\/\/doi.org\/10.1007\/s00170-016-8609-1","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"4","key":"2107_CR2","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1134\/S0005117917050095","volume":"78","author":"T.A. Makarovskikh","year":"2017","unstructured":"Makarovskikh, T.A., Panyukov, A.V., and Savitsky, E.A., Mathematical\nmodels and routing algorithms for CAD technological preparation of cutting processes, Autom. Remote Control, 2017, vol. 78, no. 4,\npp. 868\u2013882.","journal-title":"Autom. Remote Control"},{"issue":"1","key":"2107_CR3","doi-asserted-by":"publisher","first-page":"2284","DOI":"10.1016\/j.ifacol.2017.08.226","volume":"50","author":"T. Makarovskikh","year":"2017","unstructured":"Makarovskikh, T. and Panyukov, A., The cutter trajectory avoiding\nintersections of cuts, IFAC-PapersOnLine, 2017, vol. 50,\nno. 1, pp. 2284\u20132289. https:\/\/doi.org\/10.1016\/j.ifacol.2017.08.226","journal-title":"IFAC-PapersOnLine"},{"key":"2107_CR4","doi-asserted-by":"publisher","unstructured":"Li, X., Liu, Zh., Wang, F., Yi, B., and Song, Y., Combining physical shell\nmapping and reverse-compensation optimisation for spiral machining of free-form surfaces,\nInt. J. Prod. Rts., 2018.\nhttps:\/\/doi.org\/10.1080\/00207543.2018.1512763","DOI":"10.1080\/00207543.2018.1512763"},{"key":"2107_CR5","first-page":"249","volume":"2098","author":"T. Makarovskikh","year":"2018","unstructured":"Makarovskikh, T. and Panyukov, A., Development of routing methods for\ncutting out details, CEUR Workshop Proc., 2018, vol.\n2098, pp. 249\u2013263. http:\/\/ceur-ws.org\/Vol-2098\/paper22.pdf","journal-title":"CEUR Workshop Proc."},{"issue":"6","key":"2107_CR6","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1080\/00207543.2014.959268","volume":"53","author":"R. Dewil","year":"2015","unstructured":"Dewil, R., Vansteenwegen, P., Cattrysse, D., Laguna, M., and Vossen, T., An\nimprovement heuristic framework for the laser cutting tool path problem, Int. J. Prod. Rts., 2015, vol. 53, no. 6, pp. 1761\u20131776.\nhttps:\/\/doi.org\/10.1080\/00207543.2014.959268","journal-title":"Int. J. Prod. Rts."},{"key":"2107_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ifacol.2016.07.544","volume":"49","author":"A. Petunin","year":"2016","unstructured":"Petunin, A. and Stylios, C., optimization models of tool path problem for\nCNC sheet metal cutting machines, IFAC-PapersOnLine, 2016, vol. 49, pp. 23\u201328. https:\/\/doi.org\/10.1016\/j.ifacol.2016.07.544","journal-title":"IFAC-PapersOnLine"},{"issue":"3","key":"2107_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.14529\/mmp170303","volume":"10","author":"A. Petunin","year":"2017","unstructured":"Petunin, A., Chentsov, A.G., and Chentsov, P.A., About routing in the sheet\ncutting, Bull. South Ural State Univ. Ser.: Math. Model. Program.\nComput. Software, 2017, vol. 10, no. 3, pp. 25\u201339. https:\/\/doi.org\/10.14529\/mmp170303","journal-title":"Bull. South Ural State Univ. Ser.: Math. Model. Program. Comput. Software"},{"issue":"1","key":"2107_CR9","doi-asserted-by":"publisher","first-page":"60","DOI":"10.14529\/mmp180106","volume":"11","author":"A.G. Chentsov","year":"2018","unstructured":"Chentsov, A.G., Grigoryev, A.M., and Chentsov, A.A., Solving a routing\nproblem with the aid of an independent computations scheme, Bull.\nSouth Ural State Univ. Ser. Math. Model. Program. Comput. Software, 2018,\nvol. 11, no. 1, pp. 60\u201374. https:\/\/doi.org\/10.14529\/mmp180106","journal-title":"Bull. South Ural State Univ. Ser. Math. Model. Program. Comput. Software"},{"key":"2107_CR10","first-page":"68","volume":"871","author":"M. Khachay","year":"2018","unstructured":"Khachay, M. and Neznakhina, K., Towards tractability of the Euclidean\ngeneralized travelling salesman problem in grid clusters defined by a grid of bounded height,\nCommun. Comput. Inf. Sci., 2018, vol. 871, pp. 68\u201377.\nhttps:\/\/link.springer.com\/chapter\/10.1007\/978-3-319-93800-4_6","journal-title":"Commun. Comput. Inf. Sci."},{"key":"2107_CR11","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.ifacol.2016.07.767","volume":"49","author":"A. Chentsov","year":"2016","unstructured":"Chentsov, A., Khachay, M., and Khachay, D., Linear time algorithm for\nprecedence constrained asymmetric generalized traveling salesman problem, IFAC-PapersOnLine, 2016, vol. 49, pp. 651\u2013655.\nhttps:\/\/doi.org\/10.1016\/j.ifacol.2016.07.767","journal-title":"IFAC-PapersOnLine"},{"key":"2107_CR12","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1023\/A:1018582320737","volume":"29","author":"J. Hoeft","year":"1997","unstructured":"Hoeft, J. and Palekar, U., Heuristics for the plate-cutting traveling salesman\nproblem, IIE Trans., 1997, vol. 29, pp. 719\u2013731.\nhttps:\/\/doi.org\/10.1023\/A:1018582320737","journal-title":"IIE Trans."},{"issue":"20","key":"2107_CR13","doi-asserted-by":"publisher","first-page":"5965","DOI":"10.1080\/00207543.2014.895064","volume":"52","author":"R. Dewil","year":"2014","unstructured":"Dewil, R., Vansteenwegen, P., and Cattrysse, D., Construction heuristics for\ngenerating tool paths for laser cutters, Int. J. Prod.\nRts., 2014, vol. 52, no. 20, pp. 5965\u20135984.\nhttps:\/\/doi.org\/10.1080\/00207543.2014.895064","journal-title":"Int. J. Prod. Rts."},{"key":"2107_CR14","doi-asserted-by":"crossref","unstructured":"Crockford, D., The Application\/json Media Type for JavaScript Object\nNotation (JSON), Internet Engineering Task Force, 2006. https:\/\/www.rfc-editor.org\/info\/rfc4627","DOI":"10.17487\/rfc4627"},{"key":"2107_CR15","unstructured":"Makarovskikh, T.A., Panyukov, A.V., and Savitskiy, E.A., Software for the\nproblem of constructing cutting tool motion path, Tr. XVIII-i\nMezhdunar. molodezhnoi konf. \u201cSistemy proektirovaniya, tekhnologicheskoi podgotovki proizvodstva\ni upravleniya etapami zhiznennogo tsikla promyshlennogo produkta\n(CAD\/CAM\/PDM-2018)\u201d (Proc. XVIII Int. Youth Conf. \u201cDesign Systems for\nIndustrial Technological Preparation and Control over Stages of an Industrial Product Lifecycle\n(CAD\/CAM\/PDM-2018)\u201d) (2018), pp. 172\u2013176."},{"key":"2107_CR16","unstructured":"Makarovskikh, T.A., Panyukov, A.V., and Savitskiy, E.A., Cutting tool\nrouting problem: software implementation, in  Tr. XIII Vseross.\nsoveshchaniya po problemam upravleniya (VSPU-2019) (Proc. XIII All-Russia\nMeeting on Control Problems (VSPU-2019)) Novikov, D.A., Ed., 2019,\npp. 2650\u20132654."},{"key":"2107_CR17","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/j.promfg.2019.02.123","volume":"29","author":"T.A. Makarovskikh","year":"2019","unstructured":"Makarovskikh, T.A., Panyukov, A.V., and Savitskiy, E.A., Software\ndevelopment for cutting tool routing problems, Procedia\nManuf., 2019, vol. 29, pp. 567\u2013574. https:\/\/doi.org\/10.1016\/j.promfg.2019.02.123","journal-title":"Procedia Manuf."},{"issue":"3","key":"2107_CR18","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1080\/00207543.2017.1401746","volume":"5","author":"T.A. Makarovskikh","year":"2018","unstructured":"Makarovskikh, T.A., Panyukov, A.V., and Savitskiy, E.A., Mathematical\nmodels and routing algorithms for economical cutting tool paths, Int.\nJ. Prod. Rts., 2018, vol. 5, no. 3, pp. 1171\u20131188.\nhttps:\/\/doi.org\/10.1080\/00207543.2017.1401746","journal-title":"Int. J. Prod. Rts."},{"key":"2107_CR19","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0166-218X(87)90045-X","volume":"18","author":"U. Manber","year":"1987","unstructured":"Manber, U. and Bent, S.W., On non-intersecting Eulerian circuits, Discrete Appl. Math., 1987, vol. 18, pp. 87\u201394. https:\/\/doi.org\/10.1016\/0166-218X(87)90045-X","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"2107_CR20","doi-asserted-by":"publisher","first-page":"36","DOI":"10.14529\/cmse190103","volume":"8","author":"T.A. Makarovskikh","year":"2019","unstructured":"Makarovskikh, T.A., Software for constructing A-circuits with ordered\nenclosing in a plane connected 4-regular graph, Vestn. Yuzhn.-Ural.\nGos. Univ. Ser. Vychisl. Mat. Inf., 2019, vol. 8, no. 1, pp. 36\u201353. https:\/\/doi.org\/10.14529\/cmse190103","journal-title":"Vestn. Yuzhn.-Ural. Gos. Univ. Ser. Vychisl. Mat. Inf."},{"issue":"4","key":"2107_CR21","doi-asserted-by":"publisher","first-page":"30","DOI":"10.14529\/cmse190403","volume":"8","author":"T.A. Makarovskikh","year":"2019","unstructured":"Makarovskikh, T.A., Constructing nonintersecting $$OE\n$$-routes in a plane Eulerian graph, Vestn. Yuzhn.-Ural. Gos. Univ. Ser. Vychisl. Mat. Inf., 2019, vol.\n8, no. 4, pp. 30\u201342.\nhttps:\/\/doi.org\/10.14529\/cmse190403","journal-title":"Vestn. Yuzhn.-Ural. Gos. Univ. Ser. Vychisl. Mat. Inf."},{"issue":"1","key":"2107_CR22","doi-asserted-by":"publisher","first-page":"5","DOI":"10.14529\/mmph160101","volume":"8","author":"T.A. Makarovskikh","year":"2016","unstructured":"Makarovskikh, T.A., On the number of $$OE\n$$-trails for a fixed transition system, Vestn. Yuzhn.-Ural.Gos. Univ. Ser. Mat. Mekh. Fiz., 2016, vol. 8,\nno. 1, pp. 5\u201312. https:\/\/doi.org\/10.14529\/mmph160101","journal-title":"Vestn. Yuzhn.-Ural. Gos. Univ. Ser. Mat. Mekh. Fiz."},{"key":"2107_CR23","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and Johnson, D.S., Computers and\nIntractability: a Guide to the Theory of NP-Completeness, San Francisco:\nW.H. Freeman, 1979."}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117921030073.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117921030073","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117921030073.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:34:52Z","timestamp":1773614092000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117921030073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["2107"],"URL":"https:\/\/doi.org\/10.1134\/s0005117921030073","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3]]},"assertion":[{"value":"10 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}