Results 21 to 30 of about 28,713 (220)
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
On the rectangular knapsack problem
Mathematical Methods of Operations Research, 2022 AbstractA recent paper by Schulze et al. (Math Methods Oper Res 92(1):107–132, 2020) presented the Rectangular Knapsack Problem (Rkp) as a crucial subproblem in the study on the Cardinality-constrained Bi-objective Knapsack Problem (Cbkp). To this end, they started an investigation into its complexity and approximability.
Fritz Bökler +2 more
openaire +2 more sources
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
Complexity, 2023 In this paper, a binary variant of a novel nature-inspired metaheuristic algorithm called the nutcracker optimization algorithm (NOA) is presented for binary optimization problems.
Mohamed Abdel-Basset +3 more
doaj +1 more source
Average sensitivity of the Knapsack Problem
CoRR, 2022 23 pages, ESA ...
Kumabe, Soh, Yoshida, Yuichi
openaire +4 more sources
Binary light spectrum optimizer for knapsack problems: An improved model
Alexandria Engineering Journal, 2023 This paper presents a binary variant of a novel physics-based meta-heuristic optimization algorithm, namely Light spectrum optimizer (LSO), for tackling both the 0–1 knapsack (KP01) and multidimensional knapsack problems (MKP).
Mohamed Abdel-Basset +5 more
doaj +1 more source
Improved Online Algorithms for Knapsack and GAP in the Random Order Model [PDF]
, 2019 The knapsack problem is one of the classical problems in combinatorial optimization: Given a set of items, each specified by its size and profit, the goal is to find a maximum profit packing into a knapsack of bounded capacity.
Albers, Susanne +2 more
core +2 more sources
PKCHD: Towards a Probabilistic Knapsack Public-Key Cryptosystem with High Density
Information, 2019 By introducing an easy knapsack-type problem, a probabilistic knapsack-type public key cryptosystem (PKCHD) is proposed. It uses a Chinese remainder theorem to disguise the easy knapsack sequence. Thence, to recover the trapdoor information, the implicit
Yuan Ping +4 more
doaj +1 more source
Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits [PDF]
, 2011 In the stochastic knapsack problem, we are given a knapsack of size B, and a set of jobs whose sizes and rewards are drawn from a known probability distribution. However, we know the actual size and reward only when the job completes.
Gupta, Anupam +3 more
core +2 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