{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T12:37:00Z","timestamp":1751373420929,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,6,17]],"date-time":"2020-06-17T00:00:00Z","timestamp":1592352000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,17]],"date-time":"2020-06-17T00:00:00Z","timestamp":1592352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972070","61772115"],"award-info":[{"award-number":["61972070","61772115"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10878-020-00608-x","type":"journal-article","created":{"date-parts":[[2020,6,17]],"date-time":"2020-06-17T22:02:31Z","timestamp":1592431351000},"page":"2269-2285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parameterized algorithms and complexity for the traveling purchaser problem and its variants"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1012-2373","authenticated-orcid":false,"given":"Mingyu","family":"Xiao","sequence":"first","affiliation":[]},{"given":"Jianan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Weibo","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,17]]},"reference":[{"issue":"5","key":"608_CR1","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1137\/S0097539791199334","volume":"23","author":"RK Ahuja","year":"1994","unstructured":"Ahuja RK, Orlin JB, Stein C (1994) Improved algorithms for bipartite network flow. SIAM J Comput 23(5):906\u2013933","journal-title":"SIAM J Comput"},{"issue":"4","key":"608_CR2","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon N, Yuster R, Zwick U (1995) Color-coding. J ACM 42(4):844\u2013856","journal-title":"J ACM"},{"issue":"2","key":"608_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10100-008-0080-0","volume":"17","author":"E Angelelli","year":"2008","unstructured":"Angelelli E, Mansini R, Vindigni M (2008) Exploring greedy criteria for the dynamic traveling purchaser problem. Central Eur J Oper Res 17(2):141\u2013158","journal-title":"Central Eur J Oper Res"},{"issue":"2","key":"608_CR4","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1287\/trsc.2015.0627","volume":"50","author":"E Angelelli","year":"2016","unstructured":"Angelelli E, Mansini R, Vindigni M (2016) The stochastic and dynamic traveling purchaser problem. Transp Sci 50(2):642\u2013658","journal-title":"Transp Sci"},{"key":"608_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.cor.2017.01.001","volume":"82","author":"E Angelelli","year":"2017","unstructured":"Angelelli E, Gendreau M, Mansini R, Vindigni M (2017) The traveling purchaser problem with time-dependent quantities. Comput Oper Res 82:15\u201326","journal-title":"Comput Oper Res"},{"issue":"1","key":"608_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellman","year":"1962","unstructured":"Bellman R (1962) Dynamic programming treatment of the travelling salesman problem. J ACM 9(1):61\u201363","journal-title":"J ACM"},{"issue":"1","key":"608_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ejor.2013.10.018","volume":"235","author":"N Bianchessi","year":"2014","unstructured":"Bianchessi N, Mansini R, Speranza MG (2014) The distance constrained multiple vehicle traveling purchaser problem. Eur J Oper Res 235(1):73\u201387","journal-title":"Eur J Oper Res"},{"key":"608_CR8","doi-asserted-by":"crossref","unstructured":"Cambazard H, Penz B (2012) A constraint programming approach for the traveling purchaser problem. In: Milano M (eds) Principles and practice of constraint programming. CP 2012. Lecture notes in computer science, vol 7514, pp 735\u2013749. Springer, Berlin","DOI":"10.1007\/978-3-642-33558-7_53"},{"issue":"8","key":"608_CR9","doi-asserted-by":"publisher","first-page":"9848","DOI":"10.1016\/j.eswa.2011.02.018","volume":"38","author":"MJ Choi","year":"2011","unstructured":"Choi MJ, Lee SH (2011) The multiple traveling purchaser problem for maximizing system\u2019s reliability with budget constraints. Expert Syst Appl 38(8):9848\u20139853","journal-title":"Expert Syst Appl"},{"issue":"1","key":"608_CR10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1287\/opre.1090.0713","volume":"58","author":"G Desaulniers","year":"2010","unstructured":"Desaulniers G (2010) Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Oper Res 58(1):179\u2013192","journal-title":"Oper Res"},{"key":"608_CR11","volume-title":"Fixed-parameter tractability and completeness","author":"RG Downey","year":"1992","unstructured":"Downey RG, Fellows MR (1992) Fixed-parameter tractability and completeness. Mathematical Sciences Institute, Cornell University, Ithaca"},{"issue":"1","key":"608_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"RG Downey","year":"1995","unstructured":"Downey RG, Fellows MR (1995) Fixed-parameter tractability and completeness II: on completeness for W[1]. Theor Comput Sci 141(1):109\u2013131","journal-title":"Theor Comput Sci"},{"issue":"2","key":"608_CR13","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1016\/j.cor.2010.07.016","volume":"38","author":"L Gouveia","year":"2011","unstructured":"Gouveia L, Paias A, Vo\u00df S (2011) Models for a traveling purchaser problem with additional side-constraints. Comput Oper Res 38(2):550\u2013558","journal-title":"Comput Oper Res"},{"key":"608_CR14","doi-asserted-by":"crossref","unstructured":"Hamdan S, Larbi R, Cheaitou A, Alsyouf I (2017) Green traveling purchaser problem model: A bi-objective optimization approach. In: Proceedings of the 7th international conference on modeling, simulation, and applied optimization (ICM-SAO), pp 1\u20136","DOI":"10.1109\/ICMSAO.2017.7934841"},{"issue":"1","key":"608_CR15","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held M, Karp RM (1962) A dynamic programming approach to sequencing problems. J Soc Ind Appl Math 10(1):196\u2013210","journal-title":"J Soc Ind Appl Math"},{"issue":"12","key":"608_CR16","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/S0305-0548(03)00155-2","volume":"31","author":"SC Ho","year":"2004","unstructured":"Ho SC, Haugland D (2004) A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput Oper Res 31(12):1947\u20131964","journal-title":"Comput Oper Res"},{"issue":"3","key":"608_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.ejor.2010.09.012","volume":"209","author":"S Kang","year":"2011","unstructured":"Kang S, Ouyang Y (2011) The traveling purchaser problem with stochastic prices: exact and approximate algorithms. Eur J Oper Res 209(3):265\u2013272","journal-title":"Eur J Oper Res"},{"issue":"6","key":"608_CR18","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1287\/opre.51.6.940.24921","volume":"51","author":"G Laporte","year":"2003","unstructured":"Laporte G, Riera-Ledesma J, Salazar-Gonz\u00e1lez JJ (2003) A branch-and-cut algorithm for the undirected traveling purchaser problem. Oper Res 51(6):940\u2013951","journal-title":"Oper Res"},{"issue":"2","key":"608_CR19","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/net.21588","volume":"65","author":"D Manerba","year":"2015","unstructured":"Manerba D, Mansini R (2015) A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints. Networks 65(2):139\u2013154","journal-title":"Networks"},{"key":"608_CR20","first-page":"59","volume":"148","author":"D Manerba","year":"2016","unstructured":"Manerba D, Gendreau M, Mansini R (2016) The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach. Eur J Oper Res 148:59\u201371","journal-title":"Eur J Oper Res"},{"issue":"1","key":"608_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.12.017","volume":"259","author":"D Manerba","year":"2017","unstructured":"Manerba D, Mansini R, Riera-Ledesma J (2017) The traveling purchaser problem and its variants. Eur J Oper Res 259(1):1\u201318","journal-title":"Eur J Oper Res"},{"issue":"7","key":"608_CR22","doi-asserted-by":"publisher","first-page":"2263","DOI":"10.1016\/j.cor.2008.09.001","volume":"36","author":"R Mansini","year":"2009","unstructured":"Mansini R, Tocchella B (2009) The traveling purchaser problem with budget constraint. Comput Oper Res 36(7):2263\u20132274","journal-title":"Comput Oper Res"},{"key":"608_CR23","unstructured":"Narayanaswamy N, Raman V, Ramanujan M, Saurabh S (2012) LP can be a cure for parameterized problems. In: STACS\u201912 (29th symposium on theoretical aspects of computer science), vol 14. LIPIcs, pp 338\u2013349"},{"issue":"2","key":"608_CR24","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1016\/j.ejor.2018.08.039","volume":"273","author":"PJ Palomo-Mart\u00ednez","year":"2019","unstructured":"Palomo-Mart\u00ednez PJ, Salazar-Aguilar MA (2019) The bi-objective traveling purchaser problem with deliveries. Eur J Oper Res 273(2):608\u2013622","journal-title":"Eur J Oper Res"},{"issue":"1\u20133","key":"608_CR25","first-page":"78","volume":"18","author":"T Ramesh","year":"1981","unstructured":"Ramesh T (1981) Traveling purchaser problem. Opsearch 18(1\u20133):78\u201391","journal-title":"Opsearch"},{"key":"608_CR26","doi-asserted-by":"crossref","unstructured":"Ravi R, Salman FS (1999) Approximation algorithms for the traveling purchaser problem and its variants in network design. In: Algorithms-ESA\u201999, pp 29\u201340","DOI":"10.1007\/3-540-48481-7_4"},{"issue":"1","key":"608_CR27","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10479-006-0014-y","volume":"144","author":"J Riera-Ledesma","year":"2006","unstructured":"Riera-Ledesma J, Salazar-Gonz\u00e1lez JJ (2006) Solving the asymmetric traveling purchaser problem. Ann Oper Res 144(1):83\u201397","journal-title":"Ann Oper Res"},{"issue":"3","key":"608_CR28","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/S0377-2217(96)00313-X","volume":"97","author":"KN Singh","year":"1997","unstructured":"Singh KN, van Oudheusden DL (1997) A branch and bound algorithm for the traveling purchaser problem. Eur J Oper Res 97(3):571\u2013579","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00608-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00608-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00608-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:18:04Z","timestamp":1665778684000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00608-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,17]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["608"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00608-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,6,17]]},"assertion":[{"value":"17 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}