Related papers: Miscellaneous problems about packing and covering
We list a number of problems in several topics related to compactness in nonseparable Banach spaces. Namely, about the Hilbertian ball in its weak topology, spaces of continuous functions on Eberlein compacta, WCG Banach spaces, Valdivia…
Clumsy packing is considered an inefficient packing, meaning we find the minimum number of objects we can pack into a space so that we can not pack any more object. Thus we are effectively spacing out the objects as far apart as possible so…
One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…
We survey the main formulations and solution methods for two-dimensional orthogonal cutting and packing problems, where both items and bins are rectangles. We focus on exact methods and relaxations for the four main problems from the…
In this paper we study some cube packing problems. In particular we are interested in compact subsets of $\mathbb{R}^n,n\geq 2$, which contain boundaries of cubes with all side lengths in $(0,1)$. We show here that such sets must have lower…
Optimal geometrical arrangements, such as the stacking of atoms, are of relevance in diverse disciplines. A classic problem is the determination of the optimal arrangement of spheres in three dimensions in order to achieve the highest…
This paper introduces the Packing While Traveling problem as a new non-linear knapsack problem. Given are a set of cities that have a set of items of distinct profits and weights and a vehicle that may collect the items when visiting all…
Many packing, scheduling and covering problems that were previously considered by computer science literature in the context of various transportation and production problems, appear also suitable for describing and modeling various…
The paper described a generalized integrated glance to bin packing problems including a brief literature survey and some new problem formulations for the cases of multiset estimates of items. A new systemic viewpoint to bin packing problems…
A packing by a body $K$ is collection of congruent copies of $K$ (in either Euclidean or hyperbolic space) so that no two copies intersect nontrivially in their interiors. A covering by $K$ is a collection of congruent copies of $K$ such…
We study a class of geometric covering and packing problems for bounded regions on the plane. We are given a set of axis-parallel line segments that induces a planar subdivision with a set of bounded (rectilinear) faces. We are interested…
Lattice coverings in the real plane by Minkowski balls are studied. We exploit the duality of admissible lattices of Minkowski balls and inscribed convex symmetric hexagons of these balls. An explicit moduli space of the areas of these…
This paper introduces a general modeling framework for a multi-type maximal covering location problem in which the position of facilities in different metric spaces are simultaneously decided to maximize the demand generated by a set of…
Packing problems have been a source of fascination for millenia and their study has produced a rich literature that spans numerous disciplines. Investigations of hard-particle packing models have provided basic insights into the structure…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is…
We begin the study of the consequences of the existence of certain infinite matrices. Our present application is to compactness of products of topological spaces.
We analyze the general problem of determining optimally dense packings, in a Euclidean or hyperbolic space, of congruent copies of some fixed finite set of bodies. We are strongly guided by examples of aperiodic tilings in Euclidean space…
We discuss the notions of circumradius, inradius, diameter, and minimum width in generalized Minkowski spaces (that is, with respect to gauges), i.e., we measure the "size" of a given convex set in a finite-dimensional real vector space…
We study several consequences of the packing problem, a conjecture from combinatorial optimization, using algebraic invariants of square-free monomial ideals. While the packing problem is currently unresolved, we successfully settle the…
We consider the problem of covering $\mathbb{Z}^2$ with a finite number of sublattices of finite index, satisfying a simple minimality or non-degeneracy condition. We show how this problem may be viewed as a projective (or homogeneous)…