{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T02:05:17Z","timestamp":1774922717531,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"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":[[1994,9]]},"DOI":"10.1016\/0167-6377(94)90065-5","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"101-113","source":"Crossref","is-referenced-by-count":263,"title":["A new adaptive multi-start technique for combinatorial global optimizations"],"prefix":"10.1016","volume":"16","author":[{"given":"Kenneth D.","family":"Boese","sequence":"first","affiliation":[]},{"given":"Andrew B.","family":"Kahng","sequence":"additional","affiliation":[]},{"given":"Sudhakar","family":"Muddu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(94)90065-5_BIB1","series-title":"A Connectionist Machine for Genetic Hillclimbing","author":"Ackley","year":"1987"},{"key":"10.1016\/0167-6377(94)90065-5_BIB2","doi-asserted-by":"crossref","first-page":"3023","DOI":"10.1088\/0305-4470\/22\/15\/018","article-title":"Ultrametricity, frustration and the graph colouring problem","volume":"22","author":"Bacci","year":"1989","journal-title":"J. Phy. A: Math. General"},{"key":"10.1016\/0167-6377(94)90065-5_BIB3","series-title":"Neural Networks for Computing","article-title":"Toward practical \u2018neural\u2019 computation for combinatorial optimization problems","author":"Baum","year":"1986"},{"key":"10.1016\/0167-6377(94)90065-5_BIB4","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","article-title":"Fast algorithms for geometric traveling salesman problems","volume":"4","author":"Bentley","year":"1992","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0167-6377(94)90065-5_BIB5","doi-asserted-by":"crossref","DOI":"10.1016\/0167-6911(94)90028-0","article-title":"Best-so-far vs. where-you-are: implications for optimal finite-time annealing","author":"Boese","year":"1994","journal-title":"Systems Control Lett."},{"key":"10.1016\/0167-6377(94)90065-5_BIB6","series-title":"Technical Report TR-930015","article-title":"On the big valley and adaptive multi-start for discrete global optimizations","author":"Boese","year":"1993"},{"key":"10.1016\/0167-6377(94)90065-5_BIB7","series-title":"Random Graphs","author":"Bollobas","year":"1985"},{"key":"10.1016\/0167-6377(94)90065-5_BIB8","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF02579448","article-title":"Graph bisection algorithms with good average case behavior","volume":"2","author":"Bui","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0167-6377(94)90065-5_BIB9","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1137\/0327055","article-title":"Optimization of globally convex functions","volume":"27","author":"Hu","year":"1989","journal-title":"SIAM J. Control Optim."},{"key":"10.1016\/0167-6377(94)90065-5_BIB10","series-title":"Proc. 17th Internat. Coll. on Automata, Languages and Programming","first-page":"446","article-title":"Local optimization and the traveling salesman problem","author":"Johnson","year":"1990"},{"key":"10.1016\/0167-6377(94)90065-5_BIB11","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing: an experimental evaluation, Part I, graph partitioning","volume":"37","author":"Johnson","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(94)90065-5_BIB12","unstructured":"D.S. Johnson and E.E. Rothberg, \u201cAsymptotic experimental analysis of the Held-Karp lower bound for the traveling salesman problem\u201d, (to appear)."},{"key":"10.1016\/0167-6377(94)90065-5_BIB13","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0022-5193(87)80029-2","article-title":"Toward a general theory of adaptive walks on rugged landscapes","volume":"128","author":"Kauffman","year":"1987","journal-title":"J. Theoret. Biol."},{"key":"10.1016\/0167-6377(94)90065-5_BIB14","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\/0167-6377(94)90065-5_BIB15","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1051\/jphys:019850046080127700","article-title":"Configuration space analysis of traveling salesman problems","volume":"46","author":"Kirkpatrick","year":"1985","journal-title":"J. de Phys."},{"key":"10.1016\/0167-6377(94)90065-5_BIB16","series-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"Lawler","year":"1985"},{"key":"10.1016\/0167-6377(94)90065-5_BIB17","doi-asserted-by":"crossref","first-page":"1285","DOI":"10.1051\/jphys:019860047080128500","article-title":"A replica analysis of the traveling salesman problem","volume":"47","author":"Mezard","year":"1986","journal-title":"J. Phys."},{"key":"10.1016\/0167-6377(94)90065-5_BIB18","series-title":"Proc. Internat. Conf. on Genetic Algorithms","first-page":"416","article-title":"Parallel genetic algorithms, population genetics and combinatorial optimization","author":"M\u00fchlenbein","year":"1989"},{"key":"10.1016\/0167-6377(94)90065-5_BIB19","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-8191(88)90098-1","article-title":"Evolution algorithms in combinatorial optimization","volume":"7","author":"M\u00fchlenbein","year":"1988","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-6377(94)90065-5_BIB20","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1137\/0221030","article-title":"The complexity of the Lin-Kernighan heuristic for the traveling salesman problem","volume":"21","author":"Papadimitriou","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6377(94)90065-5_BIB21","series-title":"Disordered Systems and Biological Organization","first-page":"283","article-title":"Configuration space analysis for optimization problems","author":"Solla","year":"1986"},{"key":"10.1016\/0167-6377(94)90065-5_BIB22","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01759051","article-title":"Efficient simulated annealing on fractal energy landscapes","volume":"6","author":"Sorkin","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/0167-6377(94)90065-5_BIB23","unstructured":"G.B. Sorkin (1993), personal communication."},{"key":"10.1016\/0167-6377(94)90065-5_BIB24","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1209\/0295-5075\/2\/12\/006","article-title":"Statistical mechanics and the traveling salesman problem","volume":"2","author":"Sourlas","year":"1986","journal-title":"Europhys. Lett."},{"key":"10.1016\/0167-6377(94)90065-5_BIB25","series-title":"Parallel Problem Solving from Nature","first-page":"109","article-title":"Genetic local search algorithms for the traveling salesman problem","author":"Ulder","year":"1990"},{"key":"10.1016\/0167-6377(94)90065-5_BIB26","series-title":"Proc. IEEE Internat. Conf. on Computer-Aided Design","first-page":"516","article-title":"A two-level two-way-partitioning algorithm","author":"Wei","year":"1990"},{"key":"10.1016\/0167-6377(94)90065-5_BIB27","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00202749","article-title":"Correlated and uncorrelated fitness landscapes and how to tell the difference","volume":"63","author":"Weinberger","year":"1990","journal-title":"Biol. Cybernet."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900655?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900655?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:52:53Z","timestamp":1552902773000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637794900655"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0167637794900655"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(94)90065-5","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}