Results 31 to 40 of about 43,488 (185)
Feasibility of Integer Knapsacks [PDF]
SIAM Journal on Optimization, 2010 Given a matrix $A\in\mathbb{Z}^{m\times n}$ satisfying certain regularity assumptions, we consider the set $\mathcal{F}(A)$ of all vectors $\boldsymbol{b}\in\mathbb{Z}^m$ such that the associated knapsack polytope $P(A,\boldsymbol{b})=\{\boldsymbol{x}\in\mathbb{R}^n_{\geq0}:A\boldsymbol{x}=\boldsymbol{b}\}$ contains an integer point. When $m=1$ the set
Aliev, Iskander, Henk, Martin
openaire +1 more source
Teknika, 2014 Advanced Encryption Standard (AES) dan Knapsack adalah dua algoritma enkripsi simetris dan asimetris yang paling sering digunakan. Penelitian ini menganalisa kedua algoritma AES dan algoritma Knapsack.
Timothy John Pattiasina
doaj +1 more source
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
Nature-inspired optimization algorithms in knapsack problem: A review [PDF]
المجلة العراقية للعلوم الاحصائية, 2019 Meta-heuristic algorithms have become an arising field of research in recent years. Some of these algorithms have proved to be efficient in solving combinatorial optimization problems, particularly knapsack problem.
Ghalya Tawfeeq Basheer, Zakariya Algamal
doaj +1 more source
Performance Evaluation of UAVs in Wheat Disease Control
Agronomy, 2023 Plant protection unmanned aircraft vehicles (UAVs) were developed rapidly in China. The operation performances of different models of UAVs were different.
Qingqing Zhou +4 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
A Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem [PDF]
, 2014 The 0-1 knapsack problem is a well-known combinatorial optimisation problem. Approximation algorithms have been designed for solving it and they return provably good solutions within polynomial time.
Dong, Hongbin, He, Feidun, He, Jun
core
Knapsack Secretary Through Boosting
, 2022 We revisit the knapsack-secretary problem (Babaioff et al.; APPROX 2007), a generalization of the classic secretary problem in which items have different sizes and multiple items may be selected if their total size does not exceed the capacity $B$ of a knapsack. Previous works show competitive ratios of $1/(10e)$ (Babaioff et al.), $1/8.06$ (Kesselheim
Abels, Andreas +3 more
openaire +3 more sources
Theory of Computing SystemsAbstract We analyze the competitive ratio and the advice complexity of the online unbounded knapsack problem. An instance is given as a sequence of n items with a size and a value each, and an algorithm has to decide whether or not and how often to pack each item into a knapsack of bounded capacity.
Böckenhauer, Hans-Joachim +8 more
openaire +3 more sources
Multi-Dimensional Arms for Combinatorial Multi-Armed Bandit
IEEE AccessThe multi-armed bandit (MAB) problem with concave rewards has indeed become a significant area of research in recent years. In MAB problem, maximizing total rewards within a fixed number of pulls is a common objective.
Qi Li, Lijun Cai
doaj +1 more source