Recent Advances in Knapsack Problem: A Comprehensive Review of Models, Algorithms, and Applications
Gespeichert in:
| Veröffentlicht in: | Neurocomputing (Amsterdam) S. 132135 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
01.11.2025
|
| ISSN: | 0925-2312 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| ArticleNumber | 132135 |
|---|---|
| Author | Chen, Xin-Ao Feng, Yanhong Hu, Tianyu Wang, Gai-Ge |
| Author_xml | – sequence: 1 givenname: Yanhong surname: Feng fullname: Feng, Yanhong – sequence: 2 givenname: Tianyu surname: Hu fullname: Hu, Tianyu – sequence: 3 givenname: Xin-Ao orcidid: 0009-0001-8472-6647 surname: Chen fullname: Chen, Xin-Ao – sequence: 4 givenname: Gai-Ge surname: Wang fullname: Wang, Gai-Ge |
| BookMark | eNot0EtOwzAYBGAvikRbuAELH4AEP1OHXVTxEkWgCtaRY_-mLokd2aWI29OqbGZmNYtvhiYhBkDoipKSElrdbMsA3yYOJSNMlpQzyuUETUnNZME4ZedolvOWELqgrJ4iswYDYYcbu9fBQMY-4Oegx6zNF35LsethuMUNXsZhTLCBkP0e8Br2Hn5wdPglWujzNW76z5j8bjMctg4WN-PYe6N3PoZ8gc6c7jNc_vccfdzfvS8fi9Xrw9OyWRWGEiILzZjSlHBaVcKoWjLlDuGstcoJabkVGrrOqM5WtVMclBVdp4yQi0pVTgs-R-L0a1LMOYFrx-QHnX5bStojTrttTzjtEac94fA_ee5evg |
| Cites_doi | 10.1016/j.ejor.2024.12.032 10.1109/TEVC.2022.3211954 10.1177/1687814015624832 10.3390/app12063068 10.1016/j.asoc.2018.06.024 10.1007/s10479-014-1720-5 10.1016/j.eswa.2019.06.007 10.1007/s11590-021-01760-x 10.1007/s11047-018-09725-3 10.1016/j.ejor.2016.09.004 10.1007/s40314-025-03279-8 10.1016/j.ejor.2020.07.023 10.1007/s12293-021-00344-7 10.23919/CSMS.2021.0027 10.1016/j.asoc.2022.109682 10.1007/s00500-022-07285-4 10.1109/JAS.2021.1004129 10.3390/sym17091538 10.1109/TEVC.2008.925798 10.1016/j.cor.2012.11.023 10.1016/j.jcde.2019.02.002 10.1016/j.cor.2016.08.006 10.1016/j.ejor.2021.04.001 10.1007/s10100-018-0551-x 10.15388/Informatica.2016.93 10.1007/s10878-020-00584-2 10.1007/s00366-021-01293-y 10.1155/2021/2864607 10.1016/S0377-2217(99)00260-X 10.1007/s10489-021-02717-4 10.1007/s00521-023-08367-6 10.1016/j.amc.2015.08.018 10.1016/j.eswa.2023.120568 10.1007/s11590-017-1227-5 10.1007/s10732-017-9356-7 10.1016/j.engappai.2022.105688 10.1016/j.asoc.2021.107260 10.1007/s10878-021-00840-z 10.1007/s00291-024-00746-2 10.1016/j.ejor.2018.10.001 10.1016/j.asoc.2020.107077 10.1007/s00521-017-2903-1 10.1016/j.cor.2017.08.008 10.1016/j.asoc.2015.10.043 10.1016/j.advengsoft.2022.103282 10.1016/j.knosys.2012.10.017 10.1016/j.asoc.2014.10.030 10.1016/j.asoc.2022.109821 10.1016/j.cie.2023.109080 10.1016/j.ins.2018.10.005 10.1016/j.ejor.2023.07.020 10.1007/BF01609014 10.1016/j.omega.2022.102692 10.1287/ijoc.12.1.75.11898 10.1007/s00500-019-04021-3 10.1016/j.neucom.2023.126630 10.1016/j.cor.2016.11.015 10.1016/j.swevo.2019.03.002 10.1016/j.engappai.2023.105977 10.1016/j.ejor.2020.10.047 10.1109/TEVC.2024.3367181 10.1109/TEVC.2014.2315442 10.1287/opre.5.2.266 10.1109/TEVC.2016.2521175 10.1142/S0218001417590066 10.1016/j.future.2021.07.033 10.1007/s00500-023-09306-2 10.1007/s12293-017-0241-6 10.1016/j.ejor.2014.02.014 10.1016/j.cor.2015.05.005 10.1016/j.procs.2015.08.165 10.1016/j.ejor.2021.05.007 10.1016/j.cor.2017.09.019 10.23919/CSMS.2024.0003 10.1515/jisys-2018-0450 10.1016/j.asoc.2023.110583 10.3390/math9202611 10.1109/TEVC.2016.2546340 10.1111/itor.13318 10.1016/j.dam.2025.08.011 10.1016/j.cor.2021.105210 10.1016/j.ejor.2016.11.042 10.1016/j.aej.2022.12.025 10.3390/math13071097 10.1016/j.eswa.2020.113802 10.1504/IJBIC.2018.090080 10.1109/TEVC.2023.3255246 10.1016/j.future.2018.06.008 10.1093/jcde/qwac039 10.1016/j.cor.2017.02.004 10.1016/j.orl.2005.06.001 10.1504/IJBIC.2017.087924 10.1162/EVCO_r_00180 10.1016/j.compeleceng.2021.107399 10.1504/IJAISC.2017.084579 10.1109/ACCESS.2018.2809445 10.1007/s11263-022-01684-8 10.3390/math11081811 10.1109/TCYB.2019.2944141 10.1016/j.engappai.2022.105082 10.1007/s10107-021-01755-7 10.1016/j.eswa.2020.113310 10.1016/j.ejor.2023.04.023 10.1007/s10489-020-01652-0 10.1016/j.eswa.2013.11.040 10.1007/s11590-019-01503-z 10.1007/s10878-012-9579-3 10.1007/s00521-015-2135-1 10.1109/TIP.2021.3064230 10.1504/IJBIC.2020.106428 10.1016/j.ins.2014.02.123 10.1007/s13042-020-01085-8 10.1007/s12351-018-0392-3 10.1016/j.ejor.2018.10.043 10.1016/j.disopt.2023.100771 10.1007/s101070050044 10.1016/j.dam.2022.06.033 10.1515/geo-2019-0031 10.1016/j.future.2017.05.044 10.1016/j.ejor.2016.12.009 10.32604/cmc.2025.062980 10.1016/j.asoc.2021.107180 10.1080/18756891.2016.1256577 10.1007/s11047-014-9470-5 10.1007/s40747-024-01355-w 10.3390/math7010017 10.1016/j.eswa.2019.113077 10.1016/j.swevo.2025.102001 10.1016/j.future.2018.08.002 10.1007/s12652-022-03766-4 10.1504/IJAAC.2022.122620 10.1109/TEVC.2021.3080683 10.1111/itor.13213 10.1108/DTA-05-2020-0120 10.1016/j.amc.2013.12.022 10.1007/s11590-020-01611-1 10.1142/S021821301550030X 10.1007/s10479-019-03290-3 10.1109/TEVC.2009.2030331 10.1007/s13042-020-01165-9 10.1016/j.cor.2024.106965 10.1016/j.knosys.2020.106510 10.1162/evco_a_00318 10.3390/math12213431 10.3390/math11122695 10.1007/s10462-020-09882-x 10.1007/s11063-023-11171-x 10.1080/0305215X.2015.1062094 10.1016/S0377-2217(03)00274-1 10.1016/j.ejor.2016.02.009 10.1016/j.cie.2019.01.010 10.1287/opre.27.2.341 10.1016/j.knosys.2015.10.004 10.1016/j.apm.2019.03.039 10.1016/j.ejor.2022.04.036 10.1111/itor.12381 10.1016/j.ejor.2024.12.019 10.1007/s00521-015-1923-y 10.1109/JAS.2021.1003817 10.1007/s10462-016-9471-0 10.1007/s00500-021-06091-8 10.12720/jait.13.3.259-264 10.1016/j.ins.2016.07.037 10.1016/j.swevo.2015.09.005 10.1109/SCIS-ISIS.2014.7044821 10.1016/j.endm.2010.05.079 10.1016/j.knosys.2018.01.012 10.1016/j.cor.2017.02.009 10.1016/j.ejor.2019.02.011 10.1016/j.ejor.2021.10.033 10.1007/s40747-018-0071-2 10.1371/journal.pone.0266537 10.1016/j.asoc.2019.105645 10.23919/CSMS.2022.0002 10.1016/j.dam.2017.11.023 10.1016/j.cor.2015.08.002 10.1007/s12293-016-0211-4 10.1016/j.sasc.2022.200041 10.1016/j.jcde.2019.04.004 10.1109/TII.2022.3165636 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.neucom.2025.132135 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| ExternalDocumentID | 10_1016_j_neucom_2025_132135 |
| GroupedDBID | --- --K --M .DC .~1 0R~ 123 1B1 1~. 1~5 29N 4.4 457 4G. 53G 5VS 7-5 71M 8P~ 9DU 9JM 9JN AABNK AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AATTM AAXKI AAXLA AAXUO AAYFN AAYWO AAYXX ABBOA ABCQJ ABFNM ABJNI ABMAC ABWVN ABXDB ACDAQ ACGFS ACLOT ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADJOM ADMUD ADNMO AEBSH AEIPS AEKER AENEX AEUPX AFJKZ AFPUW AFTJW AFXIZ AGHFR AGQPQ AGUBO AGWIK AGYEJ AHHHB AHZHX AIALX AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APXCP ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CITATION CS3 DU5 EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HLZ HVGLF HZ~ IHE J1W KOM LG9 M41 MO0 MOBAO N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- ROL RPZ SBC SDF SDG SDP SES SEW SPC SPCBC SSN SSV SSZ T5K WUQ XPP ZMT ~G- ~HD |
| ID | FETCH-LOGICAL-c1005-a228a1031664c89528f952fddd8f45d3d4aebbc8bd69f83e8d4bb8c457686fa43 |
| ISSN | 0925-2312 |
| IngestDate | Thu Nov 27 01:04:44 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c1005-a228a1031664c89528f952fddd8f45d3d4aebbc8bd69f83e8d4bb8c457686fa43 |
| ORCID | 0009-0001-8472-6647 |
| ParticipantIDs | crossref_primary_10_1016_j_neucom_2025_132135 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-11-00 |
| PublicationDateYYYYMMDD | 2025-11-01 |
| PublicationDate_xml | – month: 11 year: 2025 text: 2025-11-00 |
| PublicationDecade | 2020 |
| PublicationTitle | Neurocomputing (Amsterdam) |
| PublicationYear | 2025 |
| References | Li (10.1016/j.neucom.2025.132135_bib121) 2021; 12 Zhao (10.1016/j.neucom.2025.132135_bib198) 2024; 12 Ju (10.1016/j.neucom.2025.132135_bib191) 2021; 30 Abdel-Basset (10.1016/j.neucom.2025.132135_bib136) 2023; 67 Brown (10.1016/j.neucom.2025.132135_bib117) 1979; 27 Gao (10.1016/j.neucom.2025.132135_bib149) 2017; 260 Wilbaut (10.1016/j.neucom.2025.132135_bib90) 2022; 131 Zhao (10.1016/j.neucom.2025.132135_bib80) 2014; 28 Chajakis (10.1016/j.neucom.2025.132135_bib111) 1994; 32 Bingjie (10.1016/j.neucom.2025.132135_bib189) 2022; 2 Chen (10.1016/j.neucom.2025.132135_bib18) 2015; 226 Ceselli (10.1016/j.neucom.2025.132135_bib77) 2006; 34 Wang (10.1016/j.neucom.2025.132135_bib6) 2023; 121 Zheng (10.1016/j.neucom.2025.132135_bib41) 2022; 9 Skackauskas (10.1016/j.neucom.2025.132135_bib151) 2022; 4 Chen (10.1016/j.neucom.2025.132135_bib160) 2016; 92 Posner (10.1016/j.neucom.2025.132135_bib106) 1978; 15 Wei (10.1016/j.neucom.2025.132135_bib99) 2021; 105 Adouani (10.1016/j.neucom.2025.132135_bib162) 2022; 16 Dell'Amico (10.1016/j.neucom.2025.132135_bib127) 2019; 274 Kellerer (10.1016/j.neucom.2025.132135_bib32) 2004 Cheng (10.1016/j.neucom.2025.132135_bib43) 2018; 4 Zhang (10.1016/j.neucom.2025.132135_bib190) 2025; 84 Wilbaut (10.1016/j.neucom.2025.132135_bib91) 2023; 304 Tu (10.1016/j.neucom.2025.132135_bib193) 2023; 230 Dai (10.1016/j.neucom.2025.132135_bib8) 2025; 95 Kwon (10.1016/j.neucom.2025.132135_bib194) 2025; 176 Harifi (10.1016/j.neucom.2025.132135_bib51) 2022; 26 Sahinkoc (10.1016/j.neucom.2025.132135_bib187) 2022; 300 Forrester (10.1016/j.neucom.2025.132135_bib158) 2022; 44 Rapine (10.1016/j.neucom.2025.132135_bib152) 2022; 112 Galli (10.1016/j.neucom.2025.132135_bib159) 2021; 291 Mansour (10.1016/j.neucom.2025.132135_bib182) 2015; 60 Pferschy (10.1016/j.neucom.2025.132135_bib122) 2021; 15 Dahmani (10.1016/j.neucom.2025.132135_bib97) 2022; 13 Pisinger (10.1016/j.neucom.2025.132135_bib108) 2000; 12 Zhou (10.1016/j.neucom.2025.132135_bib72) 2023; 554 Ozsoydan (10.1016/j.neucom.2025.132135_bib102) 2019; 93 Wu (10.1016/j.neucom.2025.132135_bib88) 2020; 50 Chen (10.1016/j.neucom.2025.132135_bib44) 2009; 14 Abdel-Basset (10.1016/j.neucom.2025.132135_bib68) 2020; 151 Martins (10.1016/j.neucom.2025.132135_bib183) 2018; 24 Della Croce (10.1016/j.neucom.2025.132135_bib114) 2017; 80 Song (10.1016/j.neucom.2025.132135_bib166) 2018; 145 Yang (10.1016/j.neucom.2025.132135_bib156) 2013; 40 Ben Mansour (10.1016/j.neucom.2025.132135_bib180) 2018; 70 Ervural (10.1016/j.neucom.2025.132135_bib70) 2023; 178 Wang (10.1016/j.neucom.2025.132135_bib92) 2021; 25 Feng (10.1016/j.neucom.2025.132135_bib138) 2021; 126 Zhou (10.1016/j.neucom.2025.132135_bib164) 2021; 296 Zhou (10.1016/j.neucom.2025.132135_bib154) 2019; 73 Shamsaldin (10.1016/j.neucom.2025.132135_bib53) 2019; 6 Banaie-Dezfouli (10.1016/j.neucom.2025.132135_bib137) 2023; 146 García (10.1016/j.neucom.2025.132135_bib47) 2021; 102 Tönissen (10.1016/j.neucom.2025.132135_bib132) 2017; 83 He (10.1016/j.neucom.2025.132135_bib87) 2016; 369 Feng (10.1016/j.neucom.2025.132135_bib167) 2023; 11 Lamanna (10.1016/j.neucom.2025.132135_bib144) 2021; 297 Feng (10.1016/j.neucom.2025.132135_bib67) 2018; 10 Li (10.1016/j.neucom.2025.132135_bib140) 2020; 54 Yuan (10.1016/j.neucom.2025.132135_bib62) 2021; 13 Wang (10.1016/j.neucom.2025.132135_bib169) 2022; 18 Chen (10.1016/j.neucom.2025.132135_bib5) 2024; 4 Feng (10.1016/j.neucom.2025.132135_bib61) 2018; 30 Dang (10.1016/j.neucom.2025.132135_bib85) 2022; 17 Freville (10.1016/j.neucom.2025.132135_bib142) 2004; 155 Ishibuchi (10.1016/j.neucom.2025.132135_bib186) 2015; 19 Masmoudi (10.1016/j.neucom.2025.132135_bib130) 2024; 31 Sur (10.1016/j.neucom.2025.132135_bib126) 2022; 12 Chih (10.1016/j.neucom.2025.132135_bib133) 2015; 26 Shu (10.1016/j.neucom.2025.132135_bib50) 2022; 52 Dimitrov (10.1016/j.neucom.2025.132135_bib129) 2016; 258 Amiri (10.1016/j.neucom.2025.132135_bib115) 2020; 143 Corne (10.1016/j.neucom.2025.132135_bib175) 2000 Dantzig (10.1016/j.neucom.2025.132135_bib9) 1957; 5 Hua (10.1016/j.neucom.2025.132135_bib168) 2021; 8 Feng (10.1016/j.neucom.2025.132135_bib48) 2016; 9 Della Croce (10.1016/j.neucom.2025.132135_bib78) 2019; 253 Correia (10.1016/j.neucom.2025.132135_bib176) 2018; 89 Galli (10.1016/j.neucom.2025.132135_bib60) 2023; 335 Li (10.1016/j.neucom.2025.132135_bib74) 2026; 298 Wang (10.1016/j.neucom.2025.132135_bib28) 2023; 14 Dahmani (10.1016/j.neucom.2025.132135_bib95) 2021; 25 Croce (10.1016/j.neucom.2025.132135_bib107) 2016; 260 Cheng (10.1016/j.neucom.2025.132135_bib57) 2021; 54 Feng (10.1016/j.neucom.2025.132135_bib101) 2019; 7 Li (10.1016/j.neucom.2025.132135_bib170) 2009; 13 Lai (10.1016/j.neucom.2025.132135_bib40) 2020; 149 Yi (10.1016/j.neucom.2025.132135_bib171) 2020; 509 Ozsoydan (10.1016/j.neucom.2025.132135_bib105) 2023; 118 He (10.1016/j.neucom.2025.132135_bib109) 2016; 27 Lai (10.1016/j.neucom.2025.132135_bib143) 2018; 274 Qin (10.1016/j.neucom.2025.132135_bib161) 2016; 66 Ghanbari (10.1016/j.neucom.2025.132135_bib20) 2013; 39 Hochbaum (10.1016/j.neucom.2025.132135_bib12) 2025; 323 Li (10.1016/j.neucom.2025.132135_bib25) 2022; 38 Salem (10.1016/j.neucom.2025.132135_bib35) 2023; 30 Babukarthik (10.1016/j.neucom.2025.132135_bib39) 2021; 96 Parashar (10.1016/j.neucom.2025.132135_bib55) 2017; 6 Cacchiani (10.1016/j.neucom.2025.132135_bib33) 2022; 143 Changdar (10.1016/j.neucom.2025.132135_bib45) 2020; 20 Avci (10.1016/j.neucom.2025.132135_bib163) 2017; 83 Liu (10.1016/j.neucom.2025.132135_bib7) 2025; 29 Sitarz (10.1016/j.neucom.2025.132135_bib14) 2014; 228 Chen (10.1016/j.neucom.2025.132135_bib165) 2016; 20 Mavrotas (10.1016/j.neucom.2025.132135_bib184) 2015; 270 Wang (10.1016/j.neucom.2025.132135_bib4) 2024; 10 Feng (10.1016/j.neucom.2025.132135_bib38) 2017; 28 Marchand (10.1016/j.neucom.2025.132135_bib79) 1999; 85 Boeckmann (10.1016/j.neucom.2025.132135_bib123) 2023; 48 Jooken (10.1016/j.neucom.2025.132135_bib73) 2023; 311 Voss (10.1016/j.neucom.2025.132135_bib148) 2016; 48 Qian (10.1016/j.neucom.2025.132135_bib46) 2019; 18 Nguyen (10.1016/j.neucom.2025.132135_bib22) 2021; 51 Tang (10.1016/j.neucom.2025.132135_bib54) 2021; 8 Zhu (10.1016/j.neucom.2025.132135_bib84) 2017; 10 Guldan (10.1016/j.neucom.2025.132135_bib83) 2007 Detti (10.1016/j.neucom.2025.132135_bib125) 2021; 129 Cheng (10.1016/j.neucom.2025.132135_bib58) 2016; 46 Resende (10.1016/j.neucom.2025.132135_bib24) 2023; 31 Zhou (10.1016/j.neucom.2025.132135_bib100) 2021; 55 Luo (10.1016/j.neucom.2025.132135_bib135) 2019; 83 Coniglio (10.1016/j.neucom.2025.132135_bib15) 2021; 289 Faenza (10.1016/j.neucom.2025.132135_bib16) 2023; 198 Aïder (10.1016/j.neucom.2025.132135_bib177) 2021; 191 Galli (10.1016/j.neucom.2025.132135_bib10) 2025; 326 Szkaliczki (10.1016/j.neucom.2025.132135_bib146) 2025; 13 Feng (10.1016/j.neucom.2025.132135_bib86) 2018; 6 Lahyani (10.1016/j.neucom.2025.132135_bib131) 2019; 129 Wang (10.1016/j.neucom.2025.132135_bib56) 2014; 274 Kang (10.1016/j.neucom.2025.132135_bib89) 2023; 35 Martello (10.1016/j.neucom.2025.132135_bib65) 2000; 123 Wang (10.1016/j.neucom.2025.132135_bib178) 2022; 114 Pferschy (10.1016/j.neucom.2025.132135_bib113) 2018; 25 Ju (10.1016/j.neucom.2025.132135_bib192) 2022; 130 Zhang (10.1016/j.neucom.2025.132135_bib1) 2024; 28 Abdel-Basset (10.1016/j.neucom.2025.132135_bib69) 2018; 11 Baykasoglu (10.1016/j.neucom.2025.132135_bib150) 2014; 41 Wang (10.1016/j.neucom.2025.132135_bib27) 2018; 10 He (10.1016/j.neucom.2025.132135_bib103) 2017; 78 D’Ambrosio (10.1016/j.neucom.2025.132135_bib124) 2018; 12 Zhao (10.1016/j.neucom.2025.132135_bib23) 2021; 216 Zhou (10.1016/j.neucom.2025.132135_bib64) 2015; 38 Wei (10.1016/j.neucom.2025.132135_bib63) 2021; 165 Gupta (10.1016/j.neucom.2025.132135_bib59) 2022; 130 Wang (10.1016/j.neucom.2025.132135_bib188) 2021; 1 Haddar (10.1016/j.neucom.2025.132135_bib118) 2014; 15 García (10.1016/j.neucom.2025.132135_bib98) 2021; 9 García (10.1016/j.neucom.2025.132135_bib139) 2020; 11 Cohen (10.1016/j.neucom.2025.132135_bib11) 2025 Martins (10.1016/j.neucom.2025.132135_bib134) 2020; 15 Bolaji (10.1016/j.neucom.2025.132135_bib141) 2021; 30 Martinez (10.1016/j.neucom.2025.132135_bib173) 2014; 2014 Chen (10.1016/j.neucom.2025.132135_bib3) 2025; 97 Cacchiani (10.1016/j.neucom.2025.132135_bib34) 2022; 143 Wang (10.1016/j.neucom.2025.132135_bib49) 2019; 31 Yi (10.1016/j.neucom.2025.132135_bib29) 2020; 15 Jian (10.1016/j.neucom.2025.132135_bib2) 2023; 27 Saha (10.1016/j.neucom.2025.132135_bib13) 2025; 44 Yi (10.1016/j.neucom.2025.132135_bib195) 2016; 8 Furini (10.1016/j.neucom.2025.132135_bib116) 2018; 90 Borgulya (10.1016/j.neucom.2025.132135_bib153) 2019; 27 Becker (10.1016/j.neucom.2025.132135_bib110) 2019; 277 Yi (10.1016/j.neucom.2025.132135_bib30) 2019; 11 Bozorgi (10.1016/j.neucom.2025.132135_bib52) 2019; 6 Böckenhauer (10.1016/j.neucom.2025.132135_bib36) 2026; 378 García (10.1016/j.neucom.2025.132135_bib104) 2023; 11 Chebil (10.1016/j.neucom.2025.132135_bib112) 2015; 64 Yuan (10.1016/j.neucom.2025.132135_bib181) 2017; 31 Tanigaki (10.1016/j.neucom.2025.132135_bib185) 2014 Lin (10.1016/j.neucom.2025.132135_bib96) 2019; 135 Morales (10.1016/j.neucom.2025.132135_bib76) 2020; 40 Su (10.1016/j.neucom.2025.132135_bib42) 2022; 16 Abdollahzadeh (10.1016/j.neucom.2025.132135_bib179) 2022; 174 Jovanovic (10.1016/j.neucom.2025.132135_bib145) 2024; 46 He (10.1016/j.neucom.2025.132135_bib82) 2021; 103 Wu (10.1016/j.neucom.2025.132135_bib94) 2019; 24 Dahmani (10.1016/j.neucom.2025.132135_bib17) 2021; 298 Yi (10.1016/j.neucom.2025.132135_bib172) 2018; 88 Yildizdan (10.1016/j.neucom.2025.132135_bib71) 2023; 55 Ishibuchi (10.1016/j.neucom.2025.132135_bib37) 2015; 19 Truong (10.1016/j.neucom.2025.132135_bib93) 2021; 2021 Zhao (10.1016/j.neucom.2025.132135_bib197) 2024; 28 Li (10.1016/j.neucom.2025.132135_bib19) 2022; 10 Wang (10.1016/j.neucom.2025.132135_bib196) 2025 He (10.1016/j.neucom.2025.132135_bib81) 2019; 50 Martello (10.1016/j.neucom.2025.132135_bib31) 1990 Kataoka (10.1016/j.neucom.2025.132135_bib128) 2014; 237 Chen (10.1016/j.neucom.2025.132135_bib155) 2017; 77 da Cunha (10.1016/j.neucom.2025.132135_bib66) 2010; 36 Bonyadi (10.1016/j.neucom.2025.132135_bib21) 2017; 25 Patvardhan (10.1016/j.neucom.202 |
| References_xml | – volume: 326 start-page: 1 year: 2025 ident: 10.1016/j.neucom.2025.132135_bib10 article-title: The quadratic knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2024.12.032 – volume: 27 start-page: 1413 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib2 article-title: A niching regression adaptive memetic algorithm for multimodal optimization of the euclidean traveling salesman problem publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2022.3211954 – volume: 8 year: 2016 ident: 10.1016/j.neucom.2025.132135_bib195 article-title: Improved probabilistic neural networks with self-adaptive strategies for transformer fault diagnosis problem publication-title: Advances in Mechanical Engineering doi: 10.1177/1687814015624832 – volume: 12 start-page: 3068 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib126 article-title: A deep reinforcement learning-based scheme for solving multiple knapsack problems publication-title: Applied Sciences-Basel doi: 10.3390/app12063068 – volume: 70 start-page: 814 year: 2018 ident: 10.1016/j.neucom.2025.132135_bib180 article-title: A multi-population algorithm for multi-objective knapsack problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2018.06.024 – volume: 226 start-page: 101 year: 2015 ident: 10.1016/j.neucom.2025.132135_bib18 article-title: Iterated responsive threshold search for the quadratic multiple knapsack problem publication-title: Annals of Operations Research doi: 10.1007/s10479-014-1720-5 – volume: 135 start-page: 201 year: 2019 ident: 10.1016/j.neucom.2025.132135_bib96 article-title: A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2019.06.007 – volume: 15 start-page: 2529 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib122 article-title: Approximating the product knapsack problem publication-title: Optimization Letters doi: 10.1007/s11590-021-01760-x – volume: 18 start-page: 913 year: 2019 ident: 10.1016/j.neucom.2025.132135_bib46 article-title: An enhanced genetic algorithm for constrained knapsack problems in dynamic environments publication-title: Natural Computing doi: 10.1007/s11047-018-09725-3 – volume: 258 start-page: 938 year: 2016 ident: 10.1016/j.neucom.2025.132135_bib129 article-title: Emergency relocation of items using single trips: Special cases of the multiple knapsack assignment problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.09.004 – volume: 44 start-page: 327 year: 2025 ident: 10.1016/j.neucom.2025.132135_bib13 article-title: An evolutionary algorithm for solving a unique discounted 0-1 knapsack problem in a random type-2 fuzzy environment publication-title: Computational & Applied Mathematics doi: 10.1007/s40314-025-03279-8 – volume: 289 start-page: 435 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib15 article-title: A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2020.07.023 – volume: 13 start-page: 447 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib62 article-title: Solving binary multi-objective knapsack problems with novel greedy strategy publication-title: Memetic Computing doi: 10.1007/s12293-021-00344-7 – volume: 1 start-page: 257 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib188 article-title: A review of reinforcement learning based intelligent optimization for manufacturing scheduling publication-title: Complex System Modeling and Simulation doi: 10.23919/CSMS.2021.0027 – volume: 130 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib59 article-title: Diversified sine-cosine algorithm based on differential evolution for multidimensional knapsack problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2022.109682 – volume: 26 start-page: 12761 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib51 article-title: A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem publication-title: Soft Computing doi: 10.1007/s00500-022-07285-4 – volume: 8 start-page: 1627 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib54 article-title: A review on representative swarm intelligence algorithms for solving optimization problems: applications and trends publication-title: IEEE/CAA Journal of Automatica Sinica doi: 10.1109/JAS.2021.1004129 – volume: 15 start-page: 1538 year: 2025 ident: 10.1016/j.neucom.2025.132135_bib75 article-title: A hybrid symmetry strategy improved binary planet optimization algorithm with theoretical interpretability for the 0-1 knapsack problem publication-title: Symmetry doi: 10.3390/sym17091538 – volume: 13 start-page: 284 year: 2009 ident: 10.1016/j.neucom.2025.132135_bib170 article-title: Multiobjective optimization problems with complicated pareto sets, MOEA/D and NSGA-II publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2008.925798 – volume: 40 start-page: 1176 year: 2013 ident: 10.1016/j.neucom.2025.132135_bib156 article-title: An effective GRASP and tabu search for the 0-1 quadratic knapsack problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2012.11.023 – volume: 6 start-page: 243 year: 2019 ident: 10.1016/j.neucom.2025.132135_bib52 article-title: IWOA: An improved whale optimization algorithm for optimization problems publication-title: Journal of Computational Design and Engineering doi: 10.1016/j.jcde.2019.02.002 – volume: 77 start-page: 226 year: 2017 ident: 10.1016/j.neucom.2025.132135_bib155 article-title: An iterated hyperplane exploration approach for the quadratic knapsack problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2016.08.006 – volume: 296 start-page: 788 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib164 article-title: A hybrid evolutionary search for the generalized quadratic multiple knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2021.04.001 – volume: 27 start-page: 329 year: 2019 ident: 10.1016/j.neucom.2025.132135_bib153 article-title: An EDA for the 2D knapsack problem with guillotine constraint publication-title: Central European Journal of Operations Research doi: 10.1007/s10100-018-0551-x – year: 1990 ident: 10.1016/j.neucom.2025.132135_bib31 – volume: 27 start-page: 433 year: 2016 ident: 10.1016/j.neucom.2025.132135_bib109 article-title: Dynamic-programming-based inequalities for the unbounded integer knapsack problem publication-title: Informatica doi: 10.15388/Informatica.2016.93 – volume: 40 start-page: 234 year: 2020 ident: 10.1016/j.neucom.2025.132135_bib76 article-title: Analysis of divide-and-conquer strategies for the 0-1 minimization knapsack problem publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-020-00584-2 – volume: 38 start-page: 1585 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib25 article-title: Elephant herding optimization using dynamic topology and biogeography-based optimization based on learning for numerical optimization publication-title: Engineering with Computers doi: 10.1007/s00366-021-01293-y – volume: 2021 start-page: 2864607 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib93 article-title: Different transfer functions for binary particle swarm optimization with a new encoding scheme for discounted {0-1} knapsack problem publication-title: Mathematical Problems in Engineering doi: 10.1155/2021/2864607 – volume: 123 start-page: 325 year: 2000 ident: 10.1016/j.neucom.2025.132135_bib65 article-title: New trends in exact algorithms for the 0-1 knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00260-X – volume: 52 start-page: 5751 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib50 article-title: A modified hybrid rice optimization algorithm for solving 0-1 knapsack problem publication-title: Applied Intelligence doi: 10.1007/s10489-021-02717-4 – volume: 35 start-page: 12691 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib89 article-title: TMHSCA: a novel hybrid two-stage mutation with a sine cosine algorithm for discounted {0-1} knapsack problems publication-title: Neural Computing & Applications doi: 10.1007/s00521-023-08367-6 – volume: 270 start-page: 25 year: 2015 ident: 10.1016/j.neucom.2025.132135_bib184 article-title: An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: A computational study and comparison with meta-heuristics publication-title: Applied Mathematics and Computation doi: 10.1016/j.amc.2015.08.018 – volume: 230 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib193 article-title: A deep reinforcement learning hyper-heuristic with feature fusion for online packing problems publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2023.120568 – start-page: 839 year: 2000 ident: 10.1016/j.neucom.2025.132135_bib175 article-title: The Pareto envelope-based selection algorithm for multiobjective optimization – volume: 12 start-page: 691 year: 2018 ident: 10.1016/j.neucom.2025.132135_bib120 article-title: On the product knapsack problem publication-title: Optimization Letters doi: 10.1007/s11590-017-1227-5 – volume: 24 start-page: 25 year: 2018 ident: 10.1016/j.neucom.2025.132135_bib183 article-title: Hybrid multi-objective Bayesian estimation of distribution algorithm: a comparative analysis for the multi-objective knapsack problem publication-title: Journal of Heuristics doi: 10.1007/s10732-017-9356-7 – volume: 118 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib105 article-title: A reinforcement learning based computational intelligence approach for binary optimization problems: The case of the set-union knapsack problem publication-title: Engineering Applications of Artificial Intelligence doi: 10.1016/j.engappai.2022.105688 – volume: 105 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib99 article-title: Multistart solution-based tabu search for the set-union knapsack problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2021.107260 – volume: 44 start-page: 498 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib158 article-title: Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-021-00840-z – volume: 46 start-page: 1329 year: 2024 ident: 10.1016/j.neucom.2025.132135_bib145 article-title: Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets publication-title: Or Spectrum doi: 10.1007/s00291-024-00746-2 – volume: 12 start-page: 691 year: 2018 ident: 10.1016/j.neucom.2025.132135_bib124 article-title: On the product knapsack problem publication-title: Optimization Letters doi: 10.1007/s11590-017-1227-5 – volume: 274 start-page: 35 year: 2018 ident: 10.1016/j.neucom.2025.132135_bib143 article-title: Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2018.10.001 – volume: 102 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib47 article-title: A KNN quantum cuckoo search algorithm applied to the multidimensional knapsack problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2020.107077 – volume: 30 start-page: 3019 year: 2018 ident: 10.1016/j.neucom.2025.132135_bib61 article-title: Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem publication-title: Neural Computing and Applications doi: 10.1007/s00521-017-2903-1 – volume: 32 start-page: 1061 year: 2020 ident: 10.1016/j.neucom.2025.132135_bib147 article-title: A Core-based exact algorithm for the multidimensional multiple choice knapsack problem publication-title: INFORMS Journal on Computing – volume: 89 start-page: 82 year: 2018 ident: 10.1016/j.neucom.2025.132135_bib176 article-title: Compressed data structures for bi-objective {0,1}-knapsack problems publication-title: Computers & Operations Research doi: 10.1016/j.cor.2017.08.008 – volume: 38 start-page: 817 year: 2015 ident: 10.1016/j.neucom.2025.132135_bib64 article-title: An improved monkey algorithm for a 0-1 knapsack problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2015.10.043 – volume: 174 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib179 article-title: Mountain gazelle optimizer: A new nature-inspired metaheuristic algorithm for global optimization problems publication-title: Advances in Engineering Software doi: 10.1016/j.advengsoft.2022.103282 – volume: 39 start-page: 194 year: 2013 ident: 10.1016/j.neucom.2025.132135_bib20 article-title: A Cooperative ant colony optimization-genetic algorithm approach for construction of energy demand forecasting knowledge-based expert systems publication-title: Knowledge-Based Systems doi: 10.1016/j.knosys.2012.10.017 – volume: 26 start-page: 378 year: 2015 ident: 10.1016/j.neucom.2025.132135_bib133 article-title: Self-adaptive check and repair operator-based particle swarm optimization for the multidimensional knapsack problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2014.10.030 – volume: 131 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib90 article-title: Variable neighborhood search for the discounted {0-1} knapsack problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2022.109821 – volume: 178 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib70 article-title: A binary reptile search algorithm based on transfer functions with a new stochastic repair method for 0-1 knapsack problems publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2023.109080 – volume: 509 start-page: 470 year: 2020 ident: 10.1016/j.neucom.2025.132135_bib171 article-title: Behavior of crossover operators in NSGA-III for large-scale optimization problems publication-title: Information Sciences doi: 10.1016/j.ins.2018.10.005 – volume: 312 start-page: 385 year: 2024 ident: 10.1016/j.neucom.2025.132135_bib199 article-title: The min-Knapsack problem with compactness constraints and applications in statistics publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2023.07.020 – volume: 15 start-page: 155 year: 1978 ident: 10.1016/j.neucom.2025.132135_bib106 article-title: Collapsing 0-1 knapsack problem publication-title: Mathematical Programming doi: 10.1007/BF01609014 – volume: 112 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib152 article-title: The two-dimensional knapsack problem with splittable items in stacks publication-title: Omega doi: 10.1016/j.omega.2022.102692 – year: 2004 ident: 10.1016/j.neucom.2025.132135_bib32 article-title: Multidimensional – volume: 12 start-page: 75 year: 2000 ident: 10.1016/j.neucom.2025.132135_bib108 article-title: A minimal algorithm for the bounded knapsack problem publication-title: Informs Journal on Computing doi: 10.1287/ijoc.12.1.75.11898 – volume: 24 start-page: 1883 year: 2019 ident: 10.1016/j.neucom.2025.132135_bib94 article-title: Solving the set-union knapsack problem by a novel hybrid Jaya algorithm publication-title: Soft Computing doi: 10.1007/s00500-019-04021-3 – volume: 554 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib72 article-title: Nature-inspired algorithms for 0-1 knapsack problem: A survey publication-title: Neurocomputing doi: 10.1016/j.neucom.2023.126630 – volume: 80 start-page: 61 year: 2017 ident: 10.1016/j.neucom.2025.132135_bib114 article-title: An exact approach for the 0-1 knapsack problem with setups publication-title: Computers & Operations Research doi: 10.1016/j.cor.2016.11.015 – volume: 50 year: 2019 ident: 10.1016/j.neucom.2025.132135_bib81 article-title: Encoding transformation-based differential evolution algorithm for solving knapsack problem with single continuous variable publication-title: Swarm Evolutionary Computation doi: 10.1016/j.swevo.2019.03.002 – volume: 121 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib6 article-title: Solving energy-efficient fuzzy hybrid flow-shop scheduling problem at a variable machine speed using an extended NSGA-II publication-title: Engineering Applications of Artificial Intelligence doi: 10.1016/j.engappai.2023.105977 – volume: 291 start-page: 871 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib159 article-title: Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2020.10.047 – volume: 29 start-page: 749 year: 2025 ident: 10.1016/j.neucom.2025.132135_bib7 article-title: Evolutionary trainer-based deep Q-Network for dynamic flexible job-shop scheduling publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2024.3367181 – volume: 19 start-page: 264 year: 2015 ident: 10.1016/j.neucom.2025.132135_bib37 article-title: Behavior of multiobjective evolutionary algorithms on many-objective knapsack problems publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2014.2315442 – volume: 5 start-page: 266 year: 1957 ident: 10.1016/j.neucom.2025.132135_bib9 article-title: Discrete-variable extremum problems publication-title: Operations Research doi: 10.1287/opre.5.2.266 – volume: 20 start-page: 821 year: 2016 ident: 10.1016/j.neucom.2025.132135_bib174 article-title: Decomposition-based algorithms using pareto adaptive scalarizing methods publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2016.2521175 – volume: 31 start-page: 1759006 year: 2017 ident: 10.1016/j.neucom.2025.132135_bib181 article-title: Population decomposition-based greedy approach algorithm for the multi-objective knapsack problems publication-title: International Journal of Pattern Recognition and Artificial Intelligence doi: 10.1142/S0218001417590066 – volume: 126 start-page: 48 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib138 article-title: A binary moth search algorithm based on self-learning for the multidimensional knapsack problems publication-title: Future Generation Computer Systems doi: 10.1016/j.future.2021.07.033 – volume: 28 start-page: 5493 year: 2024 ident: 10.1016/j.neucom.2025.132135_bib197 article-title: A systematic review of fuzzing publication-title: Soft Computing doi: 10.1007/s00500-023-09306-2 – volume: 2014 start-page: 429 year: 2014 ident: 10.1016/j.neucom.2025.132135_bib173 article-title: A multi-objective evolutionary algorithm based on decomposition for constrained multi-objective optimization – volume: 10 start-page: 177 year: 2018 ident: 10.1016/j.neucom.2025.132135_bib27 article-title: An improved optimization method based on krill herd and artificial bee colony with information exchange publication-title: MEMETIC COMPUTING doi: 10.1007/s12293-017-0241-6 – volume: 237 start-page: 440 year: 2014 ident: 10.1016/j.neucom.2025.132135_bib128 article-title: Upper and lower bounding procedures for the multiple knapsack assignment problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2014.02.014 – volume: 64 start-page: 40 year: 2015 ident: 10.1016/j.neucom.2025.132135_bib112 article-title: A dynamic programming algorithm for the knapsack problem with setup publication-title: Computers & Operations Research doi: 10.1016/j.cor.2015.05.005 – volume: 60 start-page: 448 year: 2015 ident: 10.1016/j.neucom.2025.132135_bib182 article-title: Indicator based ant colony optimization for multi-objective knapsack problem publication-title: Procedia Computer Science doi: 10.1016/j.procs.2015.08.165 – volume: 297 start-page: 53 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib144 article-title: A Two-phase kernel search variant for the multidimensional multiple-choice knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2021.05.007 – start-page: 124 year: 2025 ident: 10.1016/j.neucom.2025.132135_bib11 article-title: Improved approximation for two-dimensional vector multiple knapsack publication-title: Computational Geometry-Theory and Applications – volume: 90 start-page: 208 year: 2018 ident: 10.1016/j.neucom.2025.132135_bib116 article-title: Exact approaches for the knapsack problem with setups publication-title: Computers & Operations Research doi: 10.1016/j.cor.2017.09.019 – volume: 4 start-page: 82 year: 2024 ident: 10.1016/j.neucom.2025.132135_bib5 article-title: Two-stage adaptive memetic algorithm with surprisingly popular mechanism for energy-aware distributed hybrid flow shop scheduling problem with sequence-dependent setup time publication-title: Complex System Modeling and Simulation doi: 10.23919/CSMS.2024.0003 – volume: 30 start-page: 90 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib141 article-title: A modified binary pigeon-inspired algorithm for solving the multi-dimensional knapsack problem publication-title: Journal of Intelligent Systems doi: 10.1515/jisys-2018-0450 – volume: 146 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib137 article-title: BE-GWO: Binary extremum-based grey wolf optimizer for discrete optimization problems publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2023.110583 – volume: 9 start-page: 2611 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib98 article-title: A binary machine learning cuckoo search algorithm improved by a local search operator for the set-union knapsack problem publication-title: Mathematics doi: 10.3390/math9202611 – volume: 20 start-page: 908 year: 2016 ident: 10.1016/j.neucom.2025.132135_bib165 article-title: Memetic search for the generalized quadratic multiple knapsack problem publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2016.2546340 – volume: 30 start-page: 3329 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib35 article-title: Cutting and packing problems under uncertainty: literature review and classification framework publication-title: International Transactions in Operational Research doi: 10.1111/itor.13318 – volume: 378 start-page: 492 year: 2026 ident: 10.1016/j.neucom.2025.132135_bib36 article-title: A survey of online knapsack problems publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2025.08.011 – volume: 129 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib125 article-title: A new upper bound for the multiple knapsack problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2021.105210 – volume: 260 start-page: 1 year: 2017 ident: 10.1016/j.neucom.2025.132135_bib149 article-title: An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.11.042 – volume: 67 start-page: 609 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib136 article-title: Binary light spectrum optimizer for knapsack problems: An improved model publication-title: Alexandria Engineering Journal doi: 10.1016/j.aej.2022.12.025 – volume: 13 start-page: 1097 year: 2025 ident: 10.1016/j.neucom.2025.132135_bib146 article-title: Solution methods for the multiple-choice knapsack problem and their applications publication-title: Mathematics doi: 10.3390/math13071097 – volume: 165 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib63 article-title: Kernel based tabu search for the set-union knapsack problem publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2020.113802 – volume: 11 start-page: 46 year: 2018 ident: 10.1016/j.neucom.2025.132135_bib69 article-title: An elite opposition-flower pollination algorithm for a 0-1 knapsack problem publication-title: International Journal of Bio-Inspired Computation doi: 10.1504/IJBIC.2018.090080 – volume: 28 start-page: 147 year: 2024 ident: 10.1016/j.neucom.2025.132135_bib1 article-title: Survey on genetic programming and machine learning techniques for heuristic design in job shop scheduling publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2023.3255246 – volume: 88 start-page: 571 year: 2018 ident: 10.1016/j.neucom.2025.132135_bib172 article-title: An improved NSGA-III algorithm with adaptive mutation operator for big data optimization problems publication-title: FUTURE GENERATION COMPUTER SYSTEMS doi: 10.1016/j.future.2018.06.008 – volume: 9 start-page: 933 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib41 article-title: A transfer learning-based particle swarm optimization algorithm for travelling salesman problem publication-title: Journal of Computational Design and Engineering doi: 10.1093/jcde/qwac039 – volume: 83 start-page: 54 year: 2017 ident: 10.1016/j.neucom.2025.132135_bib163 article-title: A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2017.02.004 – volume: 34 start-page: 394 year: 2006 ident: 10.1016/j.neucom.2025.132135_bib77 article-title: An optimization algorithm for a penalized knapsack problem publication-title: Operations Research Letters doi: 10.1016/j.orl.2005.06.001 – start-page: 1 year: 2007 ident: 10.1016/j.neucom.2025.132135_bib83 article-title: Heuristic and exact algorithms for discounted knapsack problems – volume: 10 start-page: 219 year: 2017 ident: 10.1016/j.neucom.2025.132135_bib84 article-title: Discrete differential evolutions for the discounted {0-1} knapsack problem publication-title: International Journal of Bio-Inspired Computation doi: 10.1504/IJBIC.2017.087924 – volume: 25 start-page: 1 year: 2017 ident: 10.1016/j.neucom.2025.132135_bib21 article-title: Particle swarm optimization for single objective continuous space problems: a review publication-title: Evolutionary Computation doi: 10.1162/EVCO_r_00180 – volume: 96 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib39 article-title: A novel approach for multi-constraints knapsack problem using cluster particle swarm optimization publication-title: Computers & Electrical Engineering doi: 10.1016/j.compeleceng.2021.107399 – volume: 6 start-page: 108 year: 2017 ident: 10.1016/j.neucom.2025.132135_bib55 article-title: A novel bat algorithm fuzzy classifier approach for classification problems publication-title: International Journal of Artificial Intelligence and Soft Computing doi: 10.1504/IJAISC.2017.084579 – volume: 6 start-page: 10708 year: 2018 ident: 10.1016/j.neucom.2025.132135_bib86 article-title: Binary moth search algorithm for discounted {0-1} knapsack problem publication-title: IEEE Access doi: 10.1109/ACCESS.2018.2809445 – volume: 130 start-page: 3014 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib192 article-title: NormAttention-PSN: A high-frequency region enhanced photometric stereo network with normalized attention publication-title: International Journal of Computer Vision doi: 10.1007/s11263-022-01684-8 – volume: 54 start-page: 2284 year: 2020 ident: 10.1016/j.neucom.2025.132135_bib140 article-title: A memetic algorithm based on probability learning for solving the multidimensional knapsack problem publication-title: IEEE Transactions on Cybernetics – volume: 11 start-page: 1811 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib167 article-title: Hybrid learning moth search algorithm for solving multidimensional knapsack problems publication-title: Mathematics doi: 10.3390/math11081811 – volume: 51 start-page: 589 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib22 article-title: A new binary particle swarm optimization approach: momentum and dynamic balance between exploration and exploitation publication-title: IEEE Transactions on Cybernetics doi: 10.1109/TCYB.2019.2944141 – volume: 114 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib178 article-title: Artificial rabbits optimization: A new bio-inspired meta-heuristic algorithm for solving engineering optimization problems publication-title: Engineering Applications of Artificial Intelligence doi: 10.1016/j.engappai.2022.105082 – volume: 198 start-page: 27 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib16 article-title: Approximation algorithms for the generalized incremental knapsack problem publication-title: Mathematical Programming doi: 10.1007/s10107-021-01755-7 – volume: 10 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib19 article-title: Survey of levy flight-based metaheuristics for optimization publication-title: Mathematics – volume: 149 year: 2020 ident: 10.1016/j.neucom.2025.132135_bib40 article-title: Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2020.113310 – volume: 32 start-page: 124 year: 1994 ident: 10.1016/j.neucom.2025.132135_bib111 article-title: Exact algorithms for the setup knapsack-problem publication-title: INFOR: Information Systems and Operational Research – volume: 311 start-page: 36 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib73 article-title: Features for the 0-1 knapsack problem based on inclusionwise maximal solutions publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2023.04.023 – volume: 50 start-page: 1872 year: 2020 ident: 10.1016/j.neucom.2025.132135_bib88 article-title: Solving discounted {0-1} knapsack problems by a discrete hybrid teaching-learning-based optimization algorithm publication-title: Applied Intelligence doi: 10.1007/s10489-020-01652-0 – volume: 41 start-page: 3712 year: 2014 ident: 10.1016/j.neucom.2025.132135_bib150 article-title: An improved firefly algorithm for solving dynamic multidimensional knapsack problems publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2013.11.040 – volume: 16 start-page: 37 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib162 article-title: A matheuristic for the 0-1 generalized quadratic multiple knapsack problem publication-title: Optimization Letters doi: 10.1007/s11590-019-01503-z – volume: 28 start-page: 910 year: 2014 ident: 10.1016/j.neucom.2025.132135_bib80 article-title: Approximation algorithms on 0-1 linear knapsack problem with a single continuous variable publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-012-9579-3 – volume: 28 start-page: 1619 year: 2017 ident: 10.1016/j.neucom.2025.132135_bib38 article-title: Solving 0-1 knapsack problem by a novel binary monarch butterfly optimization publication-title: Neural Computing and Applications doi: 10.1007/s00521-015-2135-1 – volume: 30 start-page: 3676 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib191 article-title: Recovering surface normal and arbitrary images: a dual regression network for photometric stereo publication-title: IEEE Transactions on Image Processing doi: 10.1109/TIP.2021.3064230 – volume: 15 start-page: 75 year: 2020 ident: 10.1016/j.neucom.2025.132135_bib29 article-title: Quantum inspired monarch butterfly optimisation for UCAV path planning navigation problem publication-title: INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION doi: 10.1504/IJBIC.2020.106428 – volume: 274 start-page: 17 year: 2014 ident: 10.1016/j.neucom.2025.132135_bib56 article-title: Chaotic krill herd algorithm publication-title: Information Sciences doi: 10.1016/j.ins.2014.02.123 – volume: 11 start-page: 1951 year: 2020 ident: 10.1016/j.neucom.2025.132135_bib139 article-title: Enhancing a machine learning binarization framework by perturbation operators: analysis on the multidimensional knapsack problem publication-title: International Journal of Machine Learning and Cybernetics doi: 10.1007/s13042-020-01085-8 – volume: 20 start-page: 1321 year: 2020 ident: 10.1016/j.neucom.2025.132135_bib45 article-title: A genetic algorithm based approach to solve multi-resource multi-objective knapsack problem for vegetable wholesalers in fuzzy environment publication-title: Operational Research doi: 10.1007/s12351-018-0392-3 – volume: 274 start-page: 886 year: 2019 ident: 10.1016/j.neucom.2025.132135_bib127 article-title: Mathematical models and decomposition methods for the multiple knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2018.10.043 – volume: 48 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib123 article-title: Approximating single and multi-objective nonlinear sum and product knapsack problems publication-title: Discrete Optimization doi: 10.1016/j.disopt.2023.100771 – volume: 85 start-page: 15 year: 1999 ident: 10.1016/j.neucom.2025.132135_bib79 article-title: The 0-1 knapsack problem with a single continuous variable publication-title: Mathematical Programming doi: 10.1007/s101070050044 – volume: 19 start-page: 264 year: 2015 ident: 10.1016/j.neucom.2025.132135_bib186 article-title: Behavior of multiobjective evolutionary agorithms on many-objective knapsack problems publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2014.2315442 – volume: 335 start-page: 36 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib60 article-title: Lagrangian matheuristics for the quadratic multiple knapsack problem publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2022.06.033 – volume: 11 start-page: 391 year: 2019 ident: 10.1016/j.neucom.2025.132135_bib30 article-title: Using monarch butterfly optimization to solve the emergency vehicle routing problem with relief materials in sudden disasters publication-title: OPEN GEOSCIENCES doi: 10.1515/geo-2019-0031 – volume: 78 start-page: 77 year: 2017 ident: 10.1016/j.neucom.2025.132135_bib103 article-title: A novel binary artificial bee colony algorithm for the set-union knapsack problem publication-title: Future Generation Computer Systems doi: 10.1016/j.future.2017.05.044 – volume: 260 start-page: 56 year: 2016 ident: 10.1016/j.neucom.2025.132135_bib107 article-title: A new exact approach for the 0-1 collapsing knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.12.009 – volume: 95 year: 2025 ident: 10.1016/j.neucom.2025.132135_bib8 article-title: DJAYA-RL: Discrete JAYA algorithm integrating reinforcement learning for the discounted {0-1} knapsack problem, Swarm and Evolutionary Computation – volume: 84 start-page: 919 year: 2025 ident: 10.1016/j.neucom.2025.132135_bib190 article-title: Reinforcement learning for solving the knapsack problem publication-title: CMC-Computers Materials & Continua doi: 10.32604/cmc.2025.062980 – volume: 103 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib82 article-title: Binary team game algorithm based on modulo operation for knapsack problem with a single continuous variable publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2021.107180 – volume: 9 start-page: 1174 year: 2016 ident: 10.1016/j.neucom.2025.132135_bib48 article-title: A novel hybrid cuckoo search algorithm with global harmony search for 0-1 Knapsack problems publication-title: International Journal of Computational Intelligence Systems doi: 10.1080/18756891.2016.1256577 – volume: 15 start-page: 153 year: 2014 ident: 10.1016/j.neucom.2025.132135_bib118 article-title: A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem publication-title: Natural Computing doi: 10.1007/s11047-014-9470-5 – volume: 10 start-page: 4445 year: 2024 ident: 10.1016/j.neucom.2025.132135_bib4 article-title: A graph neural network with negative message passing and uniformity maximization for graph coloring publication-title: Complex & Intelligent Systems doi: 10.1007/s40747-024-01355-w – volume: 143 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib33 article-title: Knapsack problems-An overview of recent advances. Part I: Single knapsack problems publication-title: Computers & Operations Research – volume: 7 start-page: 17 year: 2019 ident: 10.1016/j.neucom.2025.132135_bib101 article-title: The importance of transfer function in solving set-union knapsack problem based on discrete moth search algorithm publication-title: Mathematics doi: 10.3390/math7010017 – volume: 143 year: 2020 ident: 10.1016/j.neucom.2025.132135_bib115 article-title: A Lagrangean based solution algorithm for the knapsack problem with setups publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2019.113077 – volume: 97 year: 2025 ident: 10.1016/j.neucom.2025.132135_bib3 article-title: A two-stage metaheuristic algorithm for the multi-drops flying sidekick traveling salesman problem publication-title: Swarm and Evolutionary Computation doi: 10.1016/j.swevo.2025.102001 – volume: 93 start-page: 560 year: 2019 ident: 10.1016/j.neucom.2025.132135_bib102 article-title: A swarm intelligence-based algorithm for the set-union knapsack problem publication-title: Future Generation Computer Systems doi: 10.1016/j.future.2018.08.002 – volume: 14 start-page: 12257 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib28 article-title: Architecture evolution of convolutional neural network using monarch butterfly optimization publication-title: Journal of Ambient Intelligence and Humanized Computing doi: 10.1007/s12652-022-03766-4 – volume: 143 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib34 article-title: Knapsack problems - An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems publication-title: Computers & Operations Research – volume: 16 start-page: 503 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib42 article-title: Swarm activity-based dynamic PSO for distribution decision publication-title: International Journal of Automation and Control doi: 10.1504/IJAAC.2022.122620 – volume: 25 start-page: 1133 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib92 article-title: Set theory based operator design in evolutionary algorithms for solving knapsack problems publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2021.3080683 – volume: 191 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib177 article-title: A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem publication-title: Expert Systems with Applications – volume: 31 start-page: 1890 year: 2024 ident: 10.1016/j.neucom.2025.132135_bib130 article-title: LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup publication-title: International Transactions in Operational Research doi: 10.1111/itor.13213 – volume: 55 start-page: 233 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib100 article-title: An efficient local search for large-scale set-union knapsack problem publication-title: Data Technologies and Applications doi: 10.1108/DTA-05-2020-0120 – volume: 228 start-page: 598 year: 2014 ident: 10.1016/j.neucom.2025.132135_bib14 article-title: Multiple criteria dynamic programming and multiple knapsack problem publication-title: Applied Mathematics and Computation doi: 10.1016/j.amc.2013.12.022 – volume: 15 start-page: 337 year: 2020 ident: 10.1016/j.neucom.2025.132135_bib134 article-title: A randomized heuristic repair for the multidimensional knapsack problem publication-title: Optimization Letters doi: 10.1007/s11590-020-01611-1 – volume: 25 start-page: 1550030 year: 2016 ident: 10.1016/j.neucom.2025.132135_bib26 article-title: A multi-stage krill herd algorithm for global numerical optimization publication-title: International Journal on Artificial Intelligence Tools doi: 10.1142/S021821301550030X – volume: 298 start-page: 125 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib17 article-title: A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs publication-title: Annals of Operations Research doi: 10.1007/s10479-019-03290-3 – volume: 14 start-page: 278 year: 2009 ident: 10.1016/j.neucom.2025.132135_bib44 article-title: A novel set-based particle swarm optimization method for discrete optimization problems publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2009.2030331 – volume: 151 year: 2020 ident: 10.1016/j.neucom.2025.132135_bib68 article-title: New binary marine predators optimization algorithm for 0-1 knapsack problems publication-title: Computers & Industrial Engineering – volume: 12 start-page: 201 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib121 article-title: A hybrid grey wolf optimizer for solving the product knapsack problem publication-title: International Journal of Machine Learning and Cybernetics doi: 10.1007/s13042-020-01165-9 – volume: 176 year: 2025 ident: 10.1016/j.neucom.2025.132135_bib194 article-title: Deep learning based high accuracy heuristic approach for knapsack interdiction problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2024.106965 – volume: 216 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib23 article-title: Chaotic random spare ant colony optimization for multi-threshold image segmentation of 2D Kapur entropy publication-title: Knowledge-Based Systems doi: 10.1016/j.knosys.2020.106510 – volume: 31 start-page: 201 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib24 article-title: Contributions to dynamic analysis of differential evolution algorithms publication-title: Evolutionary Computation doi: 10.1162/evco_a_00318 – volume: 12 start-page: 3431 year: 2024 ident: 10.1016/j.neucom.2025.132135_bib198 article-title: A Fuzzer for detecting use-after-free vulnerabilities publication-title: Mathematics doi: 10.3390/math12213431 – volume: 11 start-page: 2695 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib104 article-title: Exploring initialization strategies for metaheuristic optimization: case study of the set-union knapsack problem publication-title: Mathematics doi: 10.3390/math11122695 – volume: 54 start-page: 1321 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib57 article-title: Evolutionary computation for solving search-based data analytics problems publication-title: Artificial Intelligence Review doi: 10.1007/s10462-020-09882-x – volume: 55 start-page: 8605 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib71 article-title: A novel binary artificial jellyfish search algorithm for solving 0-1 knapsack problems publication-title: Neural Processing Letters doi: 10.1007/s11063-023-11171-x – volume: 48 start-page: 831 year: 2016 ident: 10.1016/j.neucom.2025.132135_bib148 article-title: A set partitioning reformulation for the multiple-choice multidimensional knapsack problem publication-title: Engineering Optimization doi: 10.1080/0305215X.2015.1062094 – volume: 155 start-page: 1 year: 2004 ident: 10.1016/j.neucom.2025.132135_bib142 article-title: The multidimensional 0-1 knapsack problem: An overview publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(03)00274-1 – volume: 252 start-page: 761 year: 2016 ident: 10.1016/j.neucom.2025.132135_bib119 article-title: An exact decomposition algorithm for the generalized knapsack sharing problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.02.009 – volume: 129 start-page: 76 year: 2019 ident: 10.1016/j.neucom.2025.132135_bib131 article-title: Matheuristics for solving the multiple knapsack problem with setup publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2019.01.010 – volume: 27 start-page: 341 year: 1979 ident: 10.1016/j.neucom.2025.132135_bib117 article-title: Knapsack sharing problem publication-title: Operations Research doi: 10.1287/opre.27.2.341 – volume: 92 start-page: 23 year: 2016 ident: 10.1016/j.neucom.2025.132135_bib160 article-title: An evolutionary path relinking approach for the quadratic multiple knapsack problem publication-title: Knowledge-Based Systems doi: 10.1016/j.knosys.2015.10.004 – volume: 73 start-page: 1 year: 2019 ident: 10.1016/j.neucom.2025.132135_bib154 article-title: Two-dimensional knapsack-block packing problem publication-title: Applied Mathematical Modelling doi: 10.1016/j.apm.2019.03.039 – volume: 304 start-page: 901 year: 2023 ident: 10.1016/j.neucom.2025.132135_bib91 article-title: Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2022.04.036 – volume: 25 start-page: 667 year: 2018 ident: 10.1016/j.neucom.2025.132135_bib113 article-title: Improved dynamic programming and approximation results for the knapsack problem with setups publication-title: International Transactions in Operational Research doi: 10.1111/itor.12381 – volume: 323 start-page: 425 year: 2025 ident: 10.1016/j.neucom.2025.132135_bib12 article-title: A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2024.12.019 – volume: 31 start-page: 1995 year: 2019 ident: 10.1016/j.neucom.2025.132135_bib49 article-title: Monarch butterfly optimization publication-title: Neural Computing and Applications doi: 10.1007/s00521-015-1923-y – volume: 8 start-page: 303 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib168 article-title: A Survey of evolutionary algorithms for multi-objective optimization problems with irregular Pareto fronts publication-title: IEEE/CAA Journal of Automatica Sinica doi: 10.1109/JAS.2021.1003817 – volume: 46 start-page: 445 year: 2016 ident: 10.1016/j.neucom.2025.132135_bib58 article-title: Brain storm optimization algorithm: a review publication-title: Artificial Intelligence Review doi: 10.1007/s10462-016-9471-0 – year: 2025 ident: 10.1016/j.neucom.2025.132135_bib196 article-title: A Two-stage cooperative discrete differential evolution with Q-Learning for multi-objective energy-efficient distributed blocking flow-shop scheduling publication-title: IEEE Transactions on Evolutionary Computation – volume: 25 start-page: 13617 year: 2021 ident: 10.1016/j.neucom.2025.132135_bib95 article-title: An iterative rounding strategy-based algorithm for the set-union knapsack problem publication-title: Soft Computing doi: 10.1007/s00500-021-06091-8 – volume: 13 start-page: 259 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib97 article-title: The local branching as a learning strategy in the evolutionary algorithm: the case of the set-union knapsack problem publication-title: Journal of Advances in Information Technology doi: 10.12720/jait.13.3.259-264 – volume: 369 start-page: 634 year: 2016 ident: 10.1016/j.neucom.2025.132135_bib87 article-title: Exact and approximate algorithms for discounted {0-1} knapsack problem publication-title: Information Sciences doi: 10.1016/j.ins.2016.07.037 – volume: 26 start-page: 175 year: 2016 ident: 10.1016/j.neucom.2025.132135_bib157 article-title: Parallel improved quantum inspired evolutionary algorithm to solve large size quadratic knapsack problems publication-title: Swarm and Evolutionary Computation doi: 10.1016/j.swevo.2015.09.005 – start-page: 637 year: 2014 ident: 10.1016/j.neucom.2025.132135_bib185 article-title: Preference-based NSGA-II for many-objective knapsack problems publication-title: Joint 7th International Conference on Soft Computing and Intelligent Systems (SCIS) and 15th International Symposium on Advanced Intelligent Systems (ISIS), Kitakyushu, 2014 doi: 10.1109/SCIS-ISIS.2014.7044821 – volume: 36 start-page: 623 year: 2010 ident: 10.1016/j.neucom.2025.132135_bib66 article-title: A new lagrangian based branch and bound algorithm for the 0-1 knapsack problem publication-title: Electronic Notes in Discrete Mathematics doi: 10.1016/j.endm.2010.05.079 – volume: 298 year: 2026 ident: 10.1016/j.neucom.2025.132135_bib74 article-title: A cooperative co-evolutionary algorithm with core-based grouping strategy for large-scale 0–1 knapsack problems publication-title: Expert Systems with Applications – volume: 145 start-page: 145 year: 2018 ident: 10.1016/j.neucom.2025.132135_bib166 article-title: A Repair-based approach for stochastic quadratic multiple knapsack problem publication-title: Knowledge-Based Systems doi: 10.1016/j.knosys.2018.01.012 – volume: 83 start-page: 125 year: 2017 ident: 10.1016/j.neucom.2025.132135_bib132 article-title: Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2017.02.009 – volume: 277 start-page: 84 year: 2019 ident: 10.1016/j.neucom.2025.132135_bib110 article-title: An empirical analysis of exact algorithms for the unbounded knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2019.02.011 – volume: 300 start-page: 405 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib187 article-title: A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2021.10.033 – volume: 4 start-page: 227 year: 2018 ident: 10.1016/j.neucom.2025.132135_bib43 article-title: A quarter century of particle swarm optimization publication-title: Complex & Intelligent Systems doi: 10.1007/s40747-018-0071-2 – volume: 17 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib85 article-title: Binary salp swarm algorithm for discounted {0-1} knapsack problem publication-title: PLoS One doi: 10.1371/journal.pone.0266537 – volume: 83 year: 2019 ident: 10.1016/j.neucom.2025.132135_bib135 article-title: A binary grey wolf optimizer for the multidimensional knapsack problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2019.105645 – volume: 2 start-page: 113 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib189 article-title: Q-Learning-based teaching-learning optimization for distributed two-stage hybrid flow shop scheduling with fuzzy processing time publication-title: Complex System Modeling and Simulation doi: 10.23919/CSMS.2022.0002 – volume: 253 start-page: 122 year: 2019 ident: 10.1016/j.neucom.2025.132135_bib78 article-title: New exact approaches and approximation results for the penalized knapsack problem publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2017.11.023 – volume: 66 start-page: 199 year: 2016 ident: 10.1016/j.neucom.2025.132135_bib161 article-title: Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2015.08.002 – volume: 10 start-page: 135 year: 2018 ident: 10.1016/j.neucom.2025.132135_bib67 article-title: Solving 0-1 knapsack problems by chaotic monarch butterfly optimization algorithm publication-title: Memetic Computing doi: 10.1007/s12293-016-0211-4 – volume: 4 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib151 article-title: Dynamic multidimensional knapsack problem benchmark datasets publication-title: Systems and Soft Computing doi: 10.1016/j.sasc.2022.200041 – volume: 6 start-page: 562 year: 2019 ident: 10.1016/j.neucom.2025.132135_bib53 article-title: Donkey and smuggler optimization algorithm: a collaborative working approach to path finding publication-title: Journal of Computational Design and Engineering doi: 10.1016/j.jcde.2019.04.004 – volume: 18 start-page: 8519 year: 2022 ident: 10.1016/j.neucom.2025.132135_bib169 article-title: Solving multi-objective fuzzy job-shop scheduling problem by a hybrid adaptive differential evolution algorithm publication-title: IEEE Transactions on Industrial Informatics doi: 10.1109/TII.2022.3165636 |
| SSID | ssj0017129 |
| Score | 2.455918 |
| SecondaryResourceType | review_article |
| SourceID | crossref |
| SourceType | Index Database |
| StartPage | 132135 |
| Title | Recent Advances in Knapsack Problem: A Comprehensive Review of Models, Algorithms, and Applications |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: ScienceDirect database issn: 0925-2312 databaseCode: AIEXJ dateStart: 19950101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0017129 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Ja9wwFBbTpIdeupfu6NBjHDKybEu5mZKmG6GUFKYno7XjZCIPk5kQyJ_vkyUvaaA0h16EEeIh_H08PT29BaF3qVSGU6MSloo0oQUMMgdAON2jRktic9uWzP9aHB2x2Yx_m0yuulyYi0XhHLu85Mv_CjXMAdg-dfYWcPdCYQK-AXQYAXYY_wl4MAT9-34ZHvfbcNcvTizPhTr1aQG-fUyXjn62XJl5jGD_3uew-PZoi9CkePGrWdXreXDHeBd7OXrvHtu1bY0P1XaIiL6H8syXYNCeb72vAf5Tq1l-Cjdv4pHZUiqwBvTSZgg3CPpwVrukbAa3fxBwKOrk0Iw9FiSLqXsj1yPMgV1JRooTLsXTULfkhk4P7oWTXWc2PsDHS9wdll8vof3H0dYHHHaxbCdVkFJ5KVWQcgdtkyLjoBK3y08Hs8_9I1QxJaFUY9xul3nZhgfe3M3IshmZKMcP0f14t8Bl4MQjNDHuMXrQ9e3AUY0_QSpQBHcUwbXDHUVwpMg-LvE1guBAENxYHAiygwd67GAgBx6T4yn68eHg-P3HJDbbSNTUV6MVhDDhe37kOVWMZ4RZGKzWmlma6VRTYaRUTOqcW5YapqmUTFF_X82toOkztOUaZ54jbKVWfM9qkwlCs9RwXaQ29WXH4PSYUvMCJd2Pqpahpkr1N4Be3nL9K3RvoN1rtLVebcwbdFddrOvz1duI8m8qvHEm |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Recent+Advances+in+Knapsack+Problem%3A+A+Comprehensive+Review+of+Models%2C+Algorithms%2C+and+Applications&rft.jtitle=Neurocomputing+%28Amsterdam%29&rft.au=Feng%2C+Yanhong&rft.au=Hu%2C+Tianyu&rft.au=Chen%2C+Xin-Ao&rft.au=Wang%2C+Gai-Ge&rft.date=2025-11-01&rft.issn=0925-2312&rft.spage=132135&rft_id=info:doi/10.1016%2Fj.neucom.2025.132135&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_neucom_2025_132135 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-2312&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-2312&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-2312&client=summon |