{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,12]],"date-time":"2026-10-12T21:46:53Z","timestamp":1791841613401,"version":"4.3.4"},"reference-count":42,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62406029"],"award-info":[{"award-number":["62406029"]}],"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":["62272050"],"award-info":[{"award-number":["62272050"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002726","name":"Beijing Normal University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002726","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.knosys.2026.115890","type":"journal-article","created":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T17:37:00Z","timestamp":1776015420000},"page":"115890","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["BLADE: Brainstorming LLMs as algorithm designer through evolution for online subset selection"],"prefix":"10.1016","volume":"343","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-5208-1991","authenticated-orcid":false,"given":"Zining","family":"Qin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2481-5648","authenticated-orcid":false,"given":"Chenhao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianxiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huiling","family":"Qin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ping","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weijia","family":"Jia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3731","key":"10.1016\/j.knosys.2026.115890_bib0001","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1126\/science.153.3731.34","article-title":"Dynamic programming","volume":"153","author":"Bellman","year":"1966","journal-title":"Science"},{"issue":"4","key":"10.1016\/j.knosys.2026.115890_bib0002","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","article-title":"Branch-and-bound methods: a survey","volume":"14","author":"Lawler","year":"1966","journal-title":"Oper. Res."},{"issue":"4","key":"10.1016\/j.knosys.2026.115890_bib0003","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","article-title":"Fast approximation algorithms for the knapsack and sum of subset problems","volume":"22","author":"Ibarra","year":"1975","journal-title":"J. ACM (JACM)"},{"key":"10.1016\/j.knosys.2026.115890_bib0004","series-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"Holland","year":"1992"},{"issue":"1","key":"10.1016\/j.knosys.2026.115890_bib0005","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","article-title":"Ant system: optimization by a colony of cooperating agents","volume":"26","author":"Dorigo","year":"1996","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"issue":"4598","key":"10.1016\/j.knosys.2026.115890_bib0006","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/j.knosys.2026.115890_bib0007","unstructured":"J. Achiam, S. Adler, S. Agarwal, L. Ahmad, I. Akkaya, F.L. Aleman, D. Almeida, J. Altenschmidt, S. Altman, S. Anadkat, et al., GPT-4 technical report, (2023), arXiv preprint arXiv: 2303.08774."},{"key":"10.1016\/j.knosys.2026.115890_bib0008","unstructured":"Anthropic, The claude 3 model family: Opus, Sonnet, Haiku, Online (2024)."},{"key":"10.1016\/j.knosys.2026.115890_bib0009","unstructured":"M. Reid, N. Savinov, D. Teplyashin, D. Lepikhin, T. Lillicrap, J.-b. Alayrac, R. Soricut, A. Lazaridou, O. Firat, J. Schrittwieser, et al., Gemini 1.5: unlocking multimodal understanding across millions of tokens of context, (2024), arXiv preprint arXiv: 2403.05530."},{"key":"10.1016\/j.knosys.2026.115890_bib0010","doi-asserted-by":"crossref","unstructured":"Y. Li, D.H. Choi, J. Chung, N. Kushman, J. Schrittwieser, R. Leblond, T. Eccles, J. Keeling, F. Gimeno, A.D. Lago, T. Hubert, P. Choy, C. de Masson d\u2019Autume, I. Babuschkin, X. Chen, P. Huang, J. Welbl, S. Gowal, A. Cherepanov, J. Molloy, D.J. Mankowitz, E.S. Robson, P. Kohli, N. de Freitas, K. Kavukcuoglu, O. Vinyals, Competition-level code generation with alphacode, arXiv abs\/2203.07814 (2022). 2203.07814. 10.48550\/ARXIV.2203.07814.","DOI":"10.1126\/science.abq1158"},{"issue":"7995","key":"10.1016\/j.knosys.2026.115890_bib0011","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1038\/s41586-023-06924-6","article-title":"Mathematical discoveries from program search with large language models","volume":"625","author":"Romera-Paredes","year":"2024","journal-title":"Nat."},{"key":"10.1016\/j.knosys.2026.115890_bib0012","unstructured":"A. Novikov, N. V\u0169, M. Eisenberger, E. Dupont, P.-S. Huang, A.Z. Wagner, S. Shirobokov, B. Kozlovskii, F.J.R. Ruiz, A. Mehrabian, et al., AlphaEvolve: a coding agent for scientific and algorithmic discovery, (2025), arXiv preprint arXiv: 2506.13131."},{"issue":"2","key":"10.1016\/j.knosys.2026.115890_bib0013","doi-asserted-by":"crossref","first-page":"42:1","DOI":"10.1145\/3703155","article-title":"A survey on hallucination in large language models: principles, taxonomy, challenges, and open questions","volume":"43","author":"Huang","year":"2025","journal-title":"ACM Trans. Inf. Syst."},{"issue":"2","key":"10.1016\/j.knosys.2026.115890_bib0014","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1287\/moor.1080.0363","article-title":"Online primal-dual algorithms for covering and packing","volume":"34","author":"Buchbinder","year":"2009","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.knosys.2026.115890_bib0015","series-title":"Knapsack Problems","author":"Kellerer","year":"2004"},{"issue":"2","key":"10.1016\/j.knosys.2026.115890_bib0016","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1006\/jagm.1998.0954","article-title":"Average-case analysis of off-line and on-line knapsack problems","volume":"29","author":"Lueker","year":"1998","journal-title":"J. Algorithms"},{"key":"10.1016\/j.knosys.2026.115890_bib0017","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF01585758","article-title":"Stochastic on-line knapsack problems","volume":"68","author":"Marchetti-Spaccamela","year":"1995","journal-title":"Math. Program."},{"key":"10.1016\/j.knosys.2026.115890_bib0018","series-title":"Advances in Neural Information Processing Systems 21, Proceedings of the Twenty-Second Annual Conference on Neural Information Processing Systems, Vancouver, British Columbia, Canada","first-page":"1577","article-title":"An online algorithm for maximizing submodular functions","author":"Streeter","year":"2008"},{"key":"10.1016\/j.knosys.2026.115890_bib0019","series-title":"Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira","first-page":"1204","article-title":"Online submodular maximization with free disposal: randomization beats \u00bc for partition matroids","author":"Chan","year":"2017"},{"issue":"4","key":"10.1016\/j.knosys.2026.115890_bib0020","doi-asserted-by":"crossref","first-page":"56:1","DOI":"10.1145\/3242770","article-title":"Online submodular maximization with free disposal","volume":"14","author":"Chan","year":"2018","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.knosys.2026.115890_bib0021","series-title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI 2024, Jeju, South Korea","first-page":"7065","article-title":"Online submodular maximization via adaptive thresholds","author":"Yang","year":"2024"},{"issue":"1","key":"10.1016\/j.knosys.2026.115890_bib0022","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1007\/s40747-023-01181-6","article-title":"A novel three-stage multi-population evolutionary algorithm for constrained multi-objective optimization problems","volume":"10","author":"Shi","year":"2024","journal-title":"Complex Intell. Syst."},{"key":"10.1016\/j.knosys.2026.115890_bib0023","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101657","article-title":"Two-stage differential evolution with dynamic population assignment for constrained multi-objective optimization","volume":"90","author":"Xu","year":"2024","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.knosys.2026.115890_bib0024","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2025.113792","article-title":"TPCMEA: a tri-population evolutionary algorithm with adaptive stage-switching for complex CMOPs","volume":"184","author":"Chen","year":"2025","journal-title":"Appl. Soft. Comput."},{"key":"10.1016\/j.knosys.2026.115890_bib0025","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2024.129296","article-title":"Adaptive population sizing for multi-population based constrained multi-objective optimization","volume":"621","author":"Tian","year":"2025","journal-title":"Neurocomputing"},{"key":"10.1016\/j.knosys.2026.115890_bib0026","series-title":"7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA","first-page":"1","article-title":"Attention, learn to solve routing problems!","author":"Kool","year":"2019"},{"key":"10.1016\/j.knosys.2026.115890_bib0027","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120568","article-title":"A deep reinforcement learning hyper-heuristic with feature fusion for online packing problems","volume":"230","author":"Tu","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.knosys.2026.115890_bib0028","series-title":"Proceedings of the 32nd International Conference on Neural Information Processing Systems","first-page":"9684","article-title":"Improving online algorithms via ML predictions","author":"Kumar","year":"2018"},{"key":"10.1016\/j.knosys.2026.115890_bib0029","series-title":"Proceedings of the 28th International Conference on Artificial Intelligence and Statistics","first-page":"1072","article-title":"Learning-augmented algorithms for online concave packing and convex covering problems","volume":"258","author":"Grigorescu","year":"2025"},{"key":"10.1016\/j.knosys.2026.115890_bib0030","unstructured":"R. Anil, A.M. Dai, O. Firat, M. Johnson, D. Lepikhin, A. Passos, S. Shakeri, E. Taropa, P. Bailey, Z. Chen, E. Chu, J.H. Clark, L.E. Shafey, Y. Huang, K. Meier-Hellstern, G. Mishra, E. Moreira, M. Omernick, K. Robinson, S. Ruder, Y. Tay, K. Xiao, Y. Xu, Y. Zhang, G.H. \u00c1brego, J. Ahn, J. Austin, P. Barham, J.A. Botha, J. Bradbury, S. Brahma, K. Brooks, M. Catasta, Y. Cheng, C. Cherry, C.A. Choquette-Choo, A. Chowdhery, C. Crepy, S. Dave, M. Dehghani, S. Dev, J. Devlin, M. D\u00edaz, N. Du, E. Dyer, V. Feinberg, F. Feng, V. Fienber, M. Freitag, X. Garcia, S. Gehrmann, L. Gonzalez, et al., PaLM 2 technical report, arXiv abs\/2305.10403 (2023). 2305.10403. 10.48550\/ARXIV.2305.10403."},{"issue":"2","key":"10.1016\/j.knosys.2026.115890_bib0031","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1109\/TEVC.2024.3506731","article-title":"Evolutionary computation in the era of large language model: survey and roadmap","volume":"29","author":"Wu","year":"2025","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.knosys.2026.115890_bib0032","series-title":"Distributed Genetic Algorithms for Function Optimization","author":"Tanese","year":"1989"},{"issue":"4","key":"10.1016\/j.knosys.2026.115890_bib0033","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/(SICI)1099-0526(199903\/04)4:4<31::AID-CPLX5>3.0.CO;2-4","article-title":"A survey of parallel distributed genetic algorithms","volume":"4","author":"Alba","year":"1999","journal-title":"Complex."},{"key":"10.1016\/j.knosys.2026.115890_bib0034","unstructured":"J.E. Beasley, OR-library: 0\u20131 Knapsack Problem, 1990, (http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/knapsack.html). Accessed on 2025-03-06. Maintained by J.E. Beasley. Specific files for 0\u20131 knapsack, e.g., knaP01, were used."},{"key":"10.1016\/j.knosys.2026.115890_bib0035","unstructured":"J. Burkardt, KNAPSACK_01 - The 0\/1 knapsack problem data, 2018, (https:\/\/people.sc.fsu.edu\/~jburkardt\/datasets\/knapsack_01\/knapsack_01.html). Accessed on 2025-03-06."},{"key":"10.1016\/j.knosys.2026.115890_bib0036","series-title":"Abstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2023, Orlando, FL, USA","first-page":"59","article-title":"The online knapsack problem with departures","author":"Sun","year":"2023"},{"issue":"6","key":"10.1016\/j.knosys.2026.115890_bib0037","doi-asserted-by":"crossref","DOI":"10.3390\/app12063068","article-title":"A deep reinforcement learning-based scheme for solving multiple knapsack problems","volume":"12","author":"Sur","year":"2022","journal-title":"Appl. Sci."},{"issue":"6","key":"10.1016\/j.knosys.2026.115890_bib0038","doi-asserted-by":"crossref","first-page":"40:1","DOI":"10.1145\/3557045","article-title":"Adversarial bandits with knapsacks","volume":"69","author":"Immorlica","year":"2022","journal-title":"J. ACM"},{"key":"10.1016\/j.knosys.2026.115890_bib0039","series-title":"Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), December 15\u201319, 2008, Pisa, Italy","first-page":"413","article-title":"Isolation forest","author":"Liu","year":"2008"},{"key":"10.1016\/j.knosys.2026.115890_bib0040","series-title":"IEEE Symposium Series on Computational Intelligence, SSCI 2015, Cape Town, South Africa","first-page":"159","article-title":"Calibrating probability with undersampling for unbalanced classification","author":"Pozzolo","year":"2015"},{"key":"10.1016\/j.knosys.2026.115890_bib0041","series-title":"Proceedings of the 36th International Conference on Machine Learning, ICML 2019, Long Beach, California, USA","first-page":"3311","article-title":"Submodular streaming in all its glory: tight approximation, minimum memory and low adaptive complexity","volume":"97","author":"Kazemi","year":"2019"},{"issue":"1\u20132","key":"10.1016\/j.knosys.2026.115890_bib0042","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-015-0900-7","article-title":"Submodular maximization meets streaming: matchings, matroids, and more","volume":"154","author":"Chakrabarti","year":"2015","journal-title":"Math. Program."}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126006167?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126006167?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,10,12]],"date-time":"2026-10-12T21:08:29Z","timestamp":1791839309000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705126006167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":42,"alternative-id":["S0950705126006167"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2026.115890","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"BLADE: Brainstorming LLMs as algorithm designer through evolution for online subset selection","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2026.115890","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115890"}}