Results 1 to 10 of about 24,926 (205)
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
Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem. [PDF]
Comput Intell Neurosci, 2022 0-1 Knapsack problem (KP) is NP-hard. Approximate solution is vital for solving KP exactly. In this paper, a fast polynomial time approximate solution (FPTAS) is proposed for KP. FPTAS is a local search algorithm. The best approximate solution to KP can be found in the neighborhood of the solution of upper bound for exact k-item knapsack problem (E-kKP)
Wang Z, Zhang H, Li Y.
europepmc +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
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
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
Tolerance analysis for 0–1 knapsack problems [PDF]
European Journal of Operational Research, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Pisinger, Alima Saidi
openaire +3 more sources
Heuristics for the 0–1 multidimensional knapsack problem [PDF]
European Journal of Operational Research, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boyer, V., Elkihel, M., El Baz, D.
openaire +1 more source
Adjusted 0-1 Knapsack Problem in Cargo Flow by Using Artificial Bee Colony Algorithm
Journal of Computing Research and Innovation, 2022 This study describes the problem with the knapsack that occurred in the cargo flow. The problem of the knapsack is the problem of optimisation used to illustrate the problem and the solution in which each set of items has its own specific value and ...
Siti Hafawati Jamaluddin +2 more
doaj +3 more sources
Algorithms, 2022 The multiple knapsack problem (0/1-mKP) is a valuable NP-hard problem involved in many science-and-engineering applications. In current research, there exist two main approaches: 1.
Patcharin Buayen, Jeeraporn Werapun
doaj +1 more source