{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T03:45:03Z","timestamp":1776743103489,"version":"3.51.2"},"reference-count":43,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100008759","name":"Hebei GEO University","doi-asserted-by":"publisher","award":["KY202307"],"award-info":[{"award-number":["KY202307"]}],"id":[{"id":"10.13039\/501100008759","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003787","name":"Hebei Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["F2020403013"],"award-info":[{"award-number":["F2020403013"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003482","name":"Department of Education of Hebei Province","doi-asserted-by":"publisher","award":["ZD2021016"],"award-info":[{"award-number":["ZD2021016"]}],"id":[{"id":"10.13039\/501100003482","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Expert Systems with Applications"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.eswa.2026.132294","type":"journal-article","created":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T23:47:58Z","timestamp":1776728878000},"page":"132294","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A set algebra-based heuristic algorithm with two-stage stochastic repair strategy for the quadratic knapsack problem with conflict graphs"],"prefix":"10.1016","volume":"323","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-2946-7155","authenticated-orcid":false,"given":"Hansong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8683-7570","authenticated-orcid":false,"given":"Yichao","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xizhao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-4190-8151","authenticated-orcid":false,"given":"Yi","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.eswa.2026.132294_bib0001","series-title":"Evolutionary computation for modeling and optimization","volume":"vol. 571","author":"Ashlock","year":"2006"},{"issue":"3","key":"10.1016\/j.eswa.2026.132294_bib0002","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1051\/ro\/2016049","article-title":"Probabilistic tabu search with multiple neighborhoods for the disjunctively constrained knapsack problem","volume":"51","author":"Ben Salem","year":"2017","journal-title":"RAIRO-Operations Research-Recherche Op\u00e9rationnelle"},{"key":"10.1016\/j.eswa.2026.132294_bib0003","doi-asserted-by":"crossref","first-page":"2025","DOI":"10.1007\/s00500-016-2465-7","article-title":"Optimization algorithms for the disjunctively constrained knapsack problem","volume":"22","author":"Ben Salem","year":"2018","journal-title":"Soft Computing"},{"issue":"1","key":"10.1016\/j.eswa.2026.132294_bib0004","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0305-0548(96)00032-9","article-title":"A genetic algorithm for the generalised assignment problem","volume":"24","author":"Chu","year":"1997","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.eswa.2026.132294_bib0005","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.ejor.2020.07.023","article-title":"A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts","volume":"289","author":"Coniglio","year":"2021","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2026.132294_bib0006","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10479-019-03290-3","article-title":"A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs","volume":"298","author":"Dahmani","year":"2021","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.eswa.2026.132294_bib0007","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113224","article-title":"A swarm optimization-based search algorithm for the quadratic knapsack problem with conflict graphs","volume":"148","author":"Dahmani","year":"2020","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2026.132294_bib0008","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2025.101927","article-title":"Djaya-rl: Discrete jaya algorithm integrating reinforcement learning for the discounted {0-1} knapsack problem","volume":"95","author":"Dai","year":"2025","journal-title":"Swarm and Evolutionary Computation"},{"issue":"1","key":"10.1016\/j.eswa.2026.132294_bib0009","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0377-2217(93)90097-7","article-title":"A cutting-plane approach to the edge-weighted maximal clique problem","volume":"69","author":"Dijkhuizen","year":"1993","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.eswa.2026.132294_bib0010","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCI.2006.329691","article-title":"Ant colony optimization","volume":"1","author":"Dorigo","year":"2006","journal-title":"IEEE Computational Intelligence Magazine"},{"issue":"3","key":"10.1016\/j.eswa.2026.132294_bib0011","doi-asserted-by":"crossref","first-page":"24","DOI":"10.4018\/IJAMC.2016070102","article-title":"Discrete fireworks algorithm for single machine scheduling problems","volume":"7","author":"El Majdouli","year":"2016","journal-title":"International Journal of Applied Metaheuristic Computing (IJAMC)"},{"key":"10.1016\/j.eswa.2026.132294_bib0012","series-title":"Evolutionary computation in combinatorial optimization","author":"Gottlieb","year":"2006"},{"key":"10.1016\/j.eswa.2026.132294_bib0013","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s00186-019-00664-y","article-title":"Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width","volume":"89","author":"Gurski","year":"2019","journal-title":"Mathematical Methods of Operations Research"},{"key":"10.1016\/j.eswa.2026.132294_bib0014","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110425","article-title":"Set algebra-based algebraic evolutionary algorithm for binary optimization problems","volume":"143","author":"He","year":"2023","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.eswa.2026.132294_bib0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2019.03.002","article-title":"Encoding transformation-based differential evolution algorithm for solving knapsack problem with single continuous variable","volume":"50","author":"He","year":"2019","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.1016\/j.eswa.2026.132294_bib0016","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2018.07.045","article-title":"Group theory-based optimization algorithm for solving knapsack problems","volume":"219","author":"He","year":"2021","journal-title":"Knowledge-Based Systems"},{"key":"10.1016\/j.eswa.2026.132294_bib0017","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1016\/j.asoc.2019.01.049","article-title":"Ring theory-based evolutionary algorithm and its application to d {0-1} KP","volume":"77","author":"He","year":"2019","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.eswa.2026.132294_bib0018","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2021.101022","article-title":"Novel binary differential evolution algorithm based on taper-shaped transfer functions for binary optimization problems","volume":"69","author":"He","year":"2022","journal-title":"Swarm and Evolutionary Computation"},{"issue":"8","key":"10.1016\/j.eswa.2026.132294_bib0019","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1080\/0305215X.2013.819096","article-title":"An iterative rounding search-based algorithm for the disjunctively constrained knapsack problem","volume":"46","author":"Hifi","year":"2014","journal-title":"Engineering Optimization"},{"key":"10.1016\/j.eswa.2026.132294_bib0020","series-title":"2011 international conference on communications, computing and control applications (CCCA)","first-page":"1","article-title":"A first level scatter search for disjunctively constrained knapsack problems","author":"Hifi","year":"2011"},{"issue":"1","key":"10.1016\/j.eswa.2026.132294_bib0021","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01585164","article-title":"Min-cut clustering","volume":"62","author":"Johnson","year":"1993","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.eswa.2026.132294_bib0022","series-title":"Proceedings of the 7th annual conference on genetic and evolutionary computation","first-page":"607","article-title":"Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem","author":"Julstrom","year":"2005"},{"key":"10.1016\/j.eswa.2026.132294_bib0023","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113310","article-title":"Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem","volume":"149","author":"Lai","year":"2020","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"10.1016\/j.eswa.2026.132294_bib0024","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1287\/opre.18.3.454","article-title":"Quadratic binary programming with application to capital-budgeting problems","volume":"18","author":"Laughhunn","year":"1970","journal-title":"Operations Research"},{"key":"10.1016\/j.eswa.2026.132294_bib0025","doi-asserted-by":"crossref","first-page":"3350","DOI":"10.1007\/s10489-020-01722-3","article-title":"A novel discrete whale optimization algorithm for solving knapsack problems","volume":"50","author":"Li","year":"2020","journal-title":"Applied Intelligence"},{"key":"10.1016\/j.eswa.2026.132294_bib0026","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","article-title":"The irace package: Iterated racing for automatic algorithm configuration","volume":"3","author":"L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","journal-title":"Operations Research Perspectives"},{"key":"10.1016\/j.eswa.2026.132294_bib0027","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2019.105645","article-title":"A binary grey wolf optimizer for the multidimensional knapsack problem","volume":"83","author":"Luo","year":"2019","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.eswa.2026.132294_bib0028","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","article-title":"S-shaped versus v-shaped transfer functions for binary particle swarm optimization","volume":"9","author":"Mirjalili","year":"2013","journal-title":"Swarm and Evolutionary Computation"},{"issue":"3","key":"10.1016\/j.eswa.2026.132294_bib0029","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/0377-2217(95)00299-5","article-title":"An extended formulation approach to the edge-weighted maximal clique problem","volume":"95","author":"Park","year":"1996","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.eswa.2026.132294_bib0030","doi-asserted-by":"crossref","first-page":"1300","DOI":"10.1007\/s10878-016-0035-7","article-title":"Approximation of knapsack problems with conflict and forcing graphs","volume":"33","author":"Pferschy","year":"2017","journal-title":"Journal of Combinatorial Optimization"},{"issue":"9","key":"10.1016\/j.eswa.2026.132294_bib0031","doi-asserted-by":"crossref","first-page":"1541","DOI":"10.1080\/0305215X.2016.1257854","article-title":"Cooperative parallel adaptive neighbourhood search for the disjunctively constrained knapsack problem","volume":"49","author":"Quan","year":"2017","journal-title":"Engineering Optimization"},{"issue":"3","key":"10.1016\/j.eswa.2026.132294_bib0032","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1287\/mnsc.17.3.200","article-title":"A selection problem of shared fixed costs and network flows","volume":"17","author":"Rhys","year":"1970","journal-title":"Management Science"},{"issue":"2","key":"10.1016\/j.eswa.2026.132294_bib0033","doi-asserted-by":"crossref","first-page":"236","DOI":"10.3390\/su9020236","article-title":"A new optimization model for the sustainable development: Quadratic knapsack problem with conflict graphs","volume":"9","author":"Shi","year":"2017","journal-title":"Sustainability"},{"key":"10.1016\/j.eswa.2026.132294_bib0034","series-title":"2011\u202fIEEE 3rd international conference on communication software and networks","first-page":"591","article-title":"Solving 0\u20131 knapsack problem using genetic algorithms","author":"Singh","year":"2011"},{"key":"10.1016\/j.eswa.2026.132294_bib0035","series-title":"The vehicle routing problem","author":"Toth","year":"2002"},{"issue":"4","key":"10.1016\/j.eswa.2026.132294_bib0036","doi-asserted-by":"crossref","first-page":"1718","DOI":"10.1109\/TSMCB.2004.828283","article-title":"An evolutionary algorithm for large traveling salesman problems","volume":"34","author":"Tsai","year":"2004","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)"},{"key":"10.1016\/j.eswa.2026.132294_bib0037","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105447","article-title":"A threshold search based memetic algorithm for the disjunctively constrained knapsack problem","volume":"136","author":"Wei","year":"2021","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.eswa.2026.132294_bib0038","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1016\/j.ejor.2023.02.009","article-title":"Responsive strategic oscillation for solving the disjunctively constrained knapsack problem","volume":"309","author":"Wei","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"10.1016\/j.eswa.2026.132294_bib0039","article-title":"Heuristic and exact algorithms for the disjunctively constrained knapsack problem","volume":"43","author":"Yamada","year":"2002","journal-title":"Information Processing Society of Japan Journal"},{"key":"10.1016\/j.eswa.2026.132294_bib0040","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.artint.2012.01.001","article-title":"On the approximation ability of evolutionary optimization with application to minimum set cover","volume":"180","author":"Yu","year":"2012","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.eswa.2026.132294_bib0041","series-title":"2009 third international conference on genetic and evolutionary computing","first-page":"105","article-title":"Genetic algorithm based on greedy strategy in the 0\u20131 knapsack problem","author":"Zhao","year":"2009"},{"key":"10.1016\/j.eswa.2026.132294_bib0042","article-title":"A population-based simulated annealing approach with adaptive mutation operator for solving the discounted {0-1} knapsack problem","author":"Zhao","year":"2025","journal-title":"Applied Soft Computing"},{"issue":"5","key":"10.1016\/j.eswa.2026.132294_bib0043","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1080\/01605682.2023.2228339","article-title":"An effective hybrid search method for the quadratic knapsack problem with conflict graphs","volume":"75","author":"Zhou","year":"2024","journal-title":"Journal of the Operational Research Society"}],"container-title":["Expert Systems with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417426012078?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417426012078?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T03:15:20Z","timestamp":1776741320000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417426012078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":43,"alternative-id":["S0957417426012078"],"URL":"https:\/\/doi.org\/10.1016\/j.eswa.2026.132294","relation":{},"ISSN":["0957-4174"],"issn-type":[{"value":"0957-4174","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A set algebra-based heuristic algorithm with two-stage stochastic repair strategy for the quadratic knapsack problem with conflict graphs","name":"articletitle","label":"Article Title"},{"value":"Expert Systems with Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.eswa.2026.132294","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"132294"}}