126 related articles for article (PubMed ID: 37346609)
1. An efficient optimizer for the 0/1 knapsack problem using group counseling.
Ghadi YY; AlShloul T; Nezami ZI; Ali H; Asif M; Aljuaid H; Ahmad S
PeerJ Comput Sci; 2023; 9():e1315. PubMed ID: 37346609
[TBL] [Abstract][Full Text] [Related]
2. Binary salp swarm algorithm for discounted {0-1} knapsack problem.
Dang BT; Truong TK
PLoS One; 2022; 17(4):e0266537. PubMed ID: 35390109
[TBL] [Abstract][Full Text] [Related]
3. Exact solution of the robust knapsack problem.
Monaci M; Pferschy U; Serafini P
Comput Oper Res; 2013 Nov; 40(11):2625-2631. PubMed ID: 24187428
[TBL] [Abstract][Full Text] [Related]
4. A novel approach for solving travelling thief problem using enhanced simulated annealing.
Ali H; Zaid Rafique M; Shahzad Sarfraz M; Malik MSA; Alqahtani MA; Alqurni JS
PeerJ Comput Sci; 2021; 7():e377. PubMed ID: 33834093
[TBL] [Abstract][Full Text] [Related]
5. Improved Online Algorithms for Knapsack and GAP in the Random Order Model.
Albers S; Khan A; Ladewig L
Algorithmica; 2021; 83(6):1750-1785. PubMed ID: 34720295
[TBL] [Abstract][Full Text] [Related]
6. Solving the 0/1 knapsack problem by a biomolecular DNA computer.
Taghipour H; Rezaei M; Esmaili HA
Adv Bioinformatics; 2013; 2013():341419. PubMed ID: 23509451
[TBL] [Abstract][Full Text] [Related]
7. Modeling and efficient optimization for object-based scalability and some related problems.
Batra P
IEEE Trans Image Process; 2000; 9(10):1677-92. PubMed ID: 18262907
[TBL] [Abstract][Full Text] [Related]
8. Flexible Wolf Pack Algorithm for Dynamic Multidimensional Knapsack Problems.
Wu H; Xiao R
Research (Wash D C); 2020; 2020():1762107. PubMed ID: 32159160
[TBL] [Abstract][Full Text] [Related]
9. A Memetic Algorithm Based on Probability Learning for Solving the Multidimensional Knapsack Problem.
Li Z; Tang L; Liu J
IEEE Trans Cybern; 2022 Apr; 52(4):2284-2299. PubMed ID: 32673199
[TBL] [Abstract][Full Text] [Related]
10. Optimal sequence for chain matrix multiplication using evolutionary algorithm.
Iqbal U; Shoukat IA; Elahi I; Kanwal A; Farrukh B; A Alqahtani M; Rauf A; Alqurni JS
PeerJ Comput Sci; 2021; 7():e395. PubMed ID: 33817041
[TBL] [Abstract][Full Text] [Related]
11. A novel harmony search algorithm based on teaching-learning strategies for 0-1 knapsack problems.
Tuo S; Yong L; Deng F
ScientificWorldJournal; 2014; 2014():637412. PubMed ID: 24574905
[TBL] [Abstract][Full Text] [Related]
12. Large-W limit of the knapsack problem.
Williams M
Phys Rev E; 2024 Apr; 109(4-1):044151. PubMed ID: 38755943
[TBL] [Abstract][Full Text] [Related]
13. Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem.
Wang Z; Zhang H; Li Y
Comput Intell Neurosci; 2022; 2022():1266529. PubMed ID: 36317076
[TBL] [Abstract][Full Text] [Related]
14. A Novel Approach to Combinatorial Problems: Binary Growth Optimizer Algorithm.
Leiva D; Ramos-Tapia B; Crawford B; Soto R; Cisternas-Caneo F
Biomimetics (Basel); 2024 May; 9(5):. PubMed ID: 38786493
[TBL] [Abstract][Full Text] [Related]
15. Multi-Objective Neural Evolutionary Algorithm for Combinatorial Optimization Problems.
Shao Y; Lin JC; Srivastava G; Guo D; Zhang H; Yi H; Jolfaei A
IEEE Trans Neural Netw Learn Syst; 2023 Apr; 34(4):2133-2143. PubMed ID: 34473629
[TBL] [Abstract][Full Text] [Related]
16. Genetic programming over context-free languages with linear constraints for the knapsack problem: first results.
Bruhn P; Geyer-Schulz A
Evol Comput; 2002; 10(1):51-74. PubMed ID: 11928691
[TBL] [Abstract][Full Text] [Related]
17. An approach for optimal allocation of safety resources: using the knapsack problem to take aggregated cost-efficient preventive measures.
Reniers GL; Sörensen K
Risk Anal; 2013 Nov; 33(11):2056-67. PubMed ID: 23551066
[TBL] [Abstract][Full Text] [Related]
18. The Subset Sum game.
Darmann A; Nicosia G; Pferschy U; Schauer J
Eur J Oper Res; 2014 Mar; 233(3):539-549. PubMed ID: 25844012
[TBL] [Abstract][Full Text] [Related]
19. An Adaptive Optimization Spiking Neural P System for Binary Problems.
Zhu M; Yang Q; Dong J; Zhang G; Gou X; Rong H; Paul P; Neri F
Int J Neural Syst; 2021 Jan; 31(1):2050054. PubMed ID: 32938261
[TBL] [Abstract][Full Text] [Related]
20. Multi-objective database queries in combined knapsack and set covering problem domains.
Mochocki SA; Lamont GB; Leishman RC; Kauffman KJ
J Big Data; 2021; 8(1):46. PubMed ID: 33723497
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
