Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 318 for “"knapsack"”.
-
Evolutions in Knapsack Cryptology
The Knapsack Decision Problem and its related sub-problems have undergone much study in the interest of creating secure and competitive cryptographic primitives. Following a number of failed attempts, including the historic Merkle-Hellman public key cryptosystem of 1978, the question remains …
-
Knapsack Problems with Side Constraints
… problems in Combinatorial Optimization: the Knapsack Problems. These are paradigmatic NP-hard problems where a set of items with given profits and weights is available. The aim is to select a subset of the items in order to maximize the total profit without exceeding a known knapsack …
-
Parallel Knapsack Algorithms on Multicore Architectures
… of parallel implementations of the integral knapsack problem on multicore architectures. The study considers two algorithms and their parallel implementations, and examines several aspects of performance including speedup and scalability.
-
The 0 -1 multiple knapsack problem
In operation research, the Multiple Knapsack Problem (MKP) is classified as a combinatorial optimization problem. It is a particular case of the Generalized Assignment Problem. The MKP has been applied to many applications in naval as well as financial management. There are several methods to solve …
-
Knapsack Problems; Methods, Models and Applications
Knapsack problem (KP) has broad applications in different fields such as machine scheduling, space allocation, and asset optimization. Meanwhile, it is a hard problem due to its computational complexity, but numerous solution approaches have been developed for a variety of KP. In this dissertation, …
-
Knapsack Problems; Methods, Models and Applications
Knapsack problem (KP) has broad applications in different fields such as machine scheduling, space allocation, and asset optimization. Meanwhile, it is a hard problem due to its computational complexity, but numerous solution approaches have been developed for a variety of KP. In this dissertation, …
-
Programacion lineal entera. El problema knapsack
… lineales enteros y en particular del problema Knapsack. Se proponen dos algoritmos de emimevación implícita para el problema Knapsack y otros dos para problemas lineales enteros acotados. En todos ellos la emimeración se realiza de forma lexicográficamente ordenada proporcionándose un algoritmo …
-
Approximation algorithms for minimum knapsack problem
Knapsack problem has been widely studied in computer science for years. There exist several variants of the problem, with zero-one maximum knapsack in one dimension being the simplest one. In this thesis we study several existing approximation algorithms for the minimization version of the problem …
-
The unbounded knapsack problem : a critical review
… and datasets in the literature of the Unbounded Knapsack Problem (UKP) is presented in this master's thesis. The algorithms and datasets used are brie y described in this work to provide the reader with basis for understanding the discussions. Some well-known UKP-speci c properties, such as …
-
Indefinite Knapsack Separable Quadratic Programming: Methods and Applications
… been developed to solve QP by a sub-problem, knapsack separable QP (KSQP), which has a separable objective function and is constrained by a single knapsack linear constraint and box constraints.</p> <p>KSQP can therefore be considered as a fundamental building-block to solve the general QP and …
-
Study of knapsack-based admission and allocation techniques
… known as the Multichoice Multidimensional Knapsack Problem, or MMKP. We also propose and evaluate resource allocation techniques on two other sys¬tems: a cellular network and a Grid computing system; in this regard, the resource alloca¬tion problem is not expressed as an MMKP, although the …
-
A complementary heuristic for the unbounded knapsack problem
As a solution algorithm for Unbounded Knapsack Problem, the performance analysis of density-ordered greedy heuristic, weight-ordered greedy heuristic, value-ordered greedy heuristic, extended greedy heuristic and total-value heuristic has been done. Empirical experiments on different test problems …
Page 1 of 16