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 9 of 9 for “"Knapsack problem (Mathematics)"”.

  1. 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 …

    utc Repository record for Robust optimization of linear optimization problems and an approximation approach to solve robust Knapsack Problem (opens in a new tab)

  2. 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, …

    oklahoma-thes Repository record for Knapsack Problems; Methods, Models and Applications (opens in a new tab)

  3. 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, …

    oklahoma-thes Repository record for Knapsack Problems; Methods, Models and Applications (opens in a new tab)

  4. 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 …

    lethbridge Repository record for Approximation algorithms for minimum knapsack problem (opens in a new tab)

  5. Lower bounds for integer programming problems

    Solving real world problems with mixed integer programming (MIP) involves efforts in modeling and efficient algorithms. To solve a minimization MIP problem, a lower bound is needed in a branch-and-bound algorithm to evaluate the quality of a feasible solution and to improve the efficiency of the …

    gatech Repository record for Lower bounds for integer programming problems (opens in a new tab)

  6. Single-row mixed-integer programs: theory and computations

    Single-row mixed-integer programming (MIP) problems have been studied thoroughly under many different perspectives over the years. While not many practical applications can be modeled as a single-row MIP, their importance lies in the fact that they are simple, natural and very useful relaxations of …

    gatech Repository record for Single-row mixed-integer programs: theory and computations (opens in a new tab)

  7. A multi-objective stochastic approach to combinatorial technology space exploration

    … explore the combinatorial technology space. A knapsack problem was selected as a benchmark problem to test-run various algorithms and techniques of POST. A Monte Carlo simulation using the surrogate models was used for uncertainty quantification. The concepts of graph theory were used to model …

    gatech Repository record for A multi-objective stochastic approach to combinatorial technology space exploration (opens in a new tab)

  8. Large scale group network optimization

    Every knapsack problem may be relaxed to a cyclic group problem. In 1969, Gomory found the subadditive characterization of facets of the master cyclic group problem. We simplify the subadditive relations by the substitution of complementarities and discover a minimal representation of the …

    gatech Repository record for Large scale group network optimization (opens in a new tab)