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 3 of 3 for “"geometric packing problems"”.

  1. Approximation Algorithms for Geometric Packing Problems

    … approximation algorithms for two-dimensional, geometric packing problems. We have given a set of rectangles that have to be placed in one or several predetermined target regions. Such packing problems can be found in several branches of industry, for example when placing logic elements on a …

    cau-kiel Repository record for Approximation Algorithms for Geometric Packing Problems (opens in a new tab)

  2. Improved Approximation Algorithms for Geometric Packing Problems With Experimental Evaluation

    Geometric packing problems are NP-complete problems that arise in VLSI design. In this thesis, we present two novel algorithms using dynamic programming to compute exactly the maximum number of k x k squares of unit size that can be packed without overlap into a given n x m grid. The first …

    unt Repository record for Improved Approximation Algorithms for Geometric Packing Problems With Experimental Evaluation (opens in a new tab)

  3. An Optimization Approach to a Geometric Packing Problem

    We investigate several geometric packing problems (derived from an industrial setting) that involve fitting patterns of regularly spaced disks without overlap. We first derive conditions for achieving the feasible placement of a given set of patterns and construct a network formulation that, under …

    clemson Repository record for An Optimization Approach to a Geometric Packing Problem (opens in a new tab)