{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T03:27:09Z","timestamp":1771039629325,"version":"3.50.1"},"reference-count":36,"publisher":"Informa UK Limited","issue":"5","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72201053"],"award-info":[{"award-number":["72201053"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71971052"],"award-info":[{"award-number":["71971052"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2021M700716"],"award-info":[{"award-number":["2021M700716"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2023GFZD01"],"award-info":[{"award-number":["2023GFZD01"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of the Operational Research Society"],"published-print":{"date-parts":[[2024,5,3]]},"DOI":"10.1080\/01605682.2023.2228339","type":"journal-article","created":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T22:09:52Z","timestamp":1689286192000},"page":"1000-1010","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":4,"title":["An effective hybrid search method for the quadratic knapsack problem with conflict graphs"],"prefix":"10.1080","volume":"75","author":[{"given":"Qing","family":"Zhou","sequence":"first","affiliation":[{"name":"School of Business Administration & Institute of Behavioral and Service Operations Management, Northeastern University, Shenyang, China"}]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[{"name":"LERIA, Universit\u00e9 d\u2019Angers, Angers Cedex 01, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0616-9416","authenticated-orcid":false,"given":"Zhong-Zhong","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Business Administration & Institute of Behavioral and Service Operations Management, Northeastern University, Shenyang, China"}]},{"given":"Qinghua","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Management, Huazhong University of Science and Technology, Wuhan, China"}]}],"member":"301","published-online":{"date-parts":[[2023,7,13]]},"reference":[{"key":"e_1_3_4_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2011.12.011"},{"key":"e_1_3_4_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2021.1913078"},{"key":"e_1_3_4_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00244-3"},{"key":"e_1_3_4_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100665"},{"key":"e_1_3_4_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.10.030"},{"key":"e_1_3_4_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2017.10.008"},{"key":"e_1_3_4_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2022.06.009"},{"key":"e_1_3_4_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.023"},{"key":"e_1_3_4_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02406-2"},{"key":"e_1_3_4_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-019-03290-3"},{"key":"e_1_3_4_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113224"},{"key":"e_1_3_4_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_33"},{"key":"e_1_3_4_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23247-3_6"},{"key":"e_1_3_4_15_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602046"},{"key":"e_1_3_4_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.10.004"},{"key":"e_1_3_4_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7_9"},{"key":"e_1_3_4_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2016.08.004"},{"key":"e_1_3_4_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.3002495"},{"key":"e_1_3_4_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"e_1_3_4_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.07.016"},{"key":"e_1_3_4_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-010-9128-0"},{"key":"e_1_3_4_23_1","first-page":"219","volume-title":"New ideas in optimization","author":"Moscato P.","year":"1999","unstructured":"Moscato, P. (1999). Memetic algorithms: A short introduction. In D. Corne, M. Dorigo, F. Glover, D. Dasgupta, R. Poli, & K. V. Price (eds.), New ideas in optimization (pp. 219\u2013234). McGraw-Hill Ltd."},{"key":"e_1_3_4_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.11.003"},{"key":"e_1_3_4_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbspro.2014.01.101"},{"key":"e_1_3_4_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-016-0035-7"},{"key":"e_1_3_4_27_1","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2016049"},{"key":"e_1_3_4_28_1","doi-asserted-by":"publisher","DOI":"10.3390\/su9020236"},{"key":"e_1_3_4_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-018-9382-0"},{"key":"e_1_3_4_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.03.043"},{"key":"e_1_3_4_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105447"},{"key":"e_1_3_4_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2023.02.009"},{"key":"e_1_3_4_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-012-1124-3"},{"issue":"9","key":"e_1_3_4_34_1","first-page":"2864","article-title":"Heuristic and exact algorithms for the disjunctively constrained knapsack problem","volume":"43","author":"Yamada T.","year":"2002","unstructured":"Yamada, T., Kataoka, S., & Watanabe, K. (2002). Heuristic and exact algorithms for the disjunctively constrained knapsack problem. Information Processing Society of Japan Journal, 43(9), 2864\u20132870.","journal-title":"Information Processing Society of Japan Journal,"},{"key":"e_1_3_4_35_1","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2021.1911603"},{"key":"e_1_3_4_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2020.3027860"},{"key":"e_1_3_4_37_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602534"}],"container-title":["Journal of the Operational Research Society"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/01605682.2023.2228339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T10:59:26Z","timestamp":1713869966000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/01605682.2023.2228339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,13]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,5,3]]}},"alternative-id":["10.1080\/01605682.2023.2228339"],"URL":"https:\/\/doi.org\/10.1080\/01605682.2023.2228339","relation":{},"ISSN":["0160-5682","1476-9360"],"issn-type":[{"value":"0160-5682","type":"print"},{"value":"1476-9360","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,13]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tjor20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tjor20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2022-10-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-05-10","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}