{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T20:16:19Z","timestamp":1769285779962,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,4,1]],"date-time":"2006-04-01T00:00:00Z","timestamp":1143849600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s10479-006-0014-y","type":"journal-article","created":{"date-parts":[[2006,5,24]],"date-time":"2006-05-24T11:32:08Z","timestamp":1148470328000},"page":"83-97","source":"Crossref","is-referenced-by-count":34,"title":["Solving the asymmetric traveling purchaser problem"],"prefix":"10.1007","volume":"144","author":[{"given":"Jorge","family":"Riera-Ledesma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan-Jos\u00e9","family":"Salazar-Gonz\u00e1lez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,24]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01582278","volume":"43","author":"E. Balas","year":"1989","unstructured":"Balas, E. and S.M. Ng. (1989). \u201cOn the Set Covering Polytope: I. All the Facets With Coefficients in {0,1,2}.\u201d Mathematical Programming, 43, 57\u201369.","journal-title":"Mathematical Programming"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1002\/1097-0037(200008)36:1<34::AID-NET4>3.0.CO;2-2","volume":"36","author":"E. Balas","year":"2000","unstructured":"Balas, E. and M. Oosten. (2000). \u201cOn the Cycle Polytope of a Directed Graph.\u201d Networks, 36, 34\u201346.","journal-title":"Networks"},{"issue":"4","key":"14_CR3","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/S0305-0548(02)00020-5","volume":"30","author":"F.F. Boctor","year":"2003","unstructured":"Boctor, F.F., G. Laporte, and J. Renaud. (2003). \u201cHeuristics for the Traveling Purchaser Problem.\u201d Computers and Operations Research, 30(4), 491\u2013504.","journal-title":"Computers and Operations Research"},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1057\/jors.1966.56","volume":"17","author":"R.M. Burstall","year":"1966","unstructured":"Burstall, R.M. (1966). \u201cA Heuristic Method for a Job Sequencing Problem.\u201d Operational Research Quarterly, 17, 291\u2013304.","journal-title":"Operational Research Quarterly"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1002\/nav.3800180106","volume":"18","author":"J.A. Buzacott","year":"1971","unstructured":"Buzacott, J.A. and S.K. Dutta. (1971). \u201cSequencing Many Jobs on a Multipurpose Facility.\u201d Naval Research Logistics Quarterly, 18, 75\u201382.","journal-title":"Naval Research Logistics Quarterly"},{"key":"14_CR6","unstructured":"Fischetti, M., A. Lodi, and P. Toth. (2002). Exact Methods for the Asymmetric Traveling Salesman Problem.\u201d Kluwer Academic Publishers, Dordrecht, chapter 4, 169\u2013206."},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M. Fischetti","year":"1997","unstructured":"Fischetti, M., J.J. Salazar, and P. Toth. (1997). \u201cA Branch-and-Cut Algorithms for the Symmetric Generalized Traveling Salesman Problem.\u201d Operations Research, 45, 378\u2013394.","journal-title":"Operations Research"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"1520","DOI":"10.1287\/mnsc.43.11.1520","volume":"43","author":"M. Fischetti","year":"1997","unstructured":"Fischetti, M. and P. Toth. (1997). \u201cA Polyhedral Approach to the Asymmetric Traveling Salesman Problem.\u201d Management Science, 43, 1520\u20131536.","journal-title":"Management Science"},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0305-0483(81)90087-6","volume":"9","author":"B.L. Golden","year":"1981","unstructured":"Golden, B.L., L. Levy, and R. Dahl. (1981). \u201cTwo Generalizations of the Traveling Salesman Problem.\u201d Omega, 9, 439\u2013445.","journal-title":"Omega"},{"key":"14_CR10","unstructured":"Gr\u00f6tschel, M. and M.W. Padberg. (1985). Polyhedral Theory. Wyley, Chichester. chapter 8, pp. 251\u2013305."},{"key":"14_CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0167-6377(83)90048-2","volume":"2","author":"R. Jonker","year":"1983","unstructured":"Jonker, R. and T. Volgenant. (1983). \u201cTransforming Asymmetric into Symmetric Traveling Salesman Problems.\u201d Operations Research Letters, 2, 161\u2013163.","journal-title":"Operations Research Letters"},{"key":"14_CR12","unstructured":"J\u00fcnger, M., G. Reinelt, and G. Rinaldi (1995). The Traveling Salesman Problem. North\u2013Holland, Amsterdam chapter 4."},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0167-6377(98)00013-3","volume":"22","author":"M. J\u00fcnger","year":"1998","unstructured":"J\u00fcnger, M. and S. Thienel. (1998). \u201cIntroduction to ABACUS\u2014a Branch-and-Cut System.\u201d Operations Research Letters, 22, 83\u201395.","journal-title":"Operations Research Letters"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Karp, R.M. (1972). \u201cReducibility Among Combinatorial Problems.\u201d In Miller, R.E. and J.W. Thatcher. (ed.), Complexity of Computer Computations. New York: Plenum Press, pp. 85\u2013103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"6","key":"14_CR15","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1287\/opre.51.6.940.24921","volume":"51","author":"G. Laporte","year":"2003","unstructured":"Laporte, G., J. Riera-Ledesma, and J.J. Salazar-Gonz\u00b4lez. (2003). \u201cA Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem.\u201d Operations Research, 51(6), 940\u2013951.","journal-title":"Operations Research"},{"key":"14_CR16","unstructured":"Ong, H.L. (1982). \u201cApproximate Algorithms for the Traveling Purchaser Problem.\u201d Approximate Algorithms for the Traveling Purchaser Problem 1, 201\u2013205."},{"key":"14_CR17","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1287\/opre.23.4.833","volume":"23","author":"M.W. Padberg","year":"1975","unstructured":"Padberg, M.W. (1975). \u201cA Note on Zero-One Programming.\u201d Operations Research, 23, 833\u2013837.","journal-title":"Operations Research"},{"key":"14_CR18","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/S0305-0548(98)00032-X","volume":"25","author":"W.L. Pearn","year":"1998","unstructured":"Pearn, W.L. and R.C. Chien. (1998). \u201cImproved Solutions for the Traveling Purchaser Problem.\u201d Computers & Operations Research, 25, 879\u2013885.","journal-title":"Computers & Operations Research"},{"key":"14_CR19","first-page":"78","volume":"18","author":"T. Ramesh","year":"1981","unstructured":"Ramesh, T. (1981). \u201cTraveling Purchaser Problem.\u201d Opsearch, 18, 78\u201391.","journal-title":"Opsearch"},{"key":"14_CR20","unstructured":"Riera-Ledesma, J. (2002). The Traveling Purchaser Problem. PhD thesis, DEIOC, Universidad de La Laguna."},{"key":"14_CR21","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.ejor.2003.10.032","volume":"162","author":"J. Riera-Ledesma","year":"2005","unstructured":"Riera-Ledesma, J. and J.J. Salazar-Gonz\u00b4lez. (2005). \u201cA Heuristic Approach for the Travelling Purchaser Problem.\u201d European Journal of Operational Research, 162, 142\u2013152.","journal-title":"European Journal of Operational Research"},{"key":"14_CR22","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0377-2217(96)00313-X","volume":"97","author":"K.N. Singh","year":"1997","unstructured":"Singh, K.N. and D.L. van Oudheusden. (1997). \u201cA Branch and Bound Algorithm for the Traveling Purchaser Problem.\u201d European Journal of Operational Research, 97, 571\u2013579.","journal-title":"European Journal of Operational Research"},{"key":"14_CR23","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF02125457","volume":"63","author":"S. Vo\u00df","year":"1996","unstructured":"Vo\u00df, S. (1996). \u201cDynamic Tabu Search Strategies for the Traveling Purchaser Problem.\u201d Annals of Operations Research, 63, 253\u2013275.","journal-title":"Annals of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0014-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-006-0014-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0014-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:59:36Z","timestamp":1559152776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-006-0014-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["14"],"URL":"https:\/\/doi.org\/10.1007\/s10479-006-0014-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4]]}}}