{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:34:27Z","timestamp":1760708067669},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,7,3]],"date-time":"2009-07-03T00:00:00Z","timestamp":1246579200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10589-009-9270-5","type":"journal-article","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:34:57Z","timestamp":1246534497000},"page":"697-715","source":"Crossref","is-referenced-by-count":17,"title":["Tabu search for the linear ordering problem with\u00a0cumulative costs"],"prefix":"10.1007","volume":"48","author":[{"given":"Abraham","family":"Duarte","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Laguna","sequence":"additional","affiliation":[]},{"given":"Rafael","family":"Mart\u00ed","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,7,3]]},"reference":[{"issue":"1","key":"9270_CR1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/opre.1050.0243","volume":"54","author":"B. Adenso-D\u00edaz","year":"2006","unstructured":"Adenso-D\u00edaz, B., Laguna, M.: Fine-tuning of algorithms using partial experimental designs and local search. Oper. Res. 54(1), 99\u2013114 (2006)","journal-title":"Oper. Res."},{"key":"9270_CR2","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","volume":"1","author":"R.M. Aiex","year":"2008","unstructured":"Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: TTTPLOTS: A Perl program to create time-to-target plots. Optim. Lett. 1, 355\u2013366 (2008)","journal-title":"Optim. Lett."},{"key":"9270_CR3","unstructured":"Becker, O.: Das Helmst\u00e4dtersche Reihenfolgeproblem\u2014die Effizienz verschiedener N\u00e4herungsverfahren. In: Computer Uses in the Social Sciences. Bericht einer Working Conference, Wien, January 1967"},{"key":"9270_CR4","unstructured":"Benvenuto, N., Carnevale, G., Tomasin, S.: Optimum power control and ordering in SIC receivers for uplink CDMA systems. In: IEEE-ICC 2005, Seoul, Korea, 2005"},{"issue":"3","key":"9270_CR5","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1016\/j.ejor.2006.03.071","volume":"189","author":"L. Bertacco","year":"2008","unstructured":"Bertacco, L., Brunetta, L., Fischetti, M.: The linear ordering problem with cumulative costs. Eur. J. Oper. Res. 189(3), 1345\u20131357 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9270_CR6","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1023\/A:1012793906010","volume":"21","author":"V. Campos","year":"2001","unstructured":"Campos, V., Glover, F., Laguna, M., Mart\u00ed, R.: An experimental evaluation of a scatter search for the linear ordering problem. J. Glob. Optim. 21, 397\u2013414 (2001)","journal-title":"J. Glob. Optim."},{"key":"9270_CR7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF00249646","volume":"6","author":"S. Chanas","year":"1996","unstructured":"Chanas, S., Kobylanski, P.: A new heuristic algorithm solving the linear ordering problem. Comput. Optim. Appl. 6, 191\u2013205 (1996)","journal-title":"Comput. Optim. Appl."},{"key":"9270_CR8","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"T.A. Feo","year":"1994","unstructured":"Feo, T.A., Resende, M.G.C., Smith, S.H.: A greedy randomized search procedure for maximum independence set. Oper. Res. 42, 860\u2013878 (1994)","journal-title":"Oper. Res."},{"key":"9270_CR9","doi-asserted-by":"crossref","first-page":"3549","DOI":"10.1016\/j.cor.2005.03.032","volume":"33","author":"C. Garc\u00eda","year":"2006","unstructured":"Garc\u00eda, C., P\u00e9rez, D., Campos, V., Mart\u00ed, R.: Variable neighborhood search for the linear ordering problem. Comput. Oper. Res. 33, 3549\u20133565 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9270_CR10","series-title":"Lecture Notes in Computer Science","first-page":"13","volume-title":"Artificial Evolution","author":"F. Glover","year":"1998","unstructured":"Glover, F.: A template for scatter search and path relinking. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) Artificial Evolution. Lecture Notes in Computer Science, vol.\u00a01363, pp.\u00a013\u201354. Springer, Berlin (1998)"},{"issue":"6","key":"9270_CR11","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., Reinelt, G.: A cutting plane algorithm for the linear ordering problem. Oper. Res. 32(6), 1195\u20131220 (1984)","journal-title":"Oper. Res."},{"key":"9270_CR12","doi-asserted-by":"crossref","unstructured":"Hoos, H.H., St\u00fctzle, T.: Evaluating Las Vegas algorithms\u2014pitfalls and remedies. In: Proc. of the 14th Conf. on Uncertainty in Artificial Intelligence, pp.\u00a0238\u2013245 (1998)","DOI":"10.1007\/978-3-7091-6492-1_54"},{"key":"9270_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0337-8","volume-title":"Scatter Search\u2014Methodology and Implementations","author":"M. Laguna","year":"2003","unstructured":"Laguna, M., Mart\u00ed, R.: Scatter Search\u2014Methodology and Implementations. Kluwer Academic, Boston (2003)"},{"key":"9270_CR14","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1016\/S0305-0548(98)00104-X","volume":"26","author":"M. Laguna","year":"1999","unstructured":"Laguna, M., Mart\u00ed, R., Campos, V.: Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comput. Oper. Res. 26, 1217\u20131230 (1999)","journal-title":"Comput. Oper. Res."},{"key":"9270_CR15","doi-asserted-by":"crossref","unstructured":"Mart\u00ed, R., Reinelt, G., Duarte, A.: Linear ordering LIBrary. http:\/\/heur.uv.es\/optsicom\/LOLIB (2009)","DOI":"10.1007\/978-3-642-16729-4_6"},{"key":"9270_CR16","volume-title":"Digital Communications","author":"J.G. Proakis","year":"2004","unstructured":"Proakis, J.G.: Digital Communications, 4th edn. McGraw-Hill, New York (2004)","edition":"4"},{"key":"9270_CR17","volume-title":"Research and Exposition in Mathematics","author":"G. Reinelt","year":"1985","unstructured":"Reinelt, G.: The linear ordering problem: Algorithms and applications. In: Hofmann, H.H., Wille, R. (eds.) Research and Exposition in Mathematics, vol.\u00a08. Heldermann, Berlin (1985)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9270-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-009-9270-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9270-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:36Z","timestamp":1559288196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-009-9270-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,3]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9270"],"URL":"https:\/\/doi.org\/10.1007\/s10589-009-9270-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,3]]}}}