{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:26:30Z","timestamp":1743045990881,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030688202"},{"type":"electronic","value":"9783030688219"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-68821-9_21","type":"book-chapter","created":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T20:03:56Z","timestamp":1613851436000},"page":"227-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Library of Sample Image Instances for the Cutting Path Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2540-1305","authenticated-orcid":false,"given":"Alexander","family":"Petunin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Khalyavka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3555-0080","authenticated-orcid":false,"given":"Michael","family":"Khachay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5683-4862","authenticated-orcid":false,"given":"Andrei","family":"Kudriavtsev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Chentsov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Efim","family":"Polishchuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9946-6446","authenticated-orcid":false,"given":"Stanislav","family":"Ukolov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,21]]},"reference":[{"issue":"5-8","key":"21_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., Cattrysse, D.: A review of cutting path algorithms for laser cutters. Int. J. Adv. Manuf. Technol. 87(5\u20138), 1865\u20131884 (2016). https:\/\/doi.org\/10.1007\/s00170-016-8609-1","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"13","key":"21_CR2","doi-asserted-by":"publisher","first-page":"2662","DOI":"10.1016\/j.ifacol.2019.11.609","volume":"52","author":"A Petunin","year":"2019","unstructured":"Petunin, A.: General Model of Tool Path Problem for the CNC Sheet Cutting Machines. IFAC-PapersOnLine 52(13), 2662\u20132667 (2019). https:\/\/doi.org\/10.1016\/j.ifacol.2019.11.609","journal-title":"IFAC-PapersOnLine"},{"key":"21_CR3","doi-asserted-by":"publisher","unstructured":"Oliveira J.F.C., Ferreira J.A.S.: Algorithms for nesting problems. In: Vidal R.V.V. (eds) Applied Simulated Annealing. Lecture Notes in Economics and Mathematical Systems, vol 396. Springer, Berlin, Heidelberg (1993). https:\/\/doi.org\/https:\/\/doi.org\/10.1007\/978-3-642-46787-5_13","DOI":"10.1007\/978-3-642-46787-5_13"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1134\/S0081543816090054","volume":"295","author":"AG Chentsov","year":"2016","unstructured":"Chentsov, A.G., Khachai, M.Yu., Khachai, D.M.: An exact algorithm with linear complexity for a problem of visiting megalopolises. Proc. Steklov Inst. Math. 295(1), 38\u201346 (2016). https:\/\/doi.org\/10.1134\/S0081543816090054","journal-title":"Proc. Steklov Inst. Math."},{"key":"21_CR5","doi-asserted-by":"publisher","unstructured":"Chentsov, A.G., Khachay, M.Yu., Khachay, D.M.: Linear time algorithm for precedence constrained asymmetric Generalized Traveling Salesman Problem. IFAC-PapersOnLine 49(12), 651\u2013655 (2016). https:\/\/doi.org\/https:\/\/doi.org\/10.1016\/j.ifacol.2016.07.767. 8th IFAC Conference on Manufacturing Modelling, Management and Control MIM 2016","DOI":"10.1016\/j.ifacol.2016.07.767"},{"key":"21_CR6","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93800-4","volume-title":"Optimization Problems and Their Applications","year":"2018","unstructured":"Eremeev, A., Khachay, M., Kochetov, Y., Pardalos, P. (eds.): OPTA 2018. CCIS, vol. 871. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93800-4"},{"issue":"1-3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10472-019-09626-w","volume":"88","author":"M Khachay","year":"2019","unstructured":"Khachay, M., Neznakhina, K.: Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters. Ann. Math. Artif. Intell. 88(1\u20133), 53\u201369 (2019). https:\/\/doi.org\/10.1007\/s10472-019-09626-w","journal-title":"Ann. Math. Artif. Intell."},{"issue":"14","key":"21_CR8","doi-asserted-by":"publisher","first-page":"4819","DOI":"10.1080\/00207543.2017.1421784","volume":"56","author":"AG Chentsov","year":"2018","unstructured":"Chentsov, A.G., Chentsov, P.A., Petunin, A.A., Sesekin, A.N.: Model of megalopolises in the tool path optimisation for CNC plate cutting machines. Int. J. Prod. Res. 56(14), 4819\u20134830 (2018)","journal-title":"Int. J. Prod. Res."},{"key":"21_CR9","unstructured":"TSPLIB Homepage. https:\/\/elib.zib.de\/pub\/mp-testdata\/tsp\/tsplib\/tsplib.html. Accessed 01 Nov 2020"},{"key":"21_CR10","unstructured":"GTSPLIB Homepage. https:\/\/www.cs.nott.ac.uk\/~pszdk\/gtsp.html. Accessed 01 Nov 2020"},{"key":"21_CR11","unstructured":"PCGTSPLIB Homepage. https:\/\/www.fcc.chalmers.se\/external\/PCGTSPLIB\/. Accessed 01 Nov 2020"},{"key":"21_CR12","doi-asserted-by":"publisher","unstructured":"Petunin, A.A.: Modeling of tool path for the CNC sheet cutting machines. In: Pasheva, B., Popivanov, N., Venkov, G. (eds.) 41st International Conference \"Applications of Mathematics in Engineering and Economics\", AMEE 2015, 1690. [060002] (AIP Conference Proceedings; 1690. American Institute of Physics Publising LLC (2015). https:\/\/doi.org\/10.1063\/1.4936740","DOI":"10.1063\/1.4936740"},{"key":"21_CR13","series-title":"Lecture Notes in Mechanical Engineering","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-030-22063-1_48","volume-title":"Proceedings of the 5th International Conference on Industrial Engineering (ICIE 2019)","author":"AF Tavaeva","year":"2020","unstructured":"Tavaeva, A.F., Petunin, A.A., Polishchuk, E.G.: Methods of Cutting Cost Minimizing in Problem of Tool Route Optimization for CNC Laser Machines. In: Radionov, A.A., Kravchenko, O.A., Guzeev, V.I., Rozhdestvenskiy, Y.V. (eds.) ICIE 2019. LNME, pp. 447\u2013455. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-22063-1_48"},{"key":"21_CR14","unstructured":"CCPLIB Homepage, https:\/\/drive.google.com\/drive\/folders\/1e95DUVXq0XAX7UI15wUaNpAY0exbXc8T?usp=sharing. Accessed 01 Nov 2020"},{"issue":"13","key":"21_CR15","doi-asserted-by":"publisher","first-page":"2320","DOI":"10.1016\/j.ifacol.2019.11.552","volume":"52","author":"AA Petunin","year":"2019","unstructured":"Petunin, A.A., Polishchuk, E.G., Ukolov, S.S.: On the new Algorithm for Solving Continuous Cutting Problem. IFAC-PapersOnLine 52(13), 2320\u20132325 (2019). https:\/\/doi.org\/10.1016\/j.ifacol.2019.11.552","journal-title":"IFAC-PapersOnLine"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-030-62867-3_15","volume-title":"Optimization and Applications","author":"M Khachay","year":"2020","unstructured":"Khachay, M., Kudriavtsev, A., Petunin, A.: PCGLNS: A Heuristic Solver for the Precedence Constrained Generalized Traveling Salesman Problem. In: Olenev, N., Evtushenko, Y., Khachay, M., Malkova, V. (eds.) OPTIMA 2020. LNCS, vol. 12422, pp. 196\u2013208. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62867-3_15"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition. ICPR International Workshops and Challenges"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68821-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T20:07:31Z","timestamp":1613851651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-68821-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030688202","9783030688219"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68821-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"21 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ICPR2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icpr2020.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}