{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T22:24:15Z","timestamp":1771367055853,"version":"3.50.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":6355,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0004-3702(95)00054-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:46:00Z","timestamp":1027593960000},"page":"223-239","source":"Crossref","is-referenced-by-count":54,"title":["A study of complexity transitions on the asymmetric traveling salesman problem"],"prefix":"10.1016","volume":"81","author":[{"given":"Weixiong","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Richard E.","family":"Korf","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00054-2_BIB1","series-title":"The Traveling Salesman Problem","first-page":"361","article-title":"Branch and bound methods","author":"Balas","year":"1985"},{"key":"10.1016\/0004-3702(95)00054-2_BIB2","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\/0004-3702(95)00054-2_BIB3","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0004-3702(95)00054-2_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\/0004-3702(95)00054-2_BIB5","unstructured":"P. Cheeseman, Personal communication (1991\u20131992)."},{"key":"10.1016\/0004-3702(95)00054-2_BIB6","series-title":"Proceedings IJCAI-91","first-page":"331","article-title":"Where the really hard problems are","author":"Cheeseman","year":"1991"},{"key":"10.1016\/0004-3702(95)00054-2_BIB7","series-title":"Proceedings of AAAI-93","first-page":"21","article-title":"Experimental results on the crossover point in satisfiability problems","author":"Crawford","year":"1993"},{"key":"10.1016\/0004-3702(95)00054-2_BIB8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/net.3230120103","article-title":"On the worst-case performance of some algorithms for the asymmetric traveling salesman problem","volume":"12","author":"Frieze","year":"1982","journal-title":"Network"},{"key":"10.1016\/0004-3702(95)00054-2_BIB9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0004-3702(87)90033-6","article-title":"Phase transitions in artificial intelligence systems","volume":"33","author":"Huberman","year":"1987","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00054-2_BIB10","author":"Johnson","year":"1970"},{"key":"10.1016\/0004-3702(95)00054-2_BIB11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0004-3702(83)80006-X","article-title":"Searching for an optimal path in a tree with random costs","volume":"21","author":"Karp","year":"1983","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00054-2_BIB12","series-title":"The Traveling Salesman Problem","first-page":"181","article-title":"Probabilistic analysis of heuristics","author":"Karp","year":"1985"},{"key":"10.1016\/0004-3702(95)00054-2_BIB13","series-title":"Working Notes of AAAI 1993 Spring Symposium: AI and NP-Hard Problems","first-page":"112","article-title":"Evidence for a satisfiability threshold for random 3CNF formulas","author":"Larrabee","year":"1993"},{"key":"10.1016\/0004-3702(95)00054-2_BIB14","author":"Lawler","year":"1985"},{"key":"10.1016\/0004-3702(95)00054-2_BIB15","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\/0004-3702(95)00054-2_BIB16","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\/0004-3702(95)00054-2_BIB17","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","article-title":"An algorithm for the traveling salesman problem","volume":"11","author":"Little","year":"1963","journal-title":"Oper. Res."},{"key":"10.1016\/0004-3702(95)00054-2_BIB18","author":"Liu","year":"1968"},{"key":"10.1016\/0004-3702(95)00054-2_BIB19","series-title":"Disorder in Physical Systems","first-page":"249","article-title":"Probabilistic analysis of tree search","author":"McDiarmid","year":"1990"},{"key":"10.1016\/0004-3702(95)00054-2_BIB20","series-title":"Proceedings IJCAI-91","first-page":"172","article-title":"An expected-cost analysis of backtracking and non-backtracking algorithms","author":"McDiarmid","year":"1991"},{"key":"10.1016\/0004-3702(95)00054-2_BIB21","series-title":"Proceedings AAAI-92","first-page":"459","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992"},{"key":"10.1016\/0004-3702(95)00054-2_BIB22","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0004-3702(95)00054-2_BIB23","author":"Pearl","year":"1984"},{"key":"10.1016\/0004-3702(95)00054-2_BIB24","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0004-3702(95)00057-7","article-title":"Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems","volume":"81","author":"Pemberton","year":"1996","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00054-2_BIB25","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\/0004-3702(95)00054-2_BIB26","series-title":"Proceedings AAAI-92","first-page":"472","article-title":"Using deep structure to locate hard problems","author":"Williams","year":"1992"},{"key":"10.1016\/0004-3702(95)00054-2_BIB27","series-title":"Proceedings of AAAI-93","first-page":"152","article-title":"Extending deep structure","author":"Williams","year":"1993"},{"key":"10.1016\/0004-3702(95)00054-2_BIB28","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0004-3702(94)90104-X","article-title":"Exploiting the deep structure of constraint problems","volume":"70","author":"Williams","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00054-2_BIB29","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1038\/scientificamerican0879-158","article-title":"Problems in physics with many scales of length","volume":"241","author":"Wilson","year":"1979","journal-title":"Scientific American"},{"key":"10.1016\/0004-3702(95)00054-2_BIB30","series-title":"Proceedings AAAI-92","first-page":"545","article-title":"An average-case analysis of branch-and-bound with applications: summary of results","author":"Zhang","year":"1992"},{"key":"10.1016\/0004-3702(95)00054-2_BIB31","series-title":"Proceedings AAAI-93","first-page":"769","article-title":"Depth-first vs. best-first search: new results","author":"Zhang","year":"1993"},{"key":"10.1016\/0004-3702(95)00054-2_BIB32","series-title":"Working Notes of AAAI 1994 Workshop on Experimental Evaluation of Reasoning and Search Methods","article-title":"A unified view of complexity transitions on the traveling salesman problem","author":"Zhang","year":"1994"},{"key":"10.1016\/0004-3702(95)00054-2_BIB33","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0004-3702(94)00047-6","article-title":"Performance of linear-space search algorithms","volume":"79","author":"Zhang","year":"1995","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00054-2_BIB34","series-title":"Proceedings of AAAI-94","article-title":"Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems\u2014initial results","author":"Zhang","year":"1994"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000542?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000542?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:29:32Z","timestamp":1556396972000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370295000542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0004370295000542"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00054-2","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}