Results 21 to 30 of about 28,490 (215)
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
Matroid and Knapsack Center Problems [PDF]
, 2013 In the classic $k$-center problem, we are given a metric graph, and the objective is to open $k$ nodes as centers such that the maximum distance from any vertex to its closest center is minimized.
A. Schrijver +15 more
core +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
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
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
Knapsack Problems for Wreath Products [PDF]
, 2018 In recent years, knapsack problems for (in general non-commutative) groups have attracted attention. In this paper, the knapsack problem for wreath products is studied. It turns out that decidability of knapsack is not preserved under wreath product.
+3 more
core +2 more sources
Online Minimization Knapsack Problem
Theoretical Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Han, Xin, Makino, Kazuhisa
openaire +2 more sources
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