{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T11:03:38Z","timestamp":1770548618403,"version":"3.49.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1016\/s0167-6377(96)00037-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:14:29Z","timestamp":1027638869000},"page":"31-38","source":"Crossref","is-referenced-by-count":6,"title":["A note on the complexity of the asymmetric traveling salesman problem"],"prefix":"10.1016","volume":"20","author":[{"given":"Weixiong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(96)00037-5_BIB1","article-title":"Statistical analysis of some traveling salesman problem algorithms","author":"Balas","year":"1984"},{"key":"10.1016\/S0167-6377(96)00037-5_BIB2","series-title":"The Traveling Salesman Problem","first-page":"361","article-title":"Branch and bound methods","author":"Balas","year":"1985"},{"key":"10.1016\/S0167-6377(96)00037-5_BIB3","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1287\/opre.19.2.278","article-title":"Pathology of traveling-salesman subtour-elimination algorithms","volume":"19","author":"Bellmore","year":"1971","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(96)00037-5_BIB4","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.26.7.736","article-title":"Some new branching and bounding criteria for the asymmetric traveling salesman problem","volume":"26","author":"Carpaneto","year":"1980","journal-title":"Management Sci."},{"key":"10.1016\/S0167-6377(96)00037-5_BIB5","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0208045","article-title":"A patching algorithm for the nonsymmetric traveling salesman problem","volume":"8","author":"Karp","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(96)00037-5_BIB6","series-title":"The Traveling Salesman Problem","first-page":"181","article-title":"Probabilistic analysis of heuristics","author":"Karp","year":"1985"},{"key":"10.1016\/S0167-6377(96)00037-5_BIB7","series-title":"The Traveling Salesman Problem","author":"Lawler","year":"1985"},{"key":"10.1016\/S0167-6377(96)00037-5_BIB8","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","article-title":"Branch-and-bound methods: a survey","volume":"14","author":"Lawler","year":"1966","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(96)00037-5_BIB9","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/opre.26.2.347","article-title":"On the expected performance of branch-and-bound algorithms","volume":"26","author":"Lenstra","year":"1978","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(96)00037-5_BIB10","series-title":"Introduction to Combinatorial Mathematics","author":"Liu","year":"1968"},{"key":"10.1016\/S0167-6377(96)00037-5_BIB11","first-page":"259","article-title":"Linear assignment problems","volume":"31","author":"Martello","year":"1987","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0167-6377(96)00037-5_BIB12","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/2422.322422","article-title":"Random trees and the analysis of branch and bound procedures","volume":"31","author":"Smith","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/S0167-6377(96)00037-5_BIB13","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/S0167-5060(08)70755-6","article-title":"Computational performance of three subtour elimination algorithms for solving asymmetric traveling salesman problems","volume":"1","author":"Smith","year":"1977","journal-title":"Ann. Discrete Math."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637796000375?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637796000375?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:53:55Z","timestamp":1555577635000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637796000375"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S0167637796000375"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(96)00037-5","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}