Results 31 to 40 of about 28,713 (220)
SOLVING MULTIPLE-CONTAINER PACKING PROBLEMS USING PSEUDO-MEIOSIS GENETIC ALGORITHM
Journal of Engineering, 2005 Knapsack problems are a class of common but difficult (NP-complete or NP -hard) problems. Since, it is believed that no knapsack problem algorithm can be constructed whose computation time optimality increases as any polynomial function of the problem ...
Bara'a Ali Attea +1 more
doaj +1 more source
Double-Decision Interactive Diversity Algorithm for Solving Multidimensional Knapsack Problems [PDF]
Jisuanji gongcheng, 2023 A double-decision interactive diversity algorithm called the DDEA is proposed to solve the problems of the single-repair method and poor adaptability of population dynamics in traditional solving algorithms for the Multidimensional Knapsack Problem(MKP ...
Dazhi PAN, Yan JIANG, Yawen LIU
doaj +1 more source
CoRR, 2016 We consider a variant of the knapsack problem, where items are available with different possible weights. Using a separate budget for these item improvements, the question is: Which items should be improved to which degree such that the resulting classic knapsack problem yields maximum profit?
Marc Goerigk +3 more
openaire +2 more sources
Mathematics, 2021 This paper presents a methodological scheme to obtain the maximum benefit in occupational health by attending to psychosocial risk factors in a company.
Marta Lilia Eraña-Díaz +5 more
doaj +1 more source
A Comparison of Greedy Algorithm and Dynamic Programming Algorithm [PDF]
SHS Web of Conferences, 2022 Two algorithms to handle the problem include greedy algorithms and dynamic programming. Because of their simplicity, intuitiveness, and great efficiency in addressing problems, they are frequently employed in a variety of circumstances.
Chen Xiaoxi
doaj +1 more source
Hardness of Approximation for Knapsack Problems [PDF]
Theory of Computing Systems, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Harry Buhrman +2 more
openaire +3 more sources
Generation Methods for Multidimensional Knapsack Problems and their Implications [PDF]
Journal of Systemics, Cybernetics and Informatics, 2007 Although there are a variety of heuristics developed and applied to the variants of the binary knapsack problem, the testing of these heuristics are based on poorly defined test problems.
Raymond R. Hill, Chaitr Hiremath
doaj
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 +1 more source
Topology Knapsack Problem for Geometry Optimization
IEEE AccessThe knapsack problem is a classic NP-hard optimization challenge with wide-ranging applications in computer science, such as resource allocation. While several variants have been developed, including the 0/1, fractional, and multi-dimensional knapsack ...
Hsiao-Hui Li +2 more
doaj +1 more source
A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems
International Journal of Computational Intelligence Systems, 2016 Cuckoo search (CS) is a novel biologically inspired algorithm and has been widely applied to many fields. Although some binary-coded CS variants are developed to solve 0–1 knapsack problems, the search accuracy and the convergence speed are still needed ...
Yanhong Feng, Gai-Ge Wang, Xiao-Zhi Gao
doaj +1 more source