{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T02:34:11Z","timestamp":1698633251594},"reference-count":49,"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)00057-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:24:09Z","timestamp":1027657449000},"page":"297-325","source":"Crossref","is-referenced-by-count":8,"title":["Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems"],"prefix":"10.1016","volume":"81","author":[{"given":"Joseph C.","family":"Pemberton","sequence":"first","affiliation":[]},{"given":"Weixiong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00057-7_BIB1","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1287\/opre.18.3.541","article-title":"An experimental investigation and comparative evaluation of flow-shop scheduling techniques","volume":"18","author":"Ashour","year":"1970","journal-title":"Oper. Res."},{"key":"10.1016\/0004-3702(95)00057-7_BIB2","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)00057-7_BIB3","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)00057-7_BIB4","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)00057-7_BIB5","series-title":"Proceedings 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)00057-7_BIB6","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/3828.3830","article-title":"Generalized best-first search strategies and the optimally of A\u2217","volume":"32","author":"Dechter","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(95)00057-7_BIB7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","article-title":"Partial constraint satisfaction","volume":"58","author":"Freuder","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00057-7_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)00057-7_BIB9","author":"Garey","year":"1979"},{"key":"10.1016\/0004-3702(95)00057-7_BIB10","series-title":"Computer Science Department, Carnegie-Mellon University, Tech. Report CMU-CS-79-124","article-title":"Performance measurement and analysis of certain search algorithms","author":"Gaschnig","year":"1979"},{"key":"10.1016\/0004-3702(95)00057-7_BIB11","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Oper. Res."},{"key":"10.1016\/0004-3702(95)00057-7_BIB12","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)00057-7_BIB13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/moor.1.3.287","article-title":"Computational efficiency of approximate branch-and-bound algorithms","volume":"1","author":"Ibaraki","year":"1976","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0004-3702(95)00057-7_BIB14","article-title":"Enumerative Approaches to Combinatorial Optimization\u2014Part I","volume":"10","author":"Ibaraki","year":"1987"},{"key":"10.1016\/0004-3702(95)00057-7_BIB15","first-page":"177","article-title":"Using branch-and-bound algorithms to obtain suboptimal solutions","volume":"27","author":"Ibaraki","year":"1983","journal-title":"Z Oper. Res."},{"key":"10.1016\/0004-3702(95)00057-7_BIB16","series-title":"Proceedings 17th International Colloquium on Automata, Languages and Programming","article-title":"Local optimization and the traveling salesman problem","author":"Johnson","year":"1990"},{"key":"10.1016\/0004-3702(95)00057-7_BIB17","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.28.5.1086","article-title":"Local search for the asymmetric traveling salesman problem","volume":"28","author":"Kanellakis","year":"1980","journal-title":"Oper. Res."},{"key":"10.1016\/0004-3702(95)00057-7_BIB18","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\/0004-3702(95)00057-7_BIB19","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)00057-7_BIB20","series-title":"Computer and Job-Shop Scheduling Theory","article-title":"Enumerative and iterative computational approaches","author":"Kohler","year":"1976"},{"key":"10.1016\/0004-3702(95)00057-7_BIB21","series-title":"Exploring Artificial Intelligence","first-page":"197","article-title":"Search: a survey of recent results","author":"Korf","year":"1989"},{"key":"10.1016\/0004-3702(95)00057-7_BIB22","series-title":"Working Notes of AAAI-93 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)00057-7_BIB23","author":"Lawler","year":"1985"},{"key":"10.1016\/0004-3702(95)00057-7_BIB24","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)00057-7_BIB25","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/0004-3702(95)00057-7_BIB26","author":"Martello","year":"1990"},{"key":"10.1016\/0004-3702(95)00057-7_BIB27","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)00057-7_BIB28","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)00057-7_BIB29","unstructured":"D.L. Miller, Personal communication (1992)."},{"key":"10.1016\/0004-3702(95)00057-7_BIB30","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1126\/science.251.4995.754","article-title":"Exact solution of large asymmetric traveling salesman problems","volume":"251","author":"Miller","year":"1991","journal-title":"Science"},{"key":"10.1016\/0004-3702(95)00057-7_BIB31","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","article-title":"Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems","volume":"58","author":"Minton","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00057-7_BIB32","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)00057-7_BIB33","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/322203.322213","article-title":"Flowshop scheduling with limited temporary storage","volume":"27","author":"Papadimitriou","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(95)00057-7_BIB34","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0004-3702(95)00057-7_BIB35","author":"Pearl","year":"1984"},{"key":"10.1016\/0004-3702(95)00057-7_BIB36","first-page":"55","article-title":"Practical and theoretical considerations in heuristic search algorithms","volume":"8","author":"Pohl","year":"1977"},{"key":"10.1016\/0004-3702(95)00057-7_BIB37","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1057\/jors.1972.52","article-title":"On the flow-shop sequencing problem with no wait in process","volume":"23","author":"Reddi","year":"1972","journal-title":"Oper. Res. Q."},{"key":"10.1016\/0004-3702(95)00057-7_BIB38","author":"R\u0144yi","year":"1970"},{"key":"10.1016\/0004-3702(95)00057-7_BIB39","series-title":"Proceedings AAAI-92","first-page":"440","article-title":"A new method for solving hard satisfiability problems","author":"Selman","year":"1992"},{"key":"10.1016\/0004-3702(95)00057-7_BIB40","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)00057-7_BIB41","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":"Sci. Amer."},{"key":"10.1016\/0004-3702(95)00057-7_BIB42","series-title":"Working Notes of AAAI-93 Spring Symposium: AI and NP-Hard Problems","first-page":"160","article-title":"Truncated branch-and-bound: a case study on the asymmetric TSP","author":"Zhang","year":"1993"},{"key":"10.1016\/0004-3702(95)00057-7_BIB43","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)00057-7_BIB44","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)00057-7_BIB45","series-title":"Working Notes of AAAI-94 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)00057-7_BIB46","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)00057-7_BIB47","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0004-3702(95)00054-2","article-title":"A study of complexity transitions on the asymmetric traveling salesman problem","volume":"81","author":"Zhang","year":"1996","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00057-7_BIB48","article-title":"Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems","author":"Zhang","year":"1994"},{"key":"10.1016\/0004-3702(95)00057-7_BIB49","series-title":"Proceedings 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:0004370295000577?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000577?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T10:27:31Z","timestamp":1555064851000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370295000577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":49,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0004370295000577"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00057-7","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}