{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:13:34Z","timestamp":1759936414019},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0305-0548(02)00193-4","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T09:55:35Z","timestamp":1048586135000},"page":"139-150","source":"Crossref","is-referenced-by-count":28,"title":["Improved heuristics for the traveling purchaser problem"],"prefix":"10.1016","volume":"31","author":[{"given":"A.","family":"Teeninga","sequence":"first","affiliation":[]},{"given":"A.","family":"Volgenant","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00193-4_BIB1","first-page":"78","article-title":"Traveling purchaser problem","volume":"18","author":"Ramesh","year":"1981","journal-title":"OPSEARCH"},{"key":"10.1016\/S0305-0548(02)00193-4_BIB2","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0377-2217(96)00313-X","article-title":"A branch and bound algorithm for the traveling purchaser problem","volume":"97","author":"Singh","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00193-4_BIB3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1111\/j.1467-9787.1984.tb01030.x","article-title":"The shortest covering path problem","volume":"24","author":"Current","year":"1984","journal-title":"Journal of Regional Science"},{"issue":"5","key":"10.1016\/S0305-0548(02)00193-4_BIB4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0167-6377(82)90041-4","article-title":"Approximate algorithms for the traveling purchaser problem","volume":"1","author":"Ong","year":"1982","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(02)00193-4_BIB5","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0305-0483(81)90087-6","article-title":"Two generalizations of the traveling Salesman Problem","volume":"9","author":"Golden","year":"1981","journal-title":"OMEGA"},{"key":"10.1016\/S0305-0548(02)00193-4_BIB6","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/S0305-0548(98)00032-X","article-title":"Improved solutions for the traveling purchaser problem","volume":"25","author":"Pearn","year":"1998","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(02)00193-4_BIB7","doi-asserted-by":"crossref","unstructured":"Ravi R, Salman FS. Approximation algorithms for the traveling purchaser problem and its variants in network design. In: Algorithms\u2014ESA \u201999, Lecture Notes in Computer Sciences, vol. 1643. Berlin: Springer, 1999. p. 29\u201340.","DOI":"10.1007\/3-540-48481-7_4"},{"key":"10.1016\/S0305-0548(02)00193-4_BIB8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","article-title":"Algorithm 97","volume":"5","author":"Floyd","year":"1962","journal-title":"Communications of ACM"},{"key":"10.1016\/S0305-0548(02)00193-4_BIB9","first-page":"317","article-title":"ADD- and DROP-procedures for the traveling purchaser problem","volume":"53","author":"Vo\u00df","year":"1986","journal-title":"Methods of Operations Research"},{"key":"10.1016\/S0305-0548(02)00193-4_BIB10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF02125457","article-title":"Dynamic tabu search strategies for the traveling purchaser problem","volume":"63","author":"Vo\u00df","year":"1996","journal-title":"Annals of Operations Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001934?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001934?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T13:57:27Z","timestamp":1553435847000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802001934"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0305054802001934"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00193-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}