{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T15:47:35Z","timestamp":1784562455696,"version":"3.55.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030910587","type":"print"},{"value":"9783030910594","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-91059-4_10","type":"book-chapter","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T15:02:57Z","timestamp":1636038177000},"page":"136-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Problem-Specific Branch-and-Bound Algorithms for\u00a0the\u00a0Precedence Constrained Generalized Traveling Salesman Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3555-0080","authenticated-orcid":false,"given":"Michael","family":"Khachay","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9946-6446","authenticated-orcid":false,"given":"Stanislav","family":"Ukolov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2540-1305","authenticated-orcid":false,"given":"Alexander","family":"Petunin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,11,5]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1287\/ijoc.13.1.56.9748","volume":"13","author":"E Balas","year":"2001","unstructured":"Balas, E., Simonetti, N.: Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study. INFORMS J. Comput. 13(1), 56\u201375 (2001). https:\/\/doi.org\/10.1287\/ijoc.13.1.56.9748","journal-title":"INFORMS J. Comput."},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Castelino, K., D\u2019Souza, R., Wright, P.K.: Toolpath optimization for minimizing airtime during machining. J. Manuf. Syst. 22(3), 173\u2013180 (2003). https:\/\/doi.org\/10.1016\/S0278-6125(03)90018-5. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0278612503900185","DOI":"10.1016\/S0278-6125(03)90018-5"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1134\/S0081543816090054","volume":"295","author":"AG Chentsov","year":"2016","unstructured":"Chentsov, A.G., Khachai, M.Y., 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":"10_CR4","doi-asserted-by":"publisher","unstructured":"Chentsov, A., Khachay, M., Khachay, D.: Linear time algorithm for precedence constrained asymmetric generalized traveling salesman problem. IFAC-PapersOnLine 49(12), 651\u2013655 (2016). 8th IFAC Conference on Manufacturing Modelling, Management and Control MIM 2016. https:\/\/doi.org\/10.1016\/j.ifacol.2016.07.767. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S2405896316310485","DOI":"10.1016\/j.ifacol.2016.07.767"},{"issue":"14","key":"10_CR5","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). https:\/\/doi.org\/10.1080\/00207543.2017.1421784","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s11831-018-9251-x","volume":"26","author":"R Dewil","year":"2019","unstructured":"Dewil, R., K\u00fc\u00e7\u00fcko\u01e7lu, I., Luteyn, C., Cattrysse, D.: A critical review of multi-hole drilling path optimization. Arch. Comput. Methods Eng. 26(2), 449\u2013459 (2019). https:\/\/doi.org\/10.1007\/s11831-018-9251-x","journal-title":"Arch. Comput. Methods Eng."},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10288-006-0012-6","volume":"4","author":"C Feremans","year":"2006","unstructured":"Feremans, C., Grigoriev, A., Sitters, R.: The geometric generalized minimum spanning tree problem with grid clustering. 4OR 4(4), 319\u2013329 (2006). https:\/\/doi.org\/10.1007\/s10288-006-0012-6","journal-title":"4OR"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M Fischetti","year":"1997","unstructured":"Fischetti, M., Gonz\u00e1lez, J.J.S., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45(3), 378\u2013394 (1997). https:\/\/doi.org\/10.1287\/opre.45.3.378","journal-title":"Oper. Res."},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s11047-009-9111-6","volume":"9","author":"G Gutin","year":"2010","unstructured":"Gutin, G., Karapetyan, D.: A memetic algorithm for the generalized traveling salesman problem. Nat. Comput. 9(1), 47\u201360 (2010). https:\/\/doi.org\/10.1007\/s11047-009-9111-6","journal-title":"Nat. Comput."},{"key":"10_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/b101971","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G Gutin","year":"2007","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Springer, Boston (2007). https:\/\/doi.org\/10.1007\/b101971"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10(1), 196\u2013210 (1962). http:\/\/www.jstor.org\/stable\/2098806","DOI":"10.1137\/0110015"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s12532-015-0080-8","volume":"7","author":"K Helsgaun","year":"2015","unstructured":"Helsgaun, K.: Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm. Math. Program. Comput. 7, 269\u2013287 (2015). https:\/\/doi.org\/10.1007\/s12532-015-0080-8","journal-title":"Math. Program. Comput."},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Karapetyan, D., Gutin, G.: Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem. Eur. J. Oper. Res. 219(2), 234\u2013251 (2012). https:\/\/doi.org\/10.1016\/j.ejor.2012.01.011. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221712000288","DOI":"10.1016\/j.ejor.2012.01.011"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1134\/S0081543817090127","volume":"299","author":"MY Khachai","year":"2017","unstructured":"Khachai, M.Y., Neznakhina, E.D.: Approximation schemes for the generalized traveling salesman problem. Proc. Steklov Inst. Math. 299(1), 97\u2013105 (2017). https:\/\/doi.org\/10.1134\/S0081543817090127","journal-title":"Proc. Steklov Inst. Math."},{"key":"10_CR15","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"},{"key":"10_CR16","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-319-93800-4_6","volume-title":"Optimization Problems and Their Applications","author":"M Khachay","year":"2018","unstructured":"Khachay, M., Neznakhina, K.: Towards tractability of the Euclidean generalized traveling salesman problem in grid clusters defined by a grid of bounded height. In: Eremeev, A., Khachay, M., Kochetov, Y., Pardalos, P. (eds.) OPTA 2018. CCIS, vol. 871, pp. 68\u201377. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93800-4_6"},{"issue":"1","key":"10_CR17","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), 53\u201369 (2019). https:\/\/doi.org\/10.1007\/s10472-019-09626-w","journal-title":"Ann. Math. Artif. Intell."},{"key":"10_CR18","unstructured":"Kudriavtsev, A., Khachay, M.: PCGLNS: adaptive heuristic solver for the Precedence Constrained GTSP (2020). https:\/\/github.com\/AndreiKud\/PCGLNS\/"},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1080\/03155986.1999.11732374","volume":"37","author":"G Laporte","year":"1999","unstructured":"Laporte, G., Semet, F.: Computational evaluation of a transformation procedure for the symmetric generalized traveling salesman problem. INFOR: Inf. Syst. Oper. Res. 37(2), 114\u2013120 (1999). https:\/\/doi.org\/10.1080\/03155986.1999.11732374","journal-title":"INFOR: Inf. Syst. Oper. Res."},{"issue":"3","key":"10_CR20","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1080\/00207543.2017.1401746","volume":"56","author":"T Makarovskikh","year":"2018","unstructured":"Makarovskikh, T., Panyukov, A., Savitskiy, E.: Mathematical models and routing algorithms for economical cutting tool paths. Int. J. Prod. Res. 56(3), 1171\u20131188 (2018). https:\/\/doi.org\/10.1080\/00207543.2017.1401746","journal-title":"Int. J. Prod. Res."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Morin, T.L., Marsten, R.E.: Branch-and-bound strategies for dynamic programming. Oper. Res. 24(4), 611\u2013627 (1976). http:\/\/www.jstor.org\/stable\/169764","DOI":"10.1287\/opre.24.4.611"},{"issue":"1","key":"10_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1080\/03155986.1993.11732212","volume":"31","author":"CE Noon","year":"1993","unstructured":"Noon, C.E., Bean, J.C.: An efficient transformation of the generalized traveling salesman problem. INFOR: Inf. Syst. Oper. Res. 31(1), 39\u201344 (1993). https:\/\/doi.org\/10.1080\/03155986.1993.11732212","journal-title":"INFOR: Inf. Syst. Oper. Res."},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"C Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.: Euclidean TSP is NP-complete. Theor. Comput. Sci. 4, 237\u2013244 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Salman, R., Carlson, J.S., Ekstedt, F., Spensieri, D., Torstensson, J., S\u00f6derberg, R.: An industrially validated CMM inspection process with sequence constraints. Procedia CIRP 44, 138\u2013143 (2016). 6th CIRP Conference on Assembly Technologies and Systems (CATS). https:\/\/doi.org\/10.1016\/j.procir.2016.02.136. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S2212827116004182","DOI":"10.1016\/j.procir.2016.02.136"},{"issue":"2","key":"10_CR25","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.orl.2020.01.009","volume":"48","author":"R Salman","year":"2020","unstructured":"Salman, R., Ekstedt, F., Damaschke, P.: Branch-and-bound for the precedence constrained generalized traveling salesman problem. Oper. Res. Lett. 48(2), 163\u2013166 (2020). https:\/\/doi.org\/10.1016\/j.orl.2020.01.009","journal-title":"Oper. Res. Lett."},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.05.010","volume":"87","author":"SL Smith","year":"2017","unstructured":"Smith, S.L., Imeson, F.: GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem. Comput. Oper. Res. 87, 1\u201319 (2017). https:\/\/doi.org\/10.1016\/j.cor.2017.05.010","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10_CR27","first-page":"97","volume":"7","author":"S Srivastava","year":"1969","unstructured":"Srivastava, S., Kumar, S., Garg, R., Sen, P.: Generalized traveling salesman problem through n sets of nodes. CORS J. 7(2), 97\u2013101 (1969)","journal-title":"CORS J."},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF02248587","volume":"256","author":"G Steiner","year":"1990","unstructured":"Steiner, G.: On the complexity of dynamic programming for sequencing problems with precedence constraints. Ann. Oper. Res. 256, 103\u2013123 (1990). https:\/\/doi.org\/10.1007\/BF02248587","journal-title":"Ann. Oper. Res."},{"key":"10_CR29","unstructured":"Ukolov, S., Khachay, M.: Branch-and-bound algorithm for the Precedence Constrained GTSP (2021). https:\/\/github.com\/ukoloff\/PCGTSP-BnB"},{"key":"10_CR30","doi-asserted-by":"publisher","unstructured":"Yuan, Y., Cattaruzza, D., Ogier, M., Semet, F.: A branch-and-cut algorithm for the generalized traveling salesman problem with time windows. Eur. J. Oper. Res. 286(3), 849\u2013866 (2020). https:\/\/doi.org\/10.1016\/j.ejor.2020.04.024. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221720303581","DOI":"10.1016\/j.ejor.2020.04.024"}],"container-title":["Lecture Notes in Computer Science","Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91059-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T23:04:15Z","timestamp":1638399855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91059-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030910587","9783030910594"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91059-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OPTIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Petrovac","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montenegro","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agora.guru.ru\/display.php?conf=OPTIMA-2021","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":"63","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":"41","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":"3","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":"65% - 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.1","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.5","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)"}}]}}