{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:05:12Z","timestamp":1747652712863},"reference-count":21,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0305-0548(94)90012-4","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"801-822","source":"Crossref","is-referenced-by-count":16,"title":["Optimization by ghost image processes in neural networks"],"prefix":"10.1016","volume":"21","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90012-4_BIB1","series-title":"Self-Organization and Associative Memory","author":"Kohonen","year":"1988"},{"key":"10.1016\/0305-0548(94)90012-4_BIB2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","article-title":"Neural computation of decisions in optimization problems","volume":"52","author":"Hopfield","year":"1985","journal-title":"Biol. Cybernetics"},{"key":"10.1016\/0305-0548(94)90012-4_BIB3","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing: an experimental evaluation; part 1, graph partitioning","volume":"37","author":"Johnson","year":"1989","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90012-4_BIB4","series-title":"Modern Heuristic Techniques for Combinatorial Problems","article-title":"Tabu Search","author":"Glover","year":"1992"},{"key":"10.1016\/0305-0548(94)90012-4_BIB5","series-title":"OR Spectrum","first-page":"131","article-title":"Tabu search techniques: a tutorial and an application to neural networks","author":"de Werra","year":"1989"},{"key":"10.1016\/0305-0548(94)90012-4_BIB6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0305-0548(92)90050-F","article-title":"Connectionist approaches to the quadratic assignment problem","volume":"19","author":"Chakprani","year":"1992","journal-title":"J. Computers Ops Res."},{"key":"10.1016\/0305-0548(94)90012-4_BIB7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0893-6080(88)90002-0","article-title":"Self-organizing feature maps and the travelling salesman problem","volume":"1","author":"Ang\u00e9niol","year":"1988","journal-title":"Neural Networks"},{"key":"10.1016\/0305-0548(94)90012-4_BIB8","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1038\/326689a0","article-title":"An analogue approach to the TSP using an elastic net method","volume":"326","author":"Durbin","year":"1987","journal-title":"Nature"},{"key":"10.1016\/0305-0548(94)90012-4_BIB9","series-title":"A self-organizing Map Approach for TSPs","author":"El Ghaziri","year":"1990"},{"key":"10.1016\/0305-0548(94)90012-4_BIB10","series-title":"A New Approach to the Travelling Salesman Problem Using Kohonen Maps","author":"Geraci","year":"1991"},{"key":"10.1016\/0305-0548(94)90012-4_BIB11","unstructured":"F. Glover, E. Taillard and D. de Werra, A user's guide to tabu search. To appear in Ann. Pps Res.."},{"key":"10.1016\/0305-0548(94)90012-4_BIB12","series-title":"Artificial Neural Networks","first-page":"829","article-title":"Solving routing problems by a self-organizing map","author":"El Gahziri","year":"1991"},{"key":"10.1016\/0305-0548(94)90012-4_BIB13","series-title":"A Tabu search approach for multilevel generalized assignment problems","author":"Laguna","year":"1991"},{"key":"10.1016\/0305-0548(94)90012-4_BIB14","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1287\/opre.13.6.879","article-title":"A multiphase-dual algorithm for the zero-one integer programming problem","volume":"13","author":"Glover","year":"1965","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90012-4_BIB15","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","article-title":"Heuristics for integer programming using surrogate constraints","volume":"8","author":"Glover","year":"1977","journal-title":"Decis. Sci."},{"key":"10.1016\/0305-0548(94)90012-4_BIB16","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","article-title":"A greedy heuristic for the set covering problem","volume":"4","author":"Chvatal","year":"1979","journal-title":"Maths Ops Res."},{"key":"10.1016\/0305-0548(94)90012-4_BIB17","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1287\/mnsc.15.4.B196","article-title":"An approach to linear programming with 0\u20131 variables","volume":"15","author":"Senju","year":"1968","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90012-4_BIB18","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1287\/mnsc.21.12.1417","article-title":"A simplified algorithm for obtaining approximate solutions to zero-one programming problems","volume":"21","author":"Toyoda","year":"1975","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90012-4_BIB19","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BF02591863","article-title":"Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality","volume":"31","author":"Gavish","year":"1985","journal-title":"Mathl Program"},{"key":"10.1016\/0305-0548(94)90012-4_BIB20","first-page":"78","article-title":"An efficient preprocessing procedure for the solution of the 0\u20131 multiknapsack problem to optimality","volume":"31","author":"Freville","year":"1991","journal-title":"Mathl Program"},{"key":"10.1016\/0305-0548(94)90012-4_BIB21","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Computers Ops Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900124?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900124?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T16:06:08Z","timestamp":1682525168000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":21,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0305054894900124"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90012-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}