We consider a variant of the classical Bin Packing Problem, called Fully Dynamic Bin Packing. In this variant, items of a size in (0,1] must be packed in bins of unit size. In each time step, an item either arrives or departs from the packing. An algorithm for this problem must maintain a feasible packing while only repacking a bounded number of items in each time step. We develop an algorithm ...

This study examined packing (pocketing or holding accepted food in the mouth) in 3 children who were failing to thrive or had inadequate weight gain due to insufficient caloric intake. The results of an analysis of texture indicated that total grams consumed were higher when lower textured foods were presented than when higher textured foods were presented. The gram intake was related directly ...

We study the computational complexity of packing puzzles of identical polyominoes. Packing dominoes (i.e., 1 × 2 rectangles) into grid polygons can be solved in polynomial time by reducing to a bipartite matching problem. On the other hand, packing 2 × 2 squares is known to be NP-complete. In this paper, we fill the gap between dominoes and 2 × 2 squares, that is, we consider the packing puzzle...

This paper presents a Heuristic Genetic Algorithm (HGA) for optimizing two dimensional (2D) arbitrary sized heterogeneous box packing into a container, by considering practical constraints facing in the shipment container loading industries. Objective of this research is to pack heterogeneous boxes of varying length, width and constant height into a container of standard dimension, without viol...

We study the dependence on the packing fraction of the pair-correlation function g(r) and particle mobility in a dense three-dimensional packing of soft colloids made of poly N-isopropyl acrylamide (pNIPAM), a thermosensitive gel. We find that g(r) for our samples is qualitatively like that of a liquid at all packing fractions. There is a peak in g(1), the height of the first peak of g(r), as a...

We survey lower bounds for the variant of the two-dimensional bin packing problem where items cannot be rotated. We prove that the dominance relation claimed by Carlier et al.[5] between their lower bounds and those of Boschetti and Mingozzi [1] is not valid. We analyze the performance of lower bounds from the literature and we provide the results of a computational experiment.

We prove that Best Fit bin packing has linear waste on the discrete distributionU{j, k} (where items are drawn uniformly from the set {1/k, 2/k, · · · , j/k}) for sufficiently large k when j = αk and 0.66 ≤ α < 2/3. Our results extend to continuous skewed distributions, where items are drawn uniformly on [0, a], for 0.66 ≤ a < 2/3. This implies that the expected asymptotic performance ratio of ...

We show that orthogonal space-time block codes may be identified with packings on the Grassmann manifold. We describe a general criterion for packings on the Grassmann manifold that yield coherent space-time constellations with the same code properties that make orthogonal space-time block codes so favorable. As an example, we point out that the rate 3/4 orthogonal space-time block code motivat...

The Cycle Packing problem asks whether a given undirected graph G = (V,E) contains k vertex-disjoint cycles. Since the publication of the classic Erdős-Pósa theorem in 1965, this problem received significant scientific attention in the fields of Graph Theory and Algorithm Design. In particular, this problem is one of the first problems studied in the framework of Parameterized Complexity. The n...

We extend the classical 0-1 knapsack problem by introducing disjunctive constraints for pairs of items which are not allowed to be packed together into the knapsack. These constraints are represented by edges of a conflict graph whose vertices correspond to the items of the knapsack problem. Similar conditions were treated in the literature for bin packing and scheduling problems. For the knaps...