Related papers: Fully Automatic Trunk Packing with Free Placements
A common problem in the optimization of structures is the handling of uncertainties in the parameters. If the parameters appear in the constraints, the uncertainties can lead to an infinite number of constraints. Usually the constraints…
This paper presents an algorithm to maximize the volume of an affine slice through a given semialgebraic set. This slice-volume task is formulated as an infinite-dimensional linear program in continuous functions, inspired by prior work in…
New methods for finding submatrices of (locally) maximal volume and large projective volume are proposed and studied. Detailed analysis is also carried out for existing methods. The effectiveness of the new methods is shown in the…
The randomized block Kaczmarz (RBK) method is a widely utilized iterative scheme for solving large-scale linear systems. However, the theoretical analysis and practical effectiveness of this method heavily rely on a good row paving of the…
Purpose: Traffic volume in empty container depots has been highly volatile due to external factors. Forecasting the expected container truck traffic along with having a dynamic module to foresee the future workload plays a critical role in…
In this letter, we introduce a novel message-passing algorithm for a class of problems which can be mathematically understood as estimating volume-related properties of random polytopes. Unlike the usual approach consisting in approximating…
The computational cost in evaluation of the volume of a body using numerical integration grows exponentially with dimension of the space $n$. The most generally applicable algorithms for estimating $n$-volumes and integrals are based on…
Semi-Lagrangian (SL) schemes are known as a major numerical tool for solving transport equations with many advantages and have been widely deployed in the fields of computational fluid dynamics, plasma physics modeling, numerical weather…
A Gaussian elimination algorithm is presented that reveals the numerical rank of a matrix by yielding small entries in the Schur complement. The algorithm uses the maximum volume concept to find a square nonsingular submatrix of maximum…
Trusses are load-carrying light-weight structures consisting of bars connected at joints ubiquitously applied in a variety of engineering scenarios. Designing optimal trusses that satisfy functional specifications with a minimal amount of…
Random packings and their properties are a popular and active field of research. Numerical algorithms that can efficiently generate them are useful tools in their study. This paper focuses on random packings produced according to the random…
The maximum volume $j$-simplex problem asks to compute the $j$-dimensional simplex of maximum volume inside the convex hull of a given set of $n$ points in $\mathbb{Q}^d$. We give a deterministic approximation algorithm for this problem…
Many hard problems in the computational sciences are equivalent to counting the leaves of a decision tree, or, more generally, summing a cost function over the nodes. These problems include calculating the permanent of a matrix, finding the…
In this paper, we present a disassemble-and-pack approach for a mechanism to seek a box which contains total mechanical parts with high space utilization. Its key feature is that mechanism contains not only geometric shapes but also…
A problem of minimization of delivery and storage costs of a product is considered under constraints on volumes of delivery from each of the suppliers. It is required to determine optimal volumes and times of product shipments. The problem…
Within a logistics supply chain, a large variety of transported goods need to be handled, recognized and checked at many different network points. Often, huge manual effort is involved in recognizing or verifying packet identity or…
In this work, geometry optimization of mechanical truss using computer-aided finite element analysis is presented. The shape of the truss is a dominant factor in determining the capacity of load it can bear. At a given parameter space, our…
We present an efficient algorithm to reduce the size of nondeterministic Buchi word automata, while retaining their language. Additionally, we describe methods to solve PSPACE-complete automata problems like universality, equivalence and…
Given a basic compact semi-algebraic set $\K\subset\R^n$, we introduce a methodology that generates a sequence converging to the volume of $\K$. This sequence is obtained from optimal values of a hierarchy of either semidefinite or linear…
Bin packing problem examines the minimum number of identical bins needed to pack a set of items of various weights. This problem arises in various areas of the artificial intelligence demanding derivation of the exact solutions in the…