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 “"Packing problems"”.
-
Coloring and Packing Problems for D-Degenerate Graphs
Then, we consider packing problems for d-degenerate graphs. Two graphs G1 and G 2 pack if G1 is a subgraph of the complement G¯2 of G 2. We disprove one of the conjecture of Bollobas and Eldridge and prove an extension of their other conjecture. We also show that other than maximum degrees, …
-
Covering and packing problems on graphs and hypergraphs
Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2013-08-27T10:00:22Z Item was in collections: University of Illinois Dissertations and Theses (ID: 204) Dissertations and Theses - Mathematics (ID: 749) No. of bitstreams: 3 Stocker_Christopher.pdf.txt: 236192 bytes, checksum: …
-
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 …
-
Load Mixing to Improve Container Utilization
… needed.</p> <p>Load mixing is similar to other packing problems such as the knapsack and container loading problems. However, traditional packing problems typically only assume a single type of capacity (e.g., weight), whereas load mixing must simultaneously the weight and spatial capacities to …
-
Infinite staircases for Hirzebruch surfaces
… function is a generalization of symplectic ball packing problems. For a symplectic manifold, the function gives the smallest amount of which the symplectic form must be scaled in order for a standard ellipsoid of a given eccentricity to embed symplectically into the manifold. Generally, there are …
-
Computational experiments for local search algorithms for binary and mixed integer optimization
… dense instances of both set covering and set packing problems.
-
Approximation algorithms for packing and scheduling problems
… we consider three combinatorial optimization problems. Specifically, we study packing and scheduling questions of relevance in several areas of operations research, including interconnection networks and switch scheduling, VLSI design, and processor scheduling. The first chapter studies a …
-
Some applications of continuous variable neighbourhood search metaheuristic (mathematical modelling)
In the real world, many problems are continuous in nature. In some cases, finding the global solutions for these problems is di±cult. The reason is that the problem's objective function is non convex, nor concave and even not differentiable. Tackling these problems is often computationally too …
-
Problems, Models and Algorithms in One- and Two-Dimensional Cutting
… Mathematics and Operations Research, problems of cutting and packing (C&P) of concrete and abstract objects appear under various specifications (cutting problems, knapsack problems, container and vehicle loading problems, pallet loading, bin packing, assembly line balancing, …
-
Combinatorial optimisation for sustainable cloud computing
… problem suitable for modeling core consolidation problems arising in workload management in data centres. This problem extends on the well-known bin packing problem. We develop competing models and optimisation techniques to solve this offline packing problem with state-of-the-art solvers. We then …
-
The conditioning of confectionery products
… are to reduce stickiness which causes packing problems, allow the samples to strengthen so that they can resist mechanical handling without deformation, and to prevent the sweating of the confectionery after packing. Although conditioning appears to reduce these problems, it does not …