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 “"Rectangle Packing"”.

  1. Embeddings for Disjunctive Programs with Applications to Political Districting and Rectangle Packing

    … binary linear programs and applies it to several rectangle packing formulations. These include both existing and novel formulations for the underlying disjunctive program. Additionally, we investigate the poor performance of branch-and-cut on the example problems.

    vt Repository record for Embeddings for Disjunctive Programs with Applications to Political Districting and Rectangle Packing (opens in a new tab)

  2. ALGORITHMS FOR AN INCREMENTAL BIN-PACKING SYSTEM

    … of a software system for the Incremental Rectangle Packing Problem. The general bin-packing problem is the problem of packing a collection of objects (of any dimension) into well-defined regions (called bins) such that they do not overlap, The overall aim is to maximise the utilization of …

    nus Repository record for ALGORITHMS FOR AN INCREMENTAL BIN-PACKING SYSTEM (opens in a new tab) Download file for ALGORITHMS FOR AN INCREMENTAL BIN-PACKING SYSTEM (opens in a new tab)

  3. Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems

    … are approximation algorithms for scheduling and packing, two classical geometrical problems in combinatorial optimization. It is divided into three parts. In the first part we consider a generalization of the strip packing problem or geometrical cutting stock problem. In strip packing a given set …

    cau-kiel Repository record for Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems (opens in a new tab)

  4. Model Order

    … layout decisions. First, I present a rectangle packing algorithm that preserves the reading direction given by the rectangle model order while optimizing readability. Second, I illustrate how model order can be utilized during the different phases of the Sugiyama or layered algorithm …

    cau-kiel Repository record for Model Order (opens in a new tab)

  5. Emerging applications of OR/MS: emergency response planning and production planning in semiconductor and printing industry

    … lithographic printing industry, and (iii) packing/placement problems in chip design in the semiconductor industry. In the first part of the thesis, we study an emergency response planning problem motivated by discussions with the American Red Cross, which has taken on a responsibility to …

    gatech Repository record for Emerging applications of OR/MS: emergency response planning and production planning in semiconductor and printing industry (opens in a new tab)

  6. System-on-chip testing

    … Law for the near future. 3D-ICs achieve higher packing density and higher performance than 2D-ICs and reduce the cost of wiring and power consumption. Recently, the semiconductor companies released products based on 3D-ICs. This research focuses in the development of new TAM architectures and …

    greece Repository record for System-on-chip testing (opens in a new tab)

  7. Approximation Algorithms for Geometric Packing Problems

    … 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 chip, or when …

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

  8. Approximation algorithms for 2d packing problems

    In this thesis we address such 2-dimensional packing problems as strip packing, bin packing and storage packing. These problems play an important role in many application areas, e.g. cutting stock, VLSI design, image processing, and multiprocessor scheduling. The larger part of work is devoted to …

    cau-kiel Repository record for Approximation algorithms for 2d packing problems (opens in a new tab)