Packing circular-like objects in a rectangular container
From MaRDI portal
Publication:499146
DOI10.1134/S1064230715020070zbMath1327.93121MaRDI QIDQ499146
L. Ozuna, Igor S. Litvinchev, Luis Infante
Publication date: 30 September 2015
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Related Items
Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting, Decomposition Algorithm for Irregular Placement Problems, Packing Convex 3D Objects with Special Geometric and Balancing Conditions, Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem, Proportional packing of circles in a circular container, The concept of modeling packing and covering problems using modern computational geometry software, Optimized packing multidimensional hyperspheres: a unified approach, Optimized filling of a given cuboid with spherical powders for additive manufacturing, A support tool for planning classrooms considering social distancing between students, Parallel computing technologies for solving optimization problems of geometric design, Packing ellipsoids in an optimized cylinder, Packing ellipses in an optimized convex polygon, Irregular packing problems: a review of mathematical models, Optimized packing clusters of objects in a rectangular container, On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container, Optimized ellipse packings in regular polygons
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving the circular open dimension problem by using separate beams and look-ahead strategies
- Packing unequal circles using formulation space search
- A literature review on circle and sphere packing problems: models and methodologies
- A heuristic for the circle packing problem with a variety of containers
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Packing different-sized circles into a rectangular container
- Integrated container loading software for pulp and paper industry
- Transportation problems with a minimax criterion
- Open transportation models with a minimax criterion.
- Integer programming formulations for approximate packing circles in a rectangular container
- Closed transportation models with minimax criterion
- Network models with fixed parameters at the communication nodes. II
- Network models with fixed parameters at the communication nodes. I
- Optimization of schedules with precedence logical conditions
- Studying properties of Lagrangian bounds for many-to-many assignment problems
- Iterative functional modification method for solving a transportation problem
- Iterative method for the transportation problem with additional supply and consumption points and quadratic cost
- Network optimization and problems with coupling variables
- Linear models for the approximate solution of the problem of packing equal circles into a given domain
- Reconstructing 2-complexes by a nonnegative integer-valued vector
- Hereditarily minimax matrices in models of transportation type
- The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Packing congruent spheres into a multi‐connected polyhedral domain
- Cylinder packing by simulated annealing
- Multiple Container Packing: A Case Study of Pipe Packing
- Solving Non-standard Packing Problems by Global Optimization and Heuristics
