{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:19:06Z","timestamp":1773656346654,"version":"3.50.1"},"reference-count":28,"publisher":"Pleiades Publishing Ltd","issue":"5","license":[{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"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":[[2017,5]]},"DOI":"10.1134\/s0005117917050095","type":"journal-article","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T00:36:50Z","timestamp":1495499810000},"page":"868-881","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Mathematical models and routing algorithms for CAD technological preparation of cutting processes"],"prefix":"10.1134","volume":"78","author":[{"given":"T. A.","family":"Makarovskikh","sequence":"first","affiliation":[]},{"given":"A. V.","family":"Panyukov","sequence":"additional","affiliation":[]},{"given":"E. A.","family":"Savitskiy","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"key":"627_CR1","volume-title":"Ratsional\u2019nyi raskroi promyshlennykh materialov","author":"L.V. Kantorovich","year":"2012","unstructured":"Kantorovich, L.V. and Zalgaller, V.A., Ratsional\u2019nyi raskroi promyshlennykh materialov (Rational Cutting of Industrial Materials), St. Petersburg: Nevskii Dialekt, 2012."},{"issue":"6","key":"627_CR2","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1134\/S0005117909060113","volume":"70","author":"V.M. Kartak","year":"2009","unstructured":"Kartak, V.M., Mesyagutov, M.A., Mukhacheva, E.A., and Filippova, A.S., Local Search of Orthogonal Packings Using the Lower Bounds, Autom. Remote Control, 2009, vol. 70, no. 6, pp. 1054\u20131066.","journal-title":"Autom. Remote Control"},{"key":"627_CR3","first-page":"73","volume-title":"Proc. All-Russian Conf. Statistics. Modeling. Optimization","author":"A.S. Filippova","year":"2011","unstructured":"Filippova, A.S., A Survey of Methods for Solving Cutting\u2013Packing Problems in the Ufa Science School of E.A. Mukhacheva, Proc. All-Russian Conf. Statistics. Modeling. Optimization, Chelyabinsk, Nov. 28\u2013Dec. 3, 2011, Chelyabinsk: YuUrGU, 2011, pp. 73\u201385."},{"key":"627_CR4","unstructured":"EURO Special Interest Group on Cutting and Packing. http:\/\/www.fe.up.pt\/esicup"},{"issue":"6","key":"627_CR5","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 Improvement Heuristic Framework for the Laser Cutting Tool Path Problem, Int. J. Product. Res., 2015, vol. 53, no. 6, pp. 1761\u20131776.","journal-title":"Int. J. Product. Res."},{"issue":"1\/2","key":"627_CR6","first-page":"20","volume":"2","author":"S.Q. Xie","year":"2009","unstructured":"Xie, S.Q. and Gan, J., Optimal Process Planning for Compound Laser Cutting and Punch Using Genetic Algorithms, Int. J. Mechatron. Manuf. Syst., 2009, vol. 2, nos. 1\/2, pp. 20\u201338.","journal-title":"Int. J. Mechatron. Manuf. Syst."},{"key":"627_CR7","doi-asserted-by":"publisher","first-page":"454","DOI":"10.4028\/www.scientific.net\/AMR.796.454","volume":"796","author":"Y. Jing","year":"2013","unstructured":"Jing Y. and Zhige C., An Optimized Algorithm of Numberical Cutting-Path Control in Garment Manufacturing, Adv. Mater. Res., 2013, vol. 796, pp. 454\u2013457.","journal-title":"Adv. Mater. Res."},{"key":"627_CR8","first-page":"123","volume":"14","author":"R.T. Murzakaev","year":"2015","unstructured":"Murzakaev, R.T., Shilov, V.S., and Burylov, A.V., Using Metaheuristic Algorithms to Minimize the Free Movement Length of a Cutting Tool, Vest. PNIPU, Elektrotekh., Inf. Tekhnol., Sist. Upravlen., 2015, no. 14, pp. 123\u2013136.","journal-title":"Vest. PNIPU, Elektrotekh., Inf. Tekhnol., Sist. Upravlen."},{"issue":"24","key":"627_CR9","doi-asserted-by":"publisher","first-page":"5307","DOI":"10.1080\/00207540600579615","volume":"44","author":"M.K. Lee","year":"2006","unstructured":"Lee, M.K. and Kwon, K.B., Cutting Path Optimization in CNC Cutting Processes Using a Two-Step Genetic Algorithm, Int. J. Product. Res., 2006, vol. 44, no. 24, pp. 5307\u20135326.","journal-title":"Int. J. Product. Res."},{"issue":"9","key":"627_CR10","first-page":"719","volume":"29","author":"J. Hoeft","year":"1997","unstructured":"Hoeft, J. and Palekar, U.S., Heuristics for the Plate-Cutting Traveling Salesman Problem, IIE Trans., 1997, vol. 29, no. 9, pp. 719\u2013731.","journal-title":"IIE Trans."},{"issue":"2","key":"627_CR11","first-page":"123","volume":"10","author":"M.A. Verkhoturov","year":"2008","unstructured":"Verkhoturov, M.A. and Tarasenko, P.Yu., Mathematical Modeling for the Optimization Problem for the Path of a Cutting Tool for Planar Profiled Cutting Based on Chain Cutting, Vest. UGATU, Upravlen, Vychisl. Tekh., Informatika, 2008, vol. 10, no. 2(27), pp. 123\u2013130.","journal-title":"Vest. UGATU, Upravlen, Vychisl. Tekh., Informatika"},{"issue":"3","key":"627_CR12","first-page":"241","volume":"9","author":"N.D. Ganelina","year":"2006","unstructured":"Ganelina, N.D. and Frolovskii, V.D., A Study of the Methods for Constructing a Shortest Traversal of Segments on a Plane, Sib. Zh. Vychisl. Mat., 2006, vol. 9, no. 3, pp. 241\u2013252.","journal-title":"Sib. Zh. Vychisl. Mat."},{"key":"627_CR13","first-page":"103","volume":"169","author":"A.A. Petunin","year":"2013","unstructured":"Petunin, A.A., Chentsov, A.G., and Chentsov, P.A., On the Problem of Routing the Tool Movement in Sheet Cutting Machines with Computerized Numerical Control, Nauchn.-Tekhn. Vedomosti SPbGPU, Ser. \u201cInformatika. Telekommunikatsii. Upravlen.\u201d, 2013, no. 169, pp. 103\u2013111.","journal-title":"Nauchn.-Tekhn. Vedomosti SPbGPU, Ser. \u201cInformatika. Telekommunikatsii. Upravlen.\u201d"},{"issue":"3","key":"627_CR14","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<173::AID-NET1>3.0.CO;2-W","volume":"34","author":"R.S. Garfinkel","year":"1999","unstructured":"Garfinkel, R.S. and Webb, I.R., On Crossings, the Crossing Postman Problem, and the Rural Postman Problem, Networks, 1999, vol. 34(3), pp. 173\u2013180.","journal-title":"Networks"},{"key":"627_CR15","first-page":"66","volume-title":"Proc. 15th Intl. Conf. Design Systems for Industrial Technological Preparation and Control over Stages of an Industrial Product Lifecycle (SAD\/SAM\/RDM\u20132015)","author":"T.A. Makarovskikh","year":"2015","unstructured":"Makarovskikh, T.A., Panyukov, A.V., and Savitskiy, E.A., Routing Algorithms for Systems of Technological Preparation for Cutting Processes, Proc. 15th Intl. Conf. Design Systems for Industrial Technological Preparation and Control over Stages of an Industrial Product Lifecycle (SAD\/SAM\/RDM\u20132015), Tolok, A.V., Ed., Moscow: OOO \u201cAnalitik,\u201d 2015, p. 66. http:\/\/lab18.ipu.ru"},{"key":"627_CR16","volume-title":"Osnovy teorii grafov","author":"A.A. Zykov","year":"2004","unstructured":"Zykov, A.A., Osnovy teorii grafov (Fundamentals of Graph Theory), Moscow: Vuzovskaya Kniga, 2004."},{"key":"627_CR17","first-page":"18","volume":"4","author":"T.A. Panyukova","year":"2000","unstructured":"Panyukova, T.A. and Panyukov, A.V., The Algorithm for Tracing of Flat Euler Cycles with Ordered Enclosing, Izv. Chelyabinsk. Nauchn. Tsentra UrO RAN, 2000, no. 4, pp. 18\u201322. URL: http:\/\/elibrary.ru\/ item.asp?id=1614035","journal-title":"Izv. Chelyabinsk. Nauchn. Tsentra UrO RAN"},{"key":"627_CR18","first-page":"134","volume-title":"Proc. 5th Int. Workshop on Computer Science and Information Technologies (CSIT\u20192003)","author":"T.A. Panioukova","year":"2003","unstructured":"Panioukova, T.A. and Panyukov, A.V., Algorithms for Construction of Ordered Enclosing Traces in Planar Eulerian Graphs, Proc. 5th Int. Workshop on Computer Science and Information Technologies (CSIT\u20192003), September 16\u201318, 2003, Ufa: Gos. Tekhn. Univ., 2003, vol. 1, pp. 134\u2013138.","edition":"1"},{"key":"627_CR19","first-page":"9315","volume-title":"Proc. XII All-Russian Seminar on Control Problems, VSPU-2014","author":"T.A. Panyukova","year":"2014","unstructured":"Panyukova, T.A. and Savitskiy, E.A., Algorithm for Checking the Cutting Route in a Cutting Plan for the Ordered Enclosing Condition, Proc. XII All-Russian Seminar on Control Problems, VSPU-2014, Moscow, June 16\u201319, 2014, Moscow: Inst. Probl. Upravlen,, 2014, pp. 9315\u20139318."},{"key":"627_CR20","first-page":"17","volume-title":"Selected Topics in Graph Theory 2","author":"H. Fleichner","year":"1983","unstructured":"Fleichner, H., Beineke, L.W., and Wilson, R.J., Eulerian Graphs, in Selected Topics in Graph Theory 2, New York: Academic, 1983, pp. 17\u201353."},{"key":"627_CR21","volume-title":"Ann. Discr. Math.","author":"H. Fleischner","year":"1991","unstructured":"Fleischner, H., Eulerian Graphs and Related Topics, Ann. Discr. Math., 1991, no. 50, part 1, vol. 2."},{"key":"627_CR22","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.endm.2007.01.004","volume":"28","author":"T.A. Panyukova","year":"2007","unstructured":"Panyukova, T.A, Eulerian Cover with Ordered Enclosing for Flat Graphs, Electron. Notes Discr. Math., 2007, vol. 28, pp. 17\u201324.","journal-title":"Electron. Notes Discr. Math."},{"issue":"1","key":"627_CR23","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1134\/S1064230707010108","volume":"46","author":"T.A. Panyukova","year":"2007","unstructured":"Panyukova, T.A., Chain Sequences with Ordered Enclosing, J. Comput. Syst. Sci. Int., 2007, vol. 46, no. 1, pp. 83\u201392.","journal-title":"J. Comput. Syst. Sci. Int."},{"issue":"2","key":"627_CR24","first-page":"31","volume":"13","author":"T.A. Panyukova","year":"2006","unstructured":"Panyukova, T.A., Chains with Ordered Enclosing in Planar Graphs, Diskret. Anal. Issled. Oper., 2006, vol. 13, no. 2, pp. 31\u201343.","journal-title":"Diskret. Anal. Issled. Oper."},{"issue":"2","key":"627_CR25","first-page":"64","volume":"18","author":"T.A. Panyukova","year":"2011","unstructured":"Panyukova, T.A., Optimal Eulerian Coverage for Planar Graphs, Diskret. Anal. Issled. Oper., 2011, vol. 18, no. 2, pp. 64\u201374.","journal-title":"Diskret. Anal. Issled. Oper."},{"key":"627_CR26","first-page":"20","volume":"3","author":"T.A. Panyukova","year":"2012","unstructured":"Panyukova, T.A., Optimizing Resource Use for Technological Preparation of the Cutting Process, Prikl. Informat., 2012, no. 3, pp. 20\u201332.","journal-title":"Prikl. Informat."},{"key":"627_CR27","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 Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979. Translated under the title Vychislitel\u2019nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982."},{"key":"627_CR28","volume-title":"Computer Programs. Databases. Integral Circuit Topologies. Official Bull. Rus. Agency of Patents and Trademarks","author":"T.A. Panyukova","year":"2011","unstructured":"Panyukova, T.A. and Savitskiy, E.A., A Program for Constructing Optimal Coverages with Ordered Enclosing for Multiconnected Graphs, Computer Programs. Databases. Integral Circuit Topologies. Official Bull. Rus. Agency of Patents and Trademarks, no. 8(126), Moscow: FIPS, 2011, reg. no. 2011617777, p. 150."}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117917050095.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117917050095","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117917050095.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:27:06Z","timestamp":1773613626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117917050095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["627"],"URL":"https:\/\/doi.org\/10.1134\/s0005117917050095","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5]]},"assertion":[{"value":"28 October 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2017","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}