We consider packing and covering optimization problems over constraints in consecutive and circular 1’s. Such problems arise in the context of shift scheduling, and in problems related to interval graphs. Previous approaches to this problem depended on solving several minimum cost network flow problems. We devise here substantially more efficient and strongly polynomial algorithms based on para...

In the paper stability losses of packer with a girdle construction have been investigated by taking into account compactness mechanism. Expanding and constricting cases conical surface studied, problem has solved via numerical estimation using finite differences method. With this purpose, continuity condition deformation written for (cylindrical packer) added to condition. first approach soluti...

This paper presents a parallel genetic algorithm for three dimensional bin packing with heterogeneous bins using Hadoop Map-Reduce framework. The most common three dimensional bin packing problem which packs given set of boxes into minimum number of equal sized bins is proven to be NP Hard. The variation of three dimensional bin packing problem that allows heterogeneous bin sizes and rotation o...

o b je c t i v e : to explore the pros and cons of early versus delayed intervention when dealing with severe blunt liver injury with significant hemoperitoneum and hemodynamic instability. m e t h o d s : this retrospective cross-sectional study was performed at the nemazi hospital, shiraz, southern iran, level i trauma center affiliated with shiraz university of medical sciences. the study po...

This paper presents a combinational Hybrid Genetic Algorithm (HGA) with packing tuning approach for solving Three Dimensional (3D) Single container arbitrary sized heterogeneous bin packing optimization problem, by considering practical constraints in the shipment container loading industries. Aim of this paper is to (i) pack 3D arbitrary sized heterogeneous bins in to a container. (ii) Improve...

In this paper, we study 1-space bounded multi-dimensional bin packing and hypercube packing. A sequence of items arrive over time, each item is a d-dimensional hyperbox (in bin packing) or hypercube (in hypercube packing), and the length of each side is no more than 1. These items must be packed without overlapping into d-dimensional hypercubes with unit length on each side. In d-dimensional sp...

Product quality for plastic injection molding process is highly related with the settings for its process parameters. Additionally, the product quality is not simply based on a single quality index, but multiple interrelated quality indices. To find the settings for the process parameters such that the multiple quality indices can be simultaneously optimized is becoming a research issue and ...

We extend the concept of packing dimension profiles, due to Falconer and Howroyd (1997) and Howroyd (2001), and use our extension in order to determine the packing dimension of an arbitrary image of a general Lévy process.

An equivalent definition of packing dimension is given for a set in d-dimensional Euclidean space by using its component sets as packings. It is applied to determine the packing dimensions of a class of subsets with prescribed relative group frequencies. c © 2008 Elsevier Ltd. All rights reserved.

Let X = {X(t), t ∈ RN} be a Gaussian random field with values in Rd defined by X(t) = ( X1(t), . . . , Xd(t) ) , ∀ t ∈ R , where X1, . . . , Xd are independent copies of a centered real-valued Gaussian random field X0. We consider the case when X0 is anisotropic and study the packing dimension of the range X(E), where E ⊆ RN is a Borel set. For this purpose we extend the original notion of pack...