results: patients in the case and control groups were similar in age and admission vital signs. during the second operation, the bleeding volumes measured in the case and control groups were 66 ± 27.01 ml and 152 ± 85.4 ml, respectively. there was some pad-induced damage after the removal of the pad in the control group. patients and methods: twenty male patients with grade iv or v liver injuri...

Bin-completion, a bin-oriented branch-and-bound approach, was recently shown to be promising for the bin packing problem. We propose several improvements to bin-completion that significantly improves search efficiency. We also show the generality of bin-completion for packing and covering problems involving multiple containers, and present bin-completion algorithms for the multiple knapsack, bi...

We review several linear programming (LP) formulations for the one-dimensional cutting stock and bin packing problems, namely, the models of Kantorovich, Gilmore–Gomory, onecut models, as in the Dyckhoff–Stadtler approach, position-indexed models, and a model derived from the vehicle routing literature. We analyse some relations between the corresponding LP relaxations, and their relative stren...

Let (M, σ, ψ) be a symplectic-toric manifold of dimension at least four. This paper investigates the symplectic ball packing problem in the toral equivariant setting. We show that the set of toric symplectic ball packings of M admits the structure of a convex polytope. Previous work of the first author shows that up to equivalence, only (CP)2 and CP admit density one packings when n = 2 and onl...

This paper addresses the issue of computing the asymptotic worst-case of lower bounds for the Bin Packing Problem. We introduce a general result that allows to bound the asymptotic worst-case performance of any lower bound for the problem and to derive for the first time the asymptotic worst-case of the well-known bound L3 by Martello and Toth. We also show that the general result allows to eas...

For a positive integer r ≥ 2, a Kr-factor of a graph is a collection vertex-disjoint copies of Kr which covers all the vertices of the given graph. The celebrated theorem of Hajnal and Szemerédi asserts that every graph on n vertices with minimum degree at least (1− 1r )n contains a Kr-factor. In this note, we propose investigating the relation between minimum degree and existence of perfect Kr...

This is an interesting 91 page volume which deals with structural properties of different kinds of epithelia known to transport substances. This monograph starts with some comments about the role which the epithelium plays in the physiology of the animal. Some current concepts about the functional organization of epithelial transport systems in general are discussed in a nonquantitative way. Th...

The problem of on-line bin packing restricted to instances with only two item sizes (known in advance) has a well-known lower bound of 4/3 for its asymptotic competitive ratio. We present an algorithm which shows that this lower bound is also an upper bound. Hence the asymptotic competitive ratio for this on-line problem is equal to 4/3. Our result extends the corresponding result of Faigle, Ke...

This paper considers variants of the one-dimensional bin packing (and stock cutting) problem in which both the ordering and orientation of items in a container influences the validity and quality of a solution. Two new real-world problems of this type are introduced, the first that involves the creation of wooden trapezoidal-shaped trusses for use in the roofing industry, the second that requir...

There appear to be two versions of the Dual Bin Packing problem in the literature. In addition, one of the versions has a counterpart in the cutting stock literature, known as the Skiving Stock Problem. This paper outlines branch-andprice algorithms for both. We introduce combinatorial upper bounds and well-performing heuristics from the literature in the branch-and-price framework. Extensive c...