Results 11 to 20 of about 28,713 (220)
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
CAAI Transactions on Intelligence Technology, EarlyView., 2023 Abstract The Internet of Things is emerging as a crucial technology in aiding humans and making their lives easier. Among the human population, a large percentage of people suffer from disabilities resulting in challenges in everyday life particularly people with visual disabilities.
Hania Tarik +8 more
wiley +1 more source
Quantum-Inspired Differential Evolution with Grey Wolf Optimizer for 0-1 Knapsack Problem
Mathematics, 2021 The knapsack problem is one of the most widely researched NP-complete combinatorial optimization problems and has numerous practical applications. This paper proposes a quantum-inspired differential evolution algorithm with grey wolf optimizer (QDGWO) to
Yule Wang, Wanliang Wang
doaj +1 more source
Knapsack problems with setups [PDF]
European Journal of Operational Research, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. Michel +2 more
openaire +3 more sources
Projects Selection In Knapsack Problem By Using Artificial Bee Colony Algorithm
Tikrit Journal of Pure Science, 2023 One of the combinatorial optimization problems is Knapsack problem, which aims to maximize the benefit of objects whose weight not exceeding the capacity of knapsack.
Armaneesa Naaman Hasoon
doaj +1 more source
On the Robust Knapsack Problem [PDF]
SIAM Journal on Optimization, 2013 We consider an uncertain variant of the knapsack problem that arises when the exact weight of each item is not exactly known in advance but belongs to a given interval, and the number of items whose weight differs from the nominal value is bounded by a constant.
MONACI, MICHELE, U. Pferschy
openaire +4 more sources
Optimalisasi Penyelesaian Knapsack Problem Dengan Algoritma Genetika
Lontar Komputer, 2016 Knapsack problems is a problem that often we encounter in everyday life. Knapsack problem itself is a problem where a person faced with the problems of optimization on the selection of objects that can be inserted into the container which has limited ...
I Wayan Supriana
doaj +1 more source
Knapsack problems in products of groups [PDF]
, 2015 The classic knapsack and related problems have natural generalizations to arbitrary (non-commutative) groups, collectively called knapsack-type problems in groups. We study the effect of free and direct products on their time complexity.
Frenkel, Elizaveta +2 more
core +1 more source
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem [PDF]
Mathematical Methods of Operations Research, 2020 AbstractIn this article, we introduce the rectangular knapsack problem as a special case of the quadratic knapsack problem consisting in the maximization of the product of two separate knapsack profits subject to a cardinality constraint. We propose a polynomial time algorithm for this problem that provides a constant approximation ratio of 4.5.
Britta Schulze +5 more
openaire +2 more sources