Results 131 to 140 of about 43,488 (185)
Some of the next articles are maybe not open access.
Fundamenta Informaticae, 2000
The interactive knapsack problems are generalizations of the classical knapsack problem. Three different new NP-complete problems, interactive knapsack heuristic decision problem (IKHD), interactive knapsack decision problem (IKD) and multidimensional cloned knapsack decision problem (MDCS), are presented for the interactive knapsack models.
openaire +2 more sources
The interactive knapsack problems are generalizations of the classical knapsack problem. Three different new NP-complete problems, interactive knapsack heuristic decision problem (IKHD), interactive knapsack decision problem (IKD) and multidimensional cloned knapsack decision problem (MDCS), are presented for the interactive knapsack models.
openaire +2 more sources
A knapsack cryptosystem based on multiple knapsacks
2010 International Symposium On Information Theory & Its Applications, 2010In this paper, we propose a knapsack cryptosystem based on three knapsacks. Although one of the three secret knapsacks is superincreasing, the other two are non-superincreasing. On the encryption, a ciphertext is formed by multiplying the two non-superincreasing knapsacks together and then adding it to the superincreasing knapsack.
Kunikatsu Kobayashi +3 more
openaire +1 more source
Operations Research, 1980
We consider a class of algorithms which use the combined powers of branch-and-bound, dynamic programming and rudimentary divisibility arguments for solving the zero-one knapsack problem. Our main result identifies a class of instances of the problem which are difficult to solve by such algorithms.
openaire +1 more source
We consider a class of algorithms which use the combined powers of branch-and-bound, dynamic programming and rudimentary divisibility arguments for solving the zero-one knapsack problem. Our main result identifies a class of instances of the problem which are difficult to solve by such algorithms.
openaire +1 more source
Classical knapsack to geometric knapsack: A journey
2011 3rd International Conference on Electronics Computer Technology, 2011Knapsack problems have been extensively studied in operations research for last few decades. We review the method of mapping classical knapsack problems into a new class of geometric knapsack problems. Then it is shown that a wide class of problems in geometric optimization and facility location can be represented as geometric knapsack problems.
openaire +1 more source
Theory of Computing Systems, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Markus Lohrey, Georg Zetzsche
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Markus Lohrey, Georg Zetzsche
openaire +2 more sources
Bayesian optimal knapsack procurement
European Journal of Operational Research, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ensthaler, Ludwig, Giebe, Thomas
openaire +1 more source
The Sequential Knapsack Polytope
SIAM Journal on Optimization, 1998Summary: We describe the convex hull of all solutions of the integer bounded knapsack problem in the special case when the weights of the items are divisible. The corresponding inequalities are defined via an inductive scheme that can also be used in a more general setting.
Pochet, Y., Weismantel, R.
openaire +1 more source
Fundamenta Informaticae, 1999
This paper is a cryptographically motivated study of the knapsack, its subset sum function and its inverse relation, the decipherment function. The novelty is that the subset sum function is not assumed to be injective. Instead, various forms of “jectivity” are introduced, distinguished by the amount of subsets that are allowed to have the same sum ...
openaire +2 more sources
This paper is a cryptographically motivated study of the knapsack, its subset sum function and its inverse relation, the decipherment function. The novelty is that the subset sum function is not assumed to be injective. Instead, various forms of “jectivity” are introduced, distinguished by the amount of subsets that are allowed to have the same sum ...
openaire +2 more sources