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

  1. On Quadratic Knapsack Limiting and Enforcing a Cell Entropy Inequality

    … to enforce such an inequality is through knapsack limiting, which solves a knapsack problem to determine an optimal set of blending coefficients which result in a semi-discrete cell entropy inequality while preserving nodal bounds. In this work, we provide a slight modification of this …

    rice Repository record for On Quadratic Knapsack Limiting and Enforcing a Cell Entropy Inequality (opens in a new tab)

  2. Relaxações convexas e desigualdades válidas para o problema da mochila quadrático binário

    We consider a parametric convex quadratic programming, CQP, relaxation for the quadratic knapsack problem, QKP. This relaxation maintains partial quadratic information from the original QKP by perturbing the objective function to obtain a concave quadratic term. The nonconcave part generated by the …

    brazil-uerj Repository record for Relaxações convexas e desigualdades válidas para o problema da mochila quadrático binário (opens in a new tab)

  3. Quantum Annealing: Research and Applications

    … is to solve hard computational optimization problems. Because these optimization problems are in the NP-Hard complexity class, they are of great interest in several fields. One of the leading open questions concerning quantum annealers asks whether they will outperform other classical methods …

    waterloo Repository record for Quantum Annealing: Research and Applications (opens in a new tab)

  4. Hybrid Exact Methods for Solving Strictly Convex Integer Quadratic Programs

    The strictly convex integer quadratically constrained problem (IQCP) is an important class of optimization problem that arises in numerous applications both in theoretical science and industry. Due to its NP-hard nature, common exact methods are typically tree search algorithms with various …

    toronto-retro Repository record for Hybrid Exact Methods for Solving Strictly Convex Integer Quadratic Programs (opens in a new tab)

  5. A combinatorial approach to RNA sequence-structure alignments

    … or near-optimal solutions for the original problem. In a subsequent step, we augment the initial model with stacking energies. Stacking base pairs greatly contribute to the energetic stability of the overall structure and should therefore be additionally rewarded. We extend the original ILP …

    fu-berlin Repository record for A combinatorial approach to RNA sequence-structure alignments (opens in a new tab)

  6. MODULARITY BASED FUZZY COMMUNITY DETECTION IN SOCIAL NETWORKS

    … we call it Fuzzy Modularity Maximization (FMM) problem. The effort on FMM problem results into the major contribution of this thesis, an efficient and effective GM-based fuzzy community detection method that could automatically discover a fuzzy partition of a network when it is appropriate, …

    mtu Repository record for MODULARITY BASED FUZZY COMMUNITY DETECTION IN SOCIAL NETWORKS (opens in a new tab)