Results 21 to 30 of about 33,818 (220)
Average sensitivity of the Knapsack Problem
CoRR, 2022 23 pages, ESA ...
Kumabe, Soh, Yoshida, Yuichi
openaire +4 more sources
Comparative analysis of genetic crossover operators in knapsack problem
Journal of Applied Sciences and Environmental Management, 2016 The Genetic Algorithm (GA) is an evolutionary algorithms and technique based on natural selections of individuals called chromosomes. In this paper, a method for solving Knapsack problem via GA (Genetic Algorithm) is presented. We compared six different
D Hakimi +3 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
Subsidies, Knapsack Auctions and Dantzig’s Greedy Heuristic [PDF]
, 2009 A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by quality and sellers have private reserve prices for their items. Sellers quote prices strategically, inducing a knapsack game.
Ensthaler, Ludwig, Giebe, Thomas
core +3 more sources
Cybernetics and Information Technologies, 2021 Merkle-Hellman public key cryptosystem is a long-age old algorithm used in cryptography. Despite being computationally fast, for very large input sizes it may operate slower due to thread creation overhead or reaching a deadlock situation. In this paper,
Rahul Vaddadi Sai +2 more
doaj +1 more source
A Thermodynamical Selection-Based Discrete Differential Evolution for the 0-1 Knapsack Problem
Entropy, 2014 Many problems in business and engineering can be modeled as 0-1 knapsack problems. However, the 0-1 knapsack problem is one of the classical NP-hard problems.
Zhaolu Guo +4 more
doaj +1 more source
Dynamic Multidimensional Knapsack Problem benchmark datasets
Systems and Soft Computing, 2022 With increasing research on solving Dynamic Optimization Problems (DOPs), many metaheuristic algorithms and their adaptations have been proposed to solve them.
Jonas Skackauskas, Tatiana Kalganova
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
IEEE Access, 2019 The 0-1 knapsack problem is a typical discrete combinatorial optimization problem with numerous applications. In this paper, a binary multi-scale quantum harmonic oscillator algorithm (BMQHOA) with genetic operator is proposed for solving 0-1 knapsack ...
Yan Huang +4 more
doaj +1 more source
A two-phase method for solving continuous rank-one quadratic knapsack problems [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2022 We propose a two-phase algorithm for solving continuous rank-one quadratic knapsack problems (R1QKPs). In particular, we study the solution structure of the problem without the knapsack constraint.
S.E. Monabbati
doaj +1 more source