Knapsack Problems in Groups [PDF]
Mathematics of Computation, 2013 We generalize the classical knapsack and subset sum problems to arbitrary groups and study the computational complexity of these new problems. We show that these problems, as well as the bounded submonoid membership problem, are P-time decidable in ...
Myasnikov, Alexei +2 more
core +3 more sources
A Novel Harmony Search Algorithm Based on Teaching-Learning Strategies for 0-1 Knapsack Problems [PDF]
The Scientific World Journal, 2014 To enhance the performance of harmony search (HS) algorithm on solving the discrete optimization problems, this paper proposes a novel harmony search algorithm based on teaching-learning (HSTL) strategies to solve 0-1 knapsack problems.
Shouheng Tuo +2 more
doaj +2 more sources
Flexible Wolf Pack Algorithm for Dynamic Multidimensional Knapsack Problems [PDF]
Research, 2020 Optimization problems especially in a dynamic environment is a hot research area that has attracted notable attention in the past decades. It is clear from the dynamic optimization literatures that most of the efforts have been devoted to continuous ...
Husheng Wu, Renbin Xiao
doaj +2 more sources
An efficient optimizer for the 0/1 knapsack problem using group counseling [PDF]
PeerJ Computer Science, 2023 The field of optimization is concerned with determining the optimal solution to a problem. It refers to the mathematical loss or gain of a given objective function.
Yazeed Yasin Ghadi +6 more
doaj +3 more sources
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size [PDF]
, 2021 The development of a satisfying and rigorous mathematical understanding of the performance of neural networks is a major challenge in artificial intelligence.
Hertrich, Christoph, Skutella, Martin
core +3 more sources
Application of Black Hole Algorithm for Solving Knapsack Problems [PDF]
Computer and Knowledge Engineering, 2021 This study investigates the application of the Black Hole algorithm (BH) for solving 0–1 knapsack problems. Knapsack problem is a classic and famous problem for testing and analyzing the behavior of optimization and meta-heuristic algorithms. There is no
Abdolreza Hatamlou
doaj +1 more source
A novel approach for solving travelling thief problem using enhanced simulated annealing [PDF]
PeerJ Computer Science, 2021 Real-world optimization problems are getting more and more complex due to the involvement of inter dependencies. These complex problems need more advanced optimizing techniques.
Hamid Ali +5 more
doaj +2 more sources
Cryptanalysis of Knapsack Cipher Using Genetic Algorithm [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2007 This research offers a new method in Cryptanalysis of knapsack cipher. It focuses on the application of genetic algorithm as a modern way in solving complex problems (problems have a huge numbers of alternate solutions in appropriate time).
Subhi Hamdon +2 more
doaj +1 more source
Nature-inspired optimization algorithms in knapsack problem: A review [PDF]
المجلة العراقية للعلوم الاحصائية, 2019 Meta-heuristic algorithms have become an arising field of research in recent years. Some of these algorithms have proved to be efficient in solving combinatorial optimization problems, particularly knapsack problem.
Ghalya Tawfeeq Basheer, Zakariya Algamal
doaj +1 more source
Binary social group optimization algorithm for solving 0-1 knapsack problem [PDF]
Decision Science Letters, 2022 In this paper, we propose the binary version of the Social Group Optimization (BSGO) algorithm for solving the 0-1 knapsack problem. The standard Social Group Optimization (SGO) is used for continuous optimization problems.
Anima Naik, Pradeep Kumar Chokkalingam
doaj +1 more source