{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T10:36:40Z","timestamp":1781606200296,"version":"3.54.5"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2001,12]]},"DOI":"10.1023\/a:1012793906010","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T14:27:29Z","timestamp":1040653649000},"page":"397-414","source":"Crossref","is-referenced-by-count":103,"title":["An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Vicente","family":"Campos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manuel","family":"Laguna","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rafael","family":"Mart\u00ed","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"360687_CR1","unstructured":"Becker, O. (1967), Das Helmst\u00e4dtersche Reihenfolgeproblem-die Effizienz verschiedener N\u00e4herungsverfahren in Computer uses in the Social Sciences, Berichteiner Working Conference, Wien, January 1967."},{"key":"360687_CR2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF00249646","volume":"6","author":"S. Chanas","year":"1996","unstructured":"Chanas, S. and Kobylanski, P. (1996), A new heuristic algorithm solving the linear ordering problem, Computational Optimization and Applications, 6, 191\u2013205.","journal-title":"Computational Optimization and Applications"},{"key":"360687_CR3","series-title":"ONR Research Memorandum","doi-asserted-by":"crossref","DOI":"10.21236\/AD0600965","volume-title":"Probabilistic and Parametric Learning Combinations of Local Job Shop Scheduling Rules","author":"W. B. Crowston","year":"1963","unstructured":"Crowston, W. B., Glover, F., Thompson, G. L. and Trawick, J. D., (1963), Probabilistic and Parametric Learning Combinations of Local Job Shop Scheduling Rules, ONR Research Memorandum No. 117, GSIA, Carnegie Mellon University, Pittsburgh, PA."},{"key":"360687_CR4","first-page":"1","volume":"2","author":"T. Feo","year":"1995","unstructured":"Feo, T. and Resende, M. G. C. (1995), Greedy randomized adaptive search procedures, Journal of Global Optimization, 2, 1\u201327.","journal-title":"Journal of Global Optimization"},{"key":"360687_CR5","unstructured":"Fisher, H. and Thompson, G. L. (1963), Probabilistic learning combinations of local job-shop scheduling rules, in Industrial Scheduling, J. F. Muth and G. L. Thompson (eds.) Prentice-Hall, pp. 225\u2013251."},{"issue":"6","key":"360687_CR6","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1287\/opre.13.6.879","volume":"13","author":"F. Glover","year":"1965","unstructured":"Glover, F. (1965), A multiphase dual algorithm for the zero-one integer programming problem, Operations Research 13(6), 879\u2013919.","journal-title":"Operations Research"},{"key":"360687_CR7","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/opre.16.4.741","volume":"16","author":"F. Glover","year":"1968","unstructured":"Glover, F. (1968), Surrogate constraints, Operations Research 16, 741\u2013749.","journal-title":"Operations Research"},{"key":"360687_CR8","series-title":"Artificial Evolution, Lecture Notes in Computer Science","first-page":"13","volume-title":"A template for scatter search and path relinking","author":"F. Glover","year":"1998","unstructured":"Glover, F. (1998), A template for scatter search and path relinking, in Artificial Evolution, Lecture Notes in Computer Science 1363, J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer and D. Snyers (Eds.), Springer, Berlin, pp. 13\u201354."},{"key":"360687_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F. and Laguna, M. (1997), Tabu Search, Kluwer Academic Publishers, Boston, MA."},{"issue":"6","key":"360687_CR10","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M. Grotschel","year":"1984","unstructured":"Grotschel, M., Junger, M. and Reinelt, G. (1984), A cutting plane algorithm for the linear ordering problem, Operations Research 32(6), 1195\u20131220.","journal-title":"Operations Research"},{"key":"360687_CR11","volume-title":"The Stanford GraphBase: A Platform for Combinatorial Computing","author":"D. E. Knuth","year":"1993","unstructured":"Knuth, D. E. (1993), The Stanford GraphBase: A Platform for Combinatorial Computing, Addison-Wesley, New York."},{"key":"360687_CR12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0957-4174(93)90056-C","volume":"6","author":"M. Laguna","year":"1993","unstructured":"Laguna, M. and Glover, F. (1993), Integrating target analysis and tabu search for improved scheduling systems, Expert Systems with Applications 6, 287\u2013297.","journal-title":"Expert Systems with Applications"},{"key":"360687_CR13","doi-asserted-by":"crossref","unstructured":"Laguna, M., Mart\u00ed, R. and Campos, V. (1998), Intensification and diversification with elite tabu search solutions for the linear ordering problem, to appear in Computers and Operations Research.","DOI":"10.1016\/S0305-0548(98)00104-X"},{"key":"360687_CR14","unstructured":"LOLIB (1997), http:\/\/www.iwr.uni-heidelberg.de\/iwr\/comopt\/soft.LOLIB\/LOLIB.html."},{"key":"360687_CR15","series-title":"Research and Exposition in Mathematics","volume-title":"The Linear Ordering Problem: Algorithms and Applications","author":"G. Reinelt","year":"1985","unstructured":"Reinelt, G. (1985) The Linear Ordering Problem: Algorithms and Applications, Research and Exposition in Mathematics, Vol. 8, H. H. Hofmann and R. Wille (Eds.), Heldermann, Berlin."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1012793906010.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1012793906010\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1012793906010.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:43:40Z","timestamp":1751366620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1012793906010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["360687"],"URL":"https:\/\/doi.org\/10.1023\/a:1012793906010","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}