{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:36:17Z","timestamp":1775054177876,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030333935","type":"print"},{"value":"9783030333942","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-33394-2_36","type":"book-chapter","created":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T13:16:49Z","timestamp":1572441409000},"page":"470-485","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimization \u201cIn Windows\u201d for Routing Problems with Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8274-1456","authenticated-orcid":false,"given":"Alexander G.","family":"Chentsov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2560-9456","authenticated-orcid":false,"given":"Alexey M.","family":"Grigoryev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0646-9147","authenticated-orcid":false,"given":"Alexey A.","family":"Chentsov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,27]]},"reference":[{"key":"36_CR1","volume-title":"The Traveling Salesman Problem and its Variations","author":"G Gutin","year":"2002","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and its Variations. Springer, Berlin (2002)"},{"key":"36_CR2","first-page":"248","volume-title":"In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation","author":"JC William","year":"2012","unstructured":"William, J.C.: In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation, p. 248. Princeton University Press, Princeton (2012)"},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. Assoc. Comput. Mach. 9, 61\u201363 (1962)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"36_CR4","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10(1), 196\u2013210 (1962)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"4","key":"36_CR5","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1134\/S0005117914040122","volume":"75","author":"AG Chentsov","year":"2014","unstructured":"Chentsov, A.G.: Problem of successive megalopolis traversal with the precedence conditions. Autom. Remote Control 75(4), 728\u2013744 (2014). \n                    https:\/\/doi.org\/10.1134\/S0005117914040122","journal-title":"Autom. Remote Control"},{"issue":"3","key":"36_CR6","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1134\/S1064562415060083","volume":"92","author":"AG Chentsov","year":"2015","unstructured":"Chentsov, A.G., Chentsov, A.A.: Route problem with constraints depending on a list of tasks. Doklady Math. 92(3), 685\u2013688 (2015). \n                    https:\/\/doi.org\/10.1134\/S1064562415060083","journal-title":"Doklady Math."},{"issue":"4","key":"36_CR7","doi-asserted-by":"publisher","first-page":"122","DOI":"10.20537\/vm140410","volume":"2014","author":"AG Chentsov","year":"2014","unstructured":"Chentsov, A.G.: The Bellman insertions in the route problem with constraints and complicated cost functions. Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp\u2019yuternye Nauki 2014(4), 122\u2013141 (2014). \n                    https:\/\/doi.org\/10.20537\/vm140410\n                    \n                  . (in Russian)","journal-title":"Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp\u2019yuternye Nauki"},{"issue":"14","key":"36_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). \n                    https:\/\/doi.org\/10.1080\/00207543.2017.1421784","journal-title":"Int. J. Prod. Res."},{"key":"36_CR9","first-page":"117","volume":"1","author":"AA Petunin","year":"2019","unstructured":"Petunin, A.A., Chentsov, A.G., Chentsov, P.A.: Optimizing inserts in a routing task with constraints and complicated cost functions. Izvestija RAN. Teorija i sistemy upravlenija 1, 117\u2013130 (2019). (in Russian)","journal-title":"Izvestija RAN. Teorija i sistemy upravlenija"},{"issue":"12","key":"36_CR10","doi-asserted-by":"publisher","first-page":"834","DOI":"10.17587\/mau.17.834-846","volume":"17","author":"AG Chentsov","year":"2016","unstructured":"Chentsov, A.G., Grigoryev, A.M.: Dynamic programming method in a routing problem: a scheme of independent computations. Mekhatronika, Avtomatizatsiya, Upravlenie 17(12), 834\u2013846 (2016). (in Russian)","journal-title":"Mekhatronika, Avtomatizatsiya, Upravlenie"},{"issue":"2","key":"36_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.15826\/umj.2018.2.006","volume":"4","author":"AG Chentsov","year":"2018","unstructured":"Chentsov, A.G., Grigoryev, A.M., Chentsov, A.A.: Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions. Ural Math. J. 4(2), 43\u201355 (2018). \n                    https:\/\/doi.org\/10.15826\/umj.2018.2.006","journal-title":"Ural Math. J."},{"issue":"4","key":"36_CR12","doi-asserted-by":"publisher","first-page":"565","DOI":"10.20537\/vm160410","volume":"26","author":"AG Chentsov","year":"2016","unstructured":"Chentsov, A.G.: The Bellmann insertions in route problems with constraints and complicated cost functions. II. Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp\u2019yuternye Nauki 26(4), 565\u2013578 (2016). \n                    https:\/\/doi.org\/10.20537\/vm160410\n                    \n                  . (in Russian)","journal-title":"Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp\u2019yuternye Nauki"},{"issue":"4","key":"36_CR13","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1134\/S0005117917040087","volume":"78","author":"AA Petunin","year":"2017","unstructured":"Petunin, A.A., Chentsov, A.A., Chentsov, A.G., Chentsov, P.A.: Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints. Autom. Remote Control 78(4), 666\u2013681 (2017). \n                    https:\/\/doi.org\/10.1134\/S0005117917040087","journal-title":"Autom. Remote Control"},{"issue":"4","key":"36_CR14","doi-asserted-by":"publisher","first-page":"513","DOI":"10.20537\/vm180406","volume":"28","author":"AG Chentsov","year":"2018","unstructured":"Chentsov, A.G., Grigoryev, A.M.: Optimizing multi-inserts in routing problems with constraints. Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp\u2019yuternye Nauki 28(4), 513\u2013530 (2018). \n                    https:\/\/doi.org\/10.20537\/vm180406\n                    \n                  . (in Russian)","journal-title":"Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp\u2019yuternye Nauki"},{"key":"36_CR15","unstructured":"Gimadi, E.Kh., Khachai, M.Yu.: Extremal Problems on Sets of Permutations, p. 220. UMC UPI, Yekaterinburg (2016). (in Russian)"},{"key":"36_CR16","unstructured":"Melamed, I.I., Sergeev, S.I., Sigal, I.Kh.: The traveling salesman problem. I Issues in theory; II Exact methods; III Approximate algorithms. Autom. Remote Control 50(9), 1147\u20131173; 50(10), 1303\u20131324; 50(11), 1459\u20131479 (1989)"},{"key":"36_CR17","unstructured":"Litl, Dzh., Murti, K., Suini, D., Kerel, K.: Algorithm for the traveling salesman problem. Ekon. Mat. Metod. 1(1), 94\u2013107 (1965)"},{"key":"36_CR18","unstructured":"Chentsov, A.G.: Extreme Problems of Routing and Tasks Distribution: Regular and Chaotic Dynamics, 240 p. Izhevsk Institute of Computer Research (2008). (in Russian)"},{"issue":"11","key":"36_CR19","doi-asserted-by":"publisher","first-page":"1957","DOI":"10.1134\/S0005117916110060","volume":"77","author":"AG Chentsov","year":"2016","unstructured":"Chentsov, A.G., Chentsov, P.A.: Routing under constraints: problem of visit to megalopolises. Autom. Remote Control 77(11), 1957\u20131974 (2016). \n                    https:\/\/doi.org\/10.1134\/S0005117916110060","journal-title":"Autom. Remote Control"},{"key":"36_CR20","doi-asserted-by":"publisher","first-page":"83","DOI":"10.20537\/2226-3594-2017-50-08","volume":"50","author":"AG Chentsov","year":"2017","unstructured":"Chentsov, A.G., Chentsov, A.A.: A model variant of the problem about radiation sources utilization (iterations based on optimization insertions). Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta 50, 83\u2013109 (2017). \n                    https:\/\/doi.org\/10.20537\/2226-3594-2017-50-08\n                    \n                  . (in Russian)","journal-title":"Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta"},{"issue":"Suppl. 1","key":"36_CR21","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1134\/S0081543809050071","volume":"264","author":"AA Chentsov","year":"2009","unstructured":"Chentsov, A.A., Chentsov, A.G., Chentsov, P.A.: Extremal routing problem with internal losses. Proc. Steklov Inst. Math. 264(Suppl. 1), 87\u2013106 (2009)","journal-title":"Proc. Steklov Inst. Math."},{"issue":"2","key":"36_CR22","doi-asserted-by":"publisher","first-page":"83","DOI":"10.14529\/mmp180207","volume":"11","author":"AG Chentsov","year":"2018","unstructured":"Chentsov, A.G., Chentsov, P.A.: Optimization of the start point in the GTSP with the precedence conditions. Bull. South Ural State Univ.: Series Math. Model., Prog. Comput. Soft. 11(2), 83\u201395 (2018). \n                    https:\/\/doi.org\/10.14529\/mmp180207","journal-title":"Bull. South Ural State Univ.: Series Math. Model., Prog. Comput. Soft."},{"key":"36_CR23","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.dam.2015.03.009","volume":"192","author":"AF Alkaya","year":"2015","unstructured":"Alkaya, A.F., Duman, E.: Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly. Discrete Appl. Math. 192, 2\u201316 (2015)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"36_CR24","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.ejor.2018.06.003","volume":"272","author":"YV Salii","year":"2019","unstructured":"Salii, Y.V.: Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization. Eur. J. Oper. Res. 272(1), 32\u201342 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"36_CR25","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2015.04.008","volume":"63","author":"L Gouveia","year":"2015","unstructured":"Gouveia, L., Ruthmair, M.: Load-dependent and precedence-based models for pickup and delivery problems. Comput. Oper. Res. 63, 56\u201371 (2015)","journal-title":"Comput. Oper. Res."}],"container-title":["Communications in Computer and Information Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33394-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T13:25:19Z","timestamp":1572441919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33394-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030333935","9783030333942"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33394-2_36","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"27 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/motor2019.uran.ru","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"170","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.34","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.64","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}