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 73 for “"knapsack"”.
-
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 …
-
Faster fully polynomial approximation schemes for Knapsack problems
… We develop faster FPTASs for several classes of knapsack problems. In this thesis, we will first survey the relevant literature in FPTASs for knapsack problems. We propose the use of floating point arithmetic rather than the use of geometric rounding in order to simplify analysis. Given a …
-
On not searching for the multiplier in knapsack problems
Includes bibliographical references.
-
Public key cryptography and the zero-one knapsack problem
… the Merkle-Hellman system based on the zero-one knapsack problem is presented. Standard attacks on the zero-one knapsack problem are rejected as too time-consuming. Herlestam's proposed attack is discussed in detail. The results of theoretical examination and computer tests show that it is not …
-
A multiscale approximation algorithm for the cardinality constrained knapsack problem
… algorithm for the cardinality constrained knapsack problem. The algorithm consists of three steps: a rounding and reduction step where a hierarchical representation of the problem data ranging from coarse to fine is generated, a solution step where a coarse solution is computed, and a …
-
Applying tree knapsack approaches to general network design : a case study
… application in this class of problems is the knapsack problem that arises in different contexts such as loading containers in aircraft or satisfying the demand for various lengths of cloth which must be cut from fixed length bolts of fabric. In this study, the feasibility of representing a …
-
Generating cutting planes through inequality merging on multiple variables in knapsack problems
… A commonly studied integer program is the knapsack problem, which has applications including project and portfolio selection, production planning, inventory problems, profit maximization applications and machine scheduling. Integer programs are computationally difficult and currently …
-
Solving Single and Multiple Plant Sourcing Problems with a Multidimensional Knapsack Model
… problem and modeled as a multidimensional knapsack problem (MKP). The insourcing model is extended to address outsourcing and multiple plants. This multi-plant model, also modeled as an MKP, enables the movement of parts from one plant to another and consideration of a company-wide …
-
A Stochastic Approach to Modeling Aviation Security Problems Using the KNAPSACK Problem
Designers, operators, and users of multiple-device, access control security systems are challenged by the false alarm, false clear tradeoff. Given a particular access control security system, and a prespecified false clear standard, there is an optimal (minimal) false alarm rate that can be …
-
Dynamic-programming approaches to single-and multi-stage stochastic knapsack problems for portfolio optimization
… single-stage and multi-stage integer stochastic knapsack problems. These problems model stochastic portfolio optimization problems (SPOPs) which assume deterministic unit weight, and normally distributed unit return with known mean and variance for each item type. Given an initial wealth, the …
-
An Efficient Knapsack-Based Approach for Calculating the Worst-Case Demand of AVR Tasks
… transforming the problem into a variant of the knapsack problem. We then propose a framework to systematically narrow down the search space associated with finding the worst-case demand of AVR tasks. Experimental results show that our approach is at least 10 times faster, with an average runtime …
-
Robust optimization of linear optimization problems and an approximation approach to solve robust Knapsack Problem
… of items whose total weight does not exceed the knapsack capacity, and whose profit is a maximum. In the robust KP the goal is to find a subset of items whose total weight does not exceed the knapsack capacity, and remains near maximum for the worst scenario. Solving the robust KP exactly is …
-
Two issues in public key cryptography : RSA bit security and a new knapsack type system
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 1985
-
Polyhedra Study of Mixed Integer Programs With Variable Upper Bounds
… Then we consider projections of this set to knapsack cover and to the single binary variable polytope. We present the result of sequence independent lifting of the knapsack cover inequality and obtain lifting some coefficients for sequence dependent lifting with for specific sequences. We …
-
Optimization of CPG budgets in Retailer-led marketing programs
… relevance to customers. This thesis explores how knapsack problems can be used in an non-adaptive setting to help maximize the reach of print and email campaigns. Seeking inspiration from existing literature, multiple simulations were set up to evaluate budget-constrained allocation and compare …
-
A proposal for an improved version of EigenAnt algorithm with performance evaluation on combinatorial optimization problems
… Improved EigenAnt algorithm to Multidimensional Knapsack Problems is investigated, by modeling these problems as an N-node Binary Chain shortest path problems with constraints. Local pheromone evaporation and fast convergence features of the EigenAnt algorithm are advantageous for tracking the …
-
The polyhedral structure of certain combinatorial optimization problems with application to a naval defense problem
… the generalized upper bounding (GUS) constrained knapsack problem, the set partitioning problem, and the quadratic zero-one programming problem, and applies related techniques to solve a practical combinatorial naval defense problem. In Part I of this research effort, we present new results on the …
-
An Integrated Real-Time and Security Scheduling Framework for CPS
… subject to schedulability, into a variant of the knapsack problem. To make this approach more practical, we implement a fully polynomial time approximation scheme (FPTAS) that reduces the time complexity of solving the knapsack problem from a pseudo-polynomial to a fully polynomial. We also …
-
Xqx Based Modeling For General Integer Programming Problems
… literature survey on the 0-1 multidimensional knapsack problem (MDKP) and apply our XQX model using our simple heuristic procedure to solve benchmark problems. The 0-1 MDKP is a binary IP problem with inequality con- straints and variables with binary values. We apply our XQX model using a …
Page 1 of 4