{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T03:27:18Z","timestamp":1771039638560,"version":"3.50.1"},"reference-count":50,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100020884","name":"National Agency for Research and Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100019783","name":"Agen\u021bia Na\u021bional\u0103 pentru Cercetare \u0219i Dezvoltare","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100019783","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002850","name":"Fondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["11241132"],"award-info":[{"award-number":["11241132"]}],"id":[{"id":"10.13039\/501100002850","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":[[2025,11]]},"DOI":"10.1016\/j.knosys.2025.114439","type":"journal-article","created":{"date-parts":[[2025,9,14]],"date-time":"2025-09-14T14:23:30Z","timestamp":1757859810000},"page":"114439","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"PA","title":["A neural network-based iterative heuristic algorithm for the polynomial robust knapsack problem"],"prefix":"10.1016","volume":"330","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-3829-8258","authenticated-orcid":false,"given":"Jos\u00e9","family":"Gonz\u00e1lez-Cort\u00e9s","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9549-4143","authenticated-orcid":false,"given":"Carlos","family":"Contreras-Bolton","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.knosys.2025.114439_bib0001","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"issue":"6","key":"10.1016\/j.knosys.2025.114439_bib0002","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/0305-0483(87)90006-5","article-title":"Application of the knapsack model for budgeting","volume":"15","author":"Eilon","year":"1987","journal-title":"Omega"},{"key":"10.1016\/j.knosys.2025.114439_bib0003","doi-asserted-by":"crossref","first-page":"2625","DOI":"10.1016\/j.cor.2013.05.005","article-title":"Exact solution of the robust knapsack problem","volume":"40","author":"Monaci","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.knosys.2025.114439_bib0004","series-title":"Combinatorial Optimization","first-page":"132","article-title":"Quadratic knapsack problems","author":"Gallo","year":"1980"},{"issue":"1","key":"10.1016\/j.knosys.2025.114439_bib0005","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/s10878-021-00840-z","article-title":"Strengthening a linear reformulation of the 0\u20131 cubic knapsack problem via variable reordering","volume":"44","author":"Forrester","year":"2022","journal-title":"J. Comb. Optim."},{"issue":"3","key":"10.1016\/j.knosys.2025.114439_bib0006","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1016\/j.ejor.2022.06.029","article-title":"The polynomial robust knapsack problem","volume":"305","author":"Baldo","year":"2023","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.knosys.2025.114439_bib0007","series-title":"Technical Report","article-title":"Mathematical methods of site selection for electronic message systems (EMS)","author":"Witzgall","year":"1975"},{"issue":"1","key":"10.1016\/j.knosys.2025.114439_bib0008","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01585164","article-title":"Min-cut clustering","volume":"62","author":"Johnson","year":"1993","journal-title":"Math. Program."},{"issue":"3","key":"10.1016\/j.knosys.2025.114439_bib0009","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":"Manage. Sci."},{"key":"10.1016\/j.knosys.2025.114439_bib0010","first-page":"30","article-title":"A fast parametric maximum flow algorithm and applications","volume":"18","author":"Gallo","year":"1989","journal-title":"Soci. Ind. Appl. Math. J. Comput."},{"issue":"6","key":"10.1016\/j.knosys.2025.114439_bib0011","doi-asserted-by":"crossref","first-page":"1446","DOI":"10.1109\/TCBB.2016.2595583","article-title":"Triangular alignment (TAME): a tensor-based approach for higher-order network alignment","volume":"14","author":"Mohammadi","year":"2017","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"10.1016\/j.knosys.2025.114439_bib0012","series-title":"Treatments of Chlamydia Trachomatis and Neisseria Gonorrhoeae","author":"Zhao","year":"2008"},{"issue":"5","key":"10.1016\/j.knosys.2025.114439_bib0013","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.dam.2006.08.007","article-title":"The quadratic knapsack problem-a survey","volume":"155","author":"Pisinger","year":"2007","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.knosys.2025.114439_bib0014","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1287\/ijoc.1050.0172","article-title":"Solution of large quadratic knapsack problems through aggressive reduction","volume":"19","author":"Pisinger","year":"2007","journal-title":"INFORMS J. Comput."},{"issue":"5","key":"10.1016\/j.knosys.2025.114439_bib0015","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1016\/j.cor.2012.11.023","article-title":"An effective GRASP and tabu search for the 0-1 quadratic knapsack problem","volume":"40","author":"Yang","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.knosys.2025.114439_bib0016","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.swevo.2015.09.005","article-title":"Parallel improved quantum inspired evolutionary algorithm to solve large size quadratic knapsack problems","volume":"26","author":"Patvardhan","year":"2016","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.knosys.2025.114439_bib0017","doi-asserted-by":"crossref","DOI":"10.1016\/j.disopt.2020.100579","article-title":"A cut-and-branch algorithm for the quadratic knapsack problem","volume":"44","author":"Djeumou Fomeni","year":"2022","journal-title":"Discrete Optim."},{"key":"10.1016\/j.knosys.2025.114439_bib0018","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10107-006-0709-5","article-title":"Strong formulations of robust mixed 0\u20131 programming","volume":"108","author":"Atamt\u00fcrk","year":"2006","journal-title":"Math. Program."},{"issue":"11","key":"10.1016\/j.knosys.2025.114439_bib0019","doi-asserted-by":"crossref","first-page":"2625","DOI":"10.1016\/j.cor.2013.05.005","article-title":"Exact solution of the robust knapsack problem","volume":"40","author":"Monaci","year":"2013","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"10.1016\/j.knosys.2025.114439_bib0020","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/120880355","article-title":"On the robust knapsack problem","volume":"23","author":"Monaci","year":"2013","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.knosys.2025.114439_bib0021","unstructured":"I. Bello, H. Pham, Q.V. Le, M. Norouzi, S. Bengio, Neural combinatorial optimization with reinforcement learning, in: 5th International Conference on Learning Representations, Toulon, France, 2017. arXiv: 1611.09940."},{"key":"10.1016\/j.knosys.2025.114439_bib0022","series-title":"2018 Tenth International Conference on Advanced Computational Intelligence (ICACI)","first-page":"473","article-title":"A pointer network based deep learning algorithm for 0-1 knapsack problem","author":"Gu","year":"2018"},{"key":"10.1016\/j.knosys.2025.114439_bib0023","series-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","first-page":"241","article-title":"An investigation into prediction + optimisation for the knapsack problem","author":"Demirovi\u0107","year":"2019"},{"key":"10.1016\/j.knosys.2025.114439_bib0024","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113613","article-title":"Anytime automatic algorithm selection for knapsack","volume":"158","author":"Huerta","year":"2020","journal-title":"Expert Syst. Appl."},{"issue":"5","key":"10.1016\/j.knosys.2025.114439_bib0025","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1287\/ijoc.2021.0225","article-title":"Provably good solutions to the knapsack problem via neural networks of bounded size","volume":"35","author":"Hertrich","year":"2023","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"10.1016\/j.knosys.2025.114439_bib0026","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ejor.2023.04.023","article-title":"Features for the 0\u20131 knapsack problem based on inclusionwise maximal solutions","volume":"311","author":"Jooken","year":"2023","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.knosys.2025.114439_bib0027","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106965","article-title":"Deep learning based high accuracy heuristic approach for knapsack interdiction problem","volume":"176","author":"Kwon","year":"2025","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.knosys.2025.114439_bib0028","doi-asserted-by":"crossref","first-page":"10638","DOI":"10.1109\/ACCESS.2025.3529317","article-title":"Machine learning-driven optimization for solution space reduction in the quadratic multiple knapsack problem","volume":"13","author":"Y\u00e1\u00f1ez-Oyarce","year":"2025","journal-title":"IEEE Access"},{"issue":"1","key":"10.1016\/j.knosys.2025.114439_bib0029","doi-asserted-by":"crossref","first-page":"919","DOI":"10.32604\/cmc.2025.062980","article-title":"Reinforcement learning for solving the knapsack problem","volume":"84","author":"Zhang","year":"2025","journal-title":"Comput. Mater. Continua"},{"key":"10.1016\/j.knosys.2025.114439_bib0030","series-title":"2017 IEEE International Conference on Power, Control, Signals and Instrumentation Engineering (ICPCSI)","first-page":"2601","article-title":"A novel approach in solving 0\/1 knapsack problem using neural selection principle","author":"Shyamala","year":"2017"},{"key":"10.1016\/j.knosys.2025.114439_bib0031","unstructured":"R. Refaei Afshar, Y. Zhang, M. Firat, U. Kaymak, A state aggregation approach for solving knapsack problem with deep reinforcement learning, in: S.J. Pan, M. Sugiyama (Eds.), Proceedings of The 12th Asian Conference on Machine Learning, 129, 2020, pp. 81\u201396. arXiv: 2004.12117."},{"key":"10.1016\/j.knosys.2025.114439_bib0032","doi-asserted-by":"crossref","first-page":"224200","DOI":"10.1109\/ACCESS.2020.3044005","article-title":"Neural knapsack: a neural network based solver for the knapsack problem","volume":"8","author":"Nomer","year":"2020","journal-title":"IEEE Access"},{"issue":"20","key":"10.1016\/j.knosys.2025.114439_bib0033","doi-asserted-by":"crossref","first-page":"2611","DOI":"10.3390\/math9202611","article-title":"A binary machine learning cuckoo search algorithm improved by a local search operator for the set-union knapsack problem","volume":"9","author":"Garc\u00eda","year":"2021","journal-title":"Mathematics"},{"key":"10.1016\/j.knosys.2025.114439_bib0034","doi-asserted-by":"crossref","first-page":"1951","DOI":"10.1007\/s13042-020-01085-8","article-title":"Enhancing a machine learning binarization framework by perturbation operators: analysis on the multidimensional knapsack problem","volume":"11","author":"Garc\u00eda","year":"2020","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"10.1016\/j.knosys.2025.114439_bib0035","series-title":"Proceedings of the 38th International Conference on Machine Learning","first-page":"6414","article-title":"A novel method to solve neural knapsack problems","volume":"139","author":"Li","year":"2021"},{"issue":"9","key":"10.1016\/j.knosys.2025.114439_bib0036","doi-asserted-by":"crossref","DOI":"10.1002\/cpe.6509","article-title":"Reinforcement learning using fully connected, attention, and transformer models in knapsack problem solving","volume":"34","author":"Yildiz","year":"2022","journal-title":"Concurrency Comput. Pract. Exper."},{"issue":"6","key":"10.1016\/j.knosys.2025.114439_bib0037","doi-asserted-by":"crossref","first-page":"3068","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":"2","key":"10.1016\/j.knosys.2025.114439_bib0038","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1007\/s11063-021-10662-z","article-title":"Application of supervised machine learning methods on the multidimensional knapsack problem","volume":"54","author":"Rezoug","year":"2022","journal-title":"Neural Process. Lett."},{"key":"10.1016\/j.knosys.2025.114439_bib0039","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2022.105688","article-title":"A reinforcement learning based computational intelligence approach for binary optimization problems: the case of the set-union knapsack problem","volume":"118","author":"Ozsoydan","year":"2023","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.knosys.2025.114439_bib0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.109984","article-title":"An incremental method-based machine learning approach for max-min knapsack with multiple scenarios","volume":"190","author":"Zhao","year":"2024","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.knosys.2025.114439_bib0041","doi-asserted-by":"crossref","DOI":"10.1016\/j.patrec.2025.03.011","article-title":"Machine-learning-based hyper-heuristics for solving the knapsack problem","author":"Z\u00e1rate-Aranda","year":"2025","journal-title":"Pattern Recognit. Lett."},{"key":"10.1016\/j.knosys.2025.114439_bib0042","series-title":"Pattern Recognition and Machine Learning","author":"Bishop","year":"2006"},{"issue":"2","key":"10.1016\/j.knosys.2025.114439_bib0043","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.ejor.2021.04.032","article-title":"Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art","volume":"296","author":"Karimi-Mamaghan","year":"2022","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.knosys.2025.114439_bib0044","unstructured":"D.P. Kingma, J. Ba, Adam: a method for stochastic optimization, in: Y. Bengio, Y. LeCun (Eds.), 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, May 7\u20139, 2015, Conference Track Proceedings, 2015. arXiv: 1412.6980."},{"issue":"2","key":"10.1016\/j.knosys.2025.114439_bib0045","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","article-title":"Machine learning for combinatorial optimization: a methodological tour d\u2019horizon","volume":"290","author":"Bengio","year":"2021","journal-title":"Eur. J. Oper. Res."},{"issue":"06","key":"10.1016\/j.knosys.2025.114439_bib0046","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1109\/TPAMI.2016.2577031","article-title":"Faster R-CNN: towards real-time object detection with region proposal networks","volume":"39","author":"Ren","year":"2017","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.knosys.2025.114439_bib0047","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100665","article-title":"Recent trends in the use of statistical tests for comparing swarm and evolutionary computing algorithms: practical guidelines and a critical review","volume":"54","author":"Carrasco","year":"2020","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"10.1016\/j.knosys.2025.114439_bib0048","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","article-title":"A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms","volume":"1","author":"Derrac","year":"2011","journal-title":"Swarm Evol. Comput."},{"issue":"6","key":"10.1016\/j.knosys.2025.114439_bib0049","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","article-title":"A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the CEC\u20192005 special session on real parameter optimization","volume":"15","author":"Garc\u00eda","year":"2009","journal-title":"J. Heuristic"},{"key":"10.1016\/j.knosys.2025.114439_bib0050","unstructured":"V. Mnih, A.P. Badia, M. Mirza, A. Graves, T. Lillicrap, T. Harley, D. Silver, K. Kavukcuoglu, Asynchronous methods for deep reinforcement learning, in: M.F. Balcan, K.Q. Weinberger (Eds.), Proceedings of The 33rd International Conference on Machine Learning, 48, PMLR, New York, New York, USA, 2016, pp. 1928\u20131937. arXiv: 1602.01783."}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705125014789?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705125014789?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,30]],"date-time":"2025-11-30T07:33:41Z","timestamp":1764488021000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705125014789"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":50,"alternative-id":["S0950705125014789"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2025.114439","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A neural network-based iterative heuristic algorithm for the polynomial robust knapsack problem","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2025.114439","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 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":"114439"}}