Binary salp swarm algorithm for discounted {0-1} knapsack problem. [PDF]
PLoS ONE, 2022 While the classical knapsack problem has been the object to be solved by optimization algorithm proposals for many years, another version of this problem, discounted {0-1} knapsack problem, is gaining a lot of attention recently.
Binh Thanh Dang, Tung Khac Truong
doaj +4 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
Quantum-Inspired Differential Evolution with Grey Wolf Optimizer for 0-1 Knapsack Problem [PDF]
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 +2 more sources
Integer 1/0 Knapsack Problem Dynamic Programming Approach in Building Maintenance Optimization
International Journal of Science and Applied Science: Conference Series, 2017 The most common problem in urban areas is the high public demand and the limited provision of housing. In meeting the needs of affordable housing for low income communities, the Government of Indonesia implements Rusunawa Project. Object of this research
Viska Dewi Fawzy +2 more
doaj +3 more sources
Reducing the 0-1 knapsack problem with a single continuous variable to the standard 0-1 knapsack problem [PDF]
International Journal of Operations Research and Information Systems, 2016 The 0-1 knapsack problem with a single continuous variable (KPC) is a natural extension of the binary knapsack problem (KP), where the capacity is not any longer fixed but can be extended which is expressed by a continuous variable.
Briskorn, Dirk, Büther, Marcel
core +2 more sources
A Comparative Study of Meta-Heuristic Optimization Algorithms for 0 – 1 Knapsack Problem: Some Initial Results [PDF]
IEEE Access, 2019 In this paper, we present some initial results of several meta-heuristic optimization algorithms, namely, genetic algorithms, simulated annealing, branch and bound, dynamic programming, greedy search algorithm, and a hybrid genetic algorithm-simulated ...
Absalom E. Ezugwu +4 more
doaj +2 more sources
Solving 0-1 knapsack problem by greedy degree and expectation efficiency [PDF]
, 2015 It is well known that 0-1 knapsack problem (KP01) plays an important role in both computing theory and real life application. Due to its NP-hardness, lots of impressive research work has been performed on many variants of the problem.
Jianhui Lv +4 more
openalex +3 more sources
An improved monkey algorithm for a 0-1 knapsack problem [PDF]
Applied Soft Computing Journal, 2016 The flow chart of CGMA. The 0-1 knapsack problem is a classic combinational optimization problem.The monkey algorithm (MA) is a novel swarm intelligent based algorithm.This paper proposed a binary version of the monkey algorithm for solving 0-1 knapsack problem.The result of the proposed algorithm provides better results in solving the 0-1 knapsack ...
Yongquan Zhou, Xin Chen, Guo Zhou
exaly +2 more sources
Solving Large 0–1 Multidimensional Knapsack Problems by a New Simplified Binary Artificial Fish Swarm Algorithm [PDF]
, 2015 Available online 8 October 2013.This paper proposes a simplified binary version of the artificial fish swarm algorithm (S-bAFSA) for solving 0–1 knapsack problems.
Md. Abul Kalam Azad +2 more
openalex +3 more sources
A note on the max-min 0-1 knapsack problem
Journal of Combinatorial Optimization, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Iida, Hiroshi
openalex +4 more sources