{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T04:00:19Z","timestamp":1777608019711,"version":"3.51.4"},"reference-count":58,"publisher":"Informa UK Limited","issue":"6","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2021,11,2]]},"DOI":"10.1080\/10556788.2020.1817447","type":"journal-article","created":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T05:57:25Z","timestamp":1600149445000},"page":"1128-1154","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":5,"title":["Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin\u2013Marsten bounding"],"prefix":"10.1080","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8617-5228","authenticated-orcid":false,"given":"Yaroslav. V.","family":"Salii","sequence":"first","affiliation":[{"name":"McGill University, Montreal, Canada"},{"name":"Krasovskii Institute of Mathematics and Mechanics UB RAS"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5763-351X","authenticated-orcid":false,"given":"Andrey S.","family":"Sheka","sequence":"additional","affiliation":[{"name":"Krasovskii Institute of Mathematics and Mechanics UB RAS"},{"name":"Ural Federal University, Yekaterinburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2020,9,14]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0047-y"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585767"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1110.0456"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.5.1.2"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321111"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.1994.11732235"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-008-0139-2"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1007\/BF00383444"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90030-3"},{"key":"CIT0010","doi-asserted-by":"crossref","unstructured":"N. Caspard, B. Leclerc and B. Monjardet, Finite Ordered Sets: Concepts, Results and Uses, Encyclopedia of Mathematics and Its Applications Vol. 144, Cambridge University Press, Cambridge, 2012.","DOI":"10.1017\/CBO9781139005135"},{"key":"CIT0011","unstructured":"A.G. Chentsov, A.M. Grigoryev and A.A. Chentsov, Procedures of local optimization in routing problems with constraints, in Mathematical Optimization Theory and Operations Research, 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8\u201312, 2019, Revised Selected Papers, I. Bykadorov, V.A. Strusevich, and T. Tchemisova, eds., Communications in Computer and Information Science, Springer, Vol. 1090. 2019."},{"key":"CIT0012","unstructured":"A.G. Chentsov, Extremal problems of routing and scheduling: a theoretical approach [in Russian], Regular and Chaotic Dynamics, Izhevsk, 2008."},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1134\/S0005117912030113"},{"key":"CIT0014","first-page":"148","author":"Chentsov A.G.","year":"2004","journal-title":"Bull. USTU"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44914-2_10"},{"key":"CIT0016","first-page":"24","volume":"8","author":"Chentsov A.G.","year":"2015","journal-title":"Vestnik YuUrGU. Ser. Mat. Model. Progr."},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2013.1221"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(88)90333-5"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579168"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00888-5"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.04.008"},{"key":"CIT0022","first-page":"101","volume":"18","author":"Grigoriev A.M.","year":"2011","journal-title":"Model. Anal. Inform. Sist."},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(03)00048-6"},{"key":"CIT0024","unstructured":"G. Gutin and A.P. Punnen, The Traveling Salesman Problem and Its Variations, Combinatorial Optimization Vol. 12, Kluwer Academic Publishers, Dordrecht, 2002."},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.04.012"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1137\/0110015"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-015-0080-8"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI.2017.8280805"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(85)90257-7"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.11.035"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8901-7"},{"key":"CIT0032","unstructured":"M. Kulukundis, Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step, in CPPcon. Standard C++ Foundation, 2017. Conference Talk Recording. Accessed 06.09.2019. Available at https:\/\/www.youtube.com\/watch?v=ncHmEUmJZf4."},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.08.005"},{"key":"CIT0034","unstructured":"E.L. Lawler, Efficient implementation of dynamic programming algorithms for sequencing problems, Tech. Rep. BW 106\/79, Stichting Mathematisch Centrum, 1979."},{"key":"CIT0035","unstructured":"L. Libralesso, A.M. Bouhassoun, H. Cambazard and V. Jost, Tree search algorithms for the sequential ordering problem, (2019). Available at https:\/\/arxiv.org\/abs\/1911.12427."},{"key":"CIT0036","doi-asserted-by":"publisher","DOI":"10.1016\/S0927-0507(05)80126-4"},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00299-1"},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.16.11.728"},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.3.365"},{"key":"CIT0040","unstructured":"M. Minoux, Programmation Math\u00e8matique. Th\u00e9orie et Algorithmes, 2nd ed., Lavoisier, Lassay-les-Ch\u00e2teaux, 2008."},{"key":"CIT0041","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.05.003"},{"key":"CIT0042","doi-asserted-by":"publisher","DOI":"10.1287\/opre.24.4.611"},{"key":"CIT0043","doi-asserted-by":"publisher","DOI":"10.1109\/SPC.2015.7473562"},{"key":"CIT0044","doi-asserted-by":"publisher","DOI":"10.1137\/0212053"},{"key":"CIT0045","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"CIT0046","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.06.003"},{"key":"CIT0047","unstructured":"Y.V. Salii, On Forward and Backward Dynamic Programming for Precedence Constrained Routing Problems and The Algorithms for Generation of Feasible Subproblems [in Russian], Proceedings of the XV All-Russian Conference on Mathematical Programming and Applications. N.N. Krasovskii Institute of Mathematics and Mechanics, UrB RAS; B.N. Yeltsin Ural Federal University, Bulletin of the Mathematical Programming Association Vol. 13, 2015, pp. 168\u2013169."},{"key":"CIT0048","unstructured":"Y.V. Salii, Restricted Dynamic Programming Heuristic for Precedence Constrained Bottleneck Generalized TSP, Proceedings of the 1st Ural Workshop on Parallel, Distributed, and Cloud Computing for Young Scientists, A. Sozykin, E. Akimova, and D. Ustalov, eds., CEUR Workshop Proceedings, Yekaterinburg, Vol. 1513. 2015, pp. 85\u2013108. Available at http:\/\/ceur-ws.org\/Vol-1513\/#paper-10."},{"key":"CIT0049","unstructured":"Y.V. Salii, Order-Theoretic Characteristics and Dynamic Programming for Precedence Constrained Traveling Salesman Problem, Proceedings of the Fourth Russian Finnish Symposium on Discrete Mathematics, J. Karhum\u00e4ki, Y. Matiyasevich, and A. Saarela, eds., TUCS Lecture Notes Vol. 26. Turku Centre for Computer Science, Turku, 2017, pp. 152\u2013164. Available at http:\/\/urn.fi\/URN:ISBN:978-952-12-3547-4."},{"key":"CIT0050","unstructured":"G. Schmidt and T. Str\u00f6hlein, Relations and graphs: discrete mathematics for computer scientists, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1993."},{"key":"CIT0051","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0053-6"},{"key":"CIT0052","first-page":"240","volume":"16","author":"Sesekin A.N.","year":"2010","journal-title":"Trudy Inst. Mat. i Mekh. UrO RAN"},{"key":"CIT0053","doi-asserted-by":"publisher","DOI":"10.1134\/S0081543811020131"},{"key":"CIT0054","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.04.012"},{"key":"CIT0055","doi-asserted-by":"publisher","DOI":"10.1007\/BF02248587"},{"key":"CIT0056","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(93)90012-U"},{"key":"CIT0057","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2015.0626"},{"key":"CIT0058","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12418-6_8"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2020.1817447","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T01:16:17Z","timestamp":1664500577000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2020.1817447"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,14]]},"references-count":58,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11,2]]}},"alternative-id":["10.1080\/10556788.2020.1817447"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2020.1817447","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,14]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-10-29","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-08-25","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-09-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}