{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T21:13:48Z","timestamp":1774473228889,"version":"3.50.1"},"reference-count":72,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Leslie M. Westbrook Endowment Fund"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3672782","type":"journal-article","created":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T19:38:23Z","timestamp":1773257903000},"page":"43024-43037","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing Scatter Search for the Linear Ordering Problem by Relaxation Adaptive Memory Programming"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1713-2494","authenticated-orcid":false,"given":"Cesar","family":"Rego","sequence":"first","affiliation":[{"name":"School of Business Administration, University of Mississippi, University, MS, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8720-8597","authenticated-orcid":false,"given":"Dorabela","family":"Gamboa","sequence":"additional","affiliation":[{"name":"Center for Innovation and Research in Business Sciences and Information Systems (CIICESI), Escola Superior de Tecnologia e Gestão, Instituto Politécnico do Porto, Felgueiras, Portugal"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-23667-8_20"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4102-8_1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009642405419"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-7796(03)00147-0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(99)00100-0"},{"key":"ref6","first-page":"379","volume-title":"Lagrangian Tabu Search","author":"Gr\u00fcnert","year":"2002"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1030.0036"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.08.015"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00268-X"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-010-0800-4"},{"key":"ref11","article-title":"Algorithms for very large-scale set covering problems","author":"Ablanedo-Rosas","year":"2007"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-018-9368-y"},{"key":"ref13","article-title":"Algorithms for very large scale multi-resource generalized assignment problems","author":"Sagbansua","year":"2004"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-023-09920-8"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-021-09757-z"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-021-09756-0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-96305-7_19"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-71921-4_3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.11.018"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s13675-014-0023-6"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-014-9260-3"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5585939"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.01.009"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.06.104"},{"key":"ref25","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican1051-15"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.20.8.1190"},{"key":"ref28","first-page":"577","article-title":"Mathematics without numbers","volume":"88","author":"Kemeny","year":"1959","journal-title":"Amer. Acad. Arts Sci."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/0135023"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.2307\/2332752"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.6.1195"},{"key":"ref32","first-page":"138","volume-title":"Reihenfolgeprobleme: Mean-flow-time Sequencing","volume":"74","author":"Boenchendorf","year":"1982"},{"key":"ref33","article-title":"Comparison of approaches for solving coupled task problems","author":"B\u00e9k\u00e9si","year":"2008"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/321707.321710"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-009-0648-7"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-016-1047-z"},{"key":"ref37","volume-title":"The Linear Ordering Problem: Algorithms and Applications","volume":"95","author":"Reinelt","year":"1985"},{"key":"ref38","first-page":"884","article-title":"Generating tests by exploiting designed behavior","volume-title":"Proc. 5th Nat. Conf. Artif. Intell. (AAAI)","author":"Shirley"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90022-3"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/37888.37916"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1613\/jair.587"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1613\/jair.991"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90179-1"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00001"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.3115\/1699571.1699644"},{"key":"ref46","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16729-4","volume-title":"The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization","author":"Mart?","year":"2011"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-010-9384-9"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1023\/B:JMMA.0000049426.06305.d8"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00104-X"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.03.032"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012793906010"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.09.041"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.01.053"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105998"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1299\/jamdsm.2022jamdsm0041"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2010.00778.x"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3628605"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104861"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4137-7_3"},{"issue":"4","key":"ref60","first-page":"142","article-title":"Lagrangian relaxation and pegging test for linear ordering problems","volume":"54","author":"Sukegawa","year":"2011","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0337-8"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1287\/opre.23.3.434"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(69)90061-5"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584070"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584228"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/BF02085641"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580223"},{"key":"ref68","volume-title":"Topics on Tournaments","author":"Moon","year":"1968"},{"key":"ref69","volume-title":"LOLIB: Linear Ordering Library","author":"Reinelt","year":"1997"},{"key":"ref70","volume-title":"The Stanford GraphBase: A Platform for Combinatorial Computing","author":"Knuth","year":"1993"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/BF00249646"},{"key":"ref72","volume-title":"PassMark Software: CPU Benchmarks","year":"2026"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11429701.pdf?arnumber=11429701","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T19:57:57Z","timestamp":1774468677000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11429701\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":72,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3672782","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}