Related papers: The disc random packing problem: a disorder criter…
We present a new method of identifying protostellar disc fragments in a simulation based on density derivatives, and analyse our data using this and the existing CLUMPFIND method, which is based on an ordered search over all particles in…
We consider chance-constrained binary knapsack problems, where the weights of items are independent random variables with the means and standard deviations known. The chance constraint can be reformulated as a second-order cone constraint…
Bin packing is an algorithmic problem that arises in diverse applications such as remnant inventory systems, shipping logistics, and appointment scheduling. In its simplest variant, a sequence of $T$ items (e.g., orders for raw material,…
The problem of packing of equal disks (or circles) into a rectangle is a fundamental geometric problem. (By a packing here we mean an arrangement of disks in a rectangle without overlapping.) We consider the following algorithmic…
We study dense packings of a large number of congruent non-overlapping circles inside a square by looking for configurations which maximize the packing density, defined as the ratio between the area occupied by the disks and the area of the…
The set of 2-dimensional packing problems builds an important class of optimization problems and Strip Packing together with 2-dimensional Bin Packing and 2-dimensional Knapsack is one of the most famous of these problems. Given a set of…
The problem of image data generation in computer vision has traditionally been a harder problem to solve, than discriminative problems. Such data generation entails placing relevant objects of appropriate sizes each, at meaningful location…
Column-sparse packing problems arise in several contexts in both deterministic and stochastic discrete optimization. We present two unifying ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain improved approximation…
The average distance of the equal hard spheres is introduced to evaluate the density of a given arrangement. The absolute smallest value is two radii because the spheres can not be closer to each other than their diameter. The absolute…
We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…
Packings of regular convex polygons ($n$-gons) that are sufficiently dense have been studied extensively in the context of modeling physical and biological systems as well as discrete and computational geometry. Former results were mainly…
Computer simulation was used to study the random sequential adsorption of identical discorectangles onto a continuous plane . The problem was analyzed for a wide range of discorectangle aspect ratios ($\varepsilon \in [1;100]$). We studied…
How, in principle, could one solve the atomic structure of a quasicrystal, modeled as a random tiling decorated by atoms, and what techniques are available to do it? One path is to solve the phase problem first, obtaining the density in a…
Microscopy research often requires recovering particle-size distributions in three dimensions from only a few (10 - 200) profile measurements in the section. This problem is especially relevant for petrographic and mineralogical studies,…
A disc packing in the plane is compact if its contact graph is a triangulation. There are $9$ values of $r$ such that a compact packing by discs of radii $1$ and $r$ exists. We prove, for each of these $9$ values, that the maximal density…
Clustering is a widely used unsupervised learning method for finding structure in the data. However, the resulting clusters are typically presented without any guarantees on their robustness; slightly changing the used data sample or…
This paper presents theoretical and practical results for the bin packing problem with scenarios, a generalization of the classical bin packing problem which considers the presence of uncertain scenarios, of which only one is realized. For…
The pinwheel problem is a real-time scheduling problem that asks, given $n$ tasks with periods $a_i \in \mathbb{N}$, whether it is possible to infinitely schedule the tasks, one per time unit, such that every task $i$ is scheduled in every…
The note studies the problem of selecting a good enough subset out of a finite number of alternatives under a fixed simulation budget. Our work aims to maximize the posterior probability of correctly selecting a good subset. We formulate…
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…