{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T05:21:35Z","timestamp":1774329695858,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":6080,"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,12]]},"DOI":"10.1016\/s0004-3702(96)00030-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:37:38Z","timestamp":1027625858000},"page":"349-358","source":"Crossref","is-referenced-by-count":91,"title":["The TSP phase transition"],"prefix":"10.1016","volume":"88","author":[{"given":"Ian P.","family":"Gent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(96)00030-6_BIB1","first-page":"145","article-title":"Finite-size scaling","volume":"8","author":"Barber","year":"1983","journal-title":"Phase Transit. Critic. Phenomena"},{"key":"10.1016\/S0004-3702(96)00030-6_BIB2","first-page":"299","article-title":"The shortest path through many points","volume":"55","author":"Beardwood","year":"1959"},{"key":"10.1016\/S0004-3702(96)00030-6_BIB3","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/1026105","article-title":"The n-city travelling salesman problem: statistical mechanics and the Metropolis algorithm","volume":"26","author":"Bonomi","year":"1984","journal-title":"SIAM Rev."},{"key":"10.1016\/S0004-3702(96)00030-6_BIB4","series-title":"Proceedings IJCAI-91","first-page":"331","article-title":"Where the really hard problems are","author":"Cheeseman","year":"1991"},{"key":"10.1016\/S0004-3702(96)00030-6_BIB5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0004-3702(95)00046-1","article-title":"Experimental results on the crossover point in random 3SAT","volume":"81","author":"Crawford","year":"1996","journal-title":"Artif. Intell."},{"key":"10.1016\/S0004-3702(96)00030-6_BIB6","author":"Garey","year":"1979"},{"key":"10.1016\/S0004-3702(96)00030-6_BIB7","series-title":"Principles and Practice of Constraint Programming\u2014CP95","first-page":"70","article-title":"Scaling effects in the CSP phase transition","author":"Gent","year":"1995"},{"key":"10.1016\/S0004-3702(96)00030-6_BIB8","article-title":"The constrainedness of search","author":"Gent","year":"1996"},{"key":"10.1016\/S0004-3702(96)00030-6_BIB9","unstructured":"also in: Proceedings AAAI-96 (to appear)."},{"key":"10.1016\/S0004-3702(96)00030-6_BIB10","series-title":"KI-94: Advances in Artificial Intelligence. 18th German Annual Conference on Artificial Intelligence","first-page":"355","article-title":"The hardest random SAT problems","author":"Gent","year":"1994"},{"key":"10.1016\/S0004-3702(96)00030-6_BIB11","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0004-3702(94)90109-0","article-title":"Easy problems are sometimes hard","volume":"70","author":"Gent","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/S0004-3702(96)00030-6_BIB12","article-title":"The TSP phase transition","author":"Gent","year":"1995"},{"key":"10.1016\/S0004-3702(96)00030-6_BIB13","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0004-3702(94)90088-4","article-title":"The hardest constraint problems: a double phase transition","volume":"69","author":"Hogg","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/S0004-3702(96)00030-6_BIB14","series-title":"Proceedings 7th Annual ACM-SIAM Symposium on Discrete Algorithms","article-title":"Asymptotic experimental analysis for the Held-Karp traveling salesman bound","author":"Johnson","year":"1996"},{"key":"10.1016\/S0004-3702(96)00030-6_BIB15","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S0004-3702(96)00030-6_BIB16","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1126\/science.264.5163.1297","article-title":"Critical behavior in the satisfiability of random boolean expressions","volume":"264","author":"Kirkpatrick","year":"1994","journal-title":"Science"},{"key":"10.1016\/S0004-3702(96)00030-6_BIB17","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1145\/3341.3344","article-title":"Statistical mechanics and disordered systems","volume":"28","author":"Kirkpatrick","year":"1985","journal-title":"Cammun. ACM"},{"key":"10.1016\/S0004-3702(96)00030-6_BIB18","series-title":"The Traveling Salesman Problem","year":"1985"},{"key":"10.1016\/S0004-3702(96)00030-6_BIB19","series-title":"Proceedings AAAI-92","first-page":"459","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992"},{"key":"10.1016\/S0004-3702(96)00030-6_BIB20","series-title":"Proceedings ECAI-94","first-page":"95","article-title":"Binary constraint satisfaction problems: some are harder than others","author":"Prosser","year":"1994"},{"key":"10.1016\/S0004-3702(96)00030-6_BIB21","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB\u2014a traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0004-3702(96)00030-6_BIB22","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(95)00056-9","article-title":"Critical behavior in the computational cost of satisfiability testing","volume":"81","author":"Selman","year":"1996","journal-title":"Artif. Intell."},{"key":"10.1016\/S0004-3702(96)00030-6_BIB23","series-title":"Proceedings ECAI-94","first-page":"100","article-title":"Phase transition and the mushy region in constraint satisfaction problems","author":"Smith","year":"1994"},{"key":"10.1016\/S0004-3702(96)00030-6_BIB24","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1051\/jphyslet:0198400450240114500","article-title":"On the statistical mechanics of optimization problems of the travelling salesman type","volume":"45","author":"Vannimenus","year":"1984","journal-title":"J. Phys. Lett."},{"key":"10.1016\/S0004-3702(96)00030-6_BIB25","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"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370296000306?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370296000306?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T17:57:18Z","timestamp":1555523838000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370296000306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["S0004370296000306"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(96)00030-6","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}