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 11 of 11 for “"Multidimensional Knapsack Problem"”.

  1. Packing in two and three dimensions

    This dissertation investigates Multidimensional Packing Problems (MD-PPs): the Pallet Loading Problem (PLP), the Multidimensional Knapsack Problem (MD-KP), and the Multidimensional Bin Packing Problem (MD-BPP). In these problems, there is a set of items, with rectangular dimensions, and a set of …

    nps Repository record for Packing in two and three dimensions (opens in a new tab)

  2. MOSCA/D: algoritmos científicos multiobjetivo baseados em decomposição

    … research to solve multi-objective optimization problems. MOSCA/D uses the concept of theme to direct the computational effort of the search to promising regions of the objective space, fixing different decision variables in each iteration. A probabilistic model based on the TF-IDF statistic …

    brazil-ufrn Repository record for MOSCA/D: algoritmos científicos multiobjetivo baseados em decomposição (opens in a new tab)

  3. Xqx Based Modeling For General Integer Programming Problems

    … way to model general integer programming (IP) problems with in- equality and equality constraints using XQX. We begin with the definition of IP problems folloby their practical applications, and then present the existing XQX based models to handle such problems. We then present our XQX model …

    mississippi Repository record for Xqx Based Modeling For General Integer Programming Problems (opens in a new tab)

  4. On Algorithms for Multidimensional Packing Problems and on the Complexity of higher dimensional Knapsack

    … half we consider a range of so called online problems. In an online setting we are not given all informations of our input instance immediately. Instead we receive informations over time and algorithms have to handle not only the given instance at a specific time, but also the lack of …

    cau-kiel Repository record for On Algorithms for Multidimensional Packing Problems and on the Complexity of higher dimensional Knapsack (opens in a new tab)

  5. Approximate extended formulations for multidimensional knapsack and the unsplittable flow problem on trees

    In this thesis, we study the Multidimensional Knapsack Problem (MKP) and two closely related special cases: the Unsplittable Flow Problem on Trees (UFPT), and the Unsplittable Flow Problem on Paths (UFPP). For these problems, when the natural integer programming formulation is relaxed to a linear …

    ubc Repository record for Approximate extended formulations for multidimensional knapsack and the unsplittable flow problem on trees (opens in a new tab) Download PDF for Approximate extended formulations for multidimensional knapsack and the unsplittable flow problem on trees (opens in a new tab)

  6. Solving Single and Multiple Plant Sourcing Problems with a Multidimensional Knapsack Model

    … assets. The study begins with a single-plant problem, in which one facility chooses, from a list of parts, which parts to bring in-house. The selection is based on maximizing the value of the selected parts, while remaining within the plant's capacity. This problem is defined as the insourcing …

    vt Repository record for Solving Single and Multiple Plant Sourcing Problems with a Multidimensional Knapsack Model (opens in a new tab)

  7. Resource allocation for OFDM-based cognitive radio systems

    … sharing, and formulate a corresponding multidimensional knapsack problem (MDKP). Low-complexity suboptimal RA algorithms are proposed for both single and multiple CRU systems. A simplified model is proposed which provides a faster suboptimal solution. Simulation results show that the …

    ubc Repository record for Resource allocation for OFDM-based cognitive radio systems (opens in a new tab) Download PDF for Resource allocation for OFDM-based cognitive radio systems (opens in a new tab)

  8. Study of knapsack-based admission and allocation techniques

    … whether a particular resource allocation problem can be cast in the mathematical formu-lation we are exploring. We also need to decide which mechanism will be used, or if a new one needs to be constructed to solve the particular formulation. Finally, we need to evaluate whether the …

    uvic Repository record for Study of knapsack-based admission and allocation techniques (opens in a new tab)

  9. Incorporating Memory and Learning Mechanisms Into Meta-RaPS

    … of dimensions and complexity of real life problems, it has become more difficult to find optimal solutions using only exact mathematical methods. The need to find near-optimal solutions in an acceptable amount of time is a challenge when developing more sophisticated approaches. A proper …

    odu Repository record for Incorporating Memory and Learning Mechanisms Into Meta-RaPS (opens in a new tab)

  10. REDES DE PROCESADORES GENÉTICOS

    … work at a theoretical level or to solve decision problems. To work on a more practical level such as solving optimization problems, we propose a new type of network, Networks of Genetic processors as Parallel Genetic Algorithms, inspired by the Parallel Genetic Algorithms. In this work we prove …

    upv Repository record for REDES DE PROCESADORES GENÉTICOS (opens in a new tab)