Packing circular-like objects in a rectangular container
From MaRDI portal
(Redirected from Publication:499146)
Recommendations
- Integer programming formulations for approximate packing circles in a rectangular container
- Approximate packing: integer programming models, valid inequalities and nesting
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- Proportional packing of circles in a circular container
Cites work
- A heuristic for the circle packing problem with a variety of containers
- A literature review on circle and sphere packing problems: models and methodologies
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Annealing, Cylinder Packing By Simulated
- Closed transportation models with minimax criterion
- Hereditarily minimax matrices in models of transportation type
- scientific article; zbMATH DE number 4201998 (Why is no real title available?)
- scientific article; zbMATH DE number 5654190 (Why is no real title available?)
- scientific article; zbMATH DE number 803930 (Why is no real title available?)
- Integer programming formulations for approximate packing circles in a rectangular container
- Integrated container loading software for pulp and paper industry
- Iterative functional modification method for solving a transportation problem
- Iterative method for the transportation problem with additional supply and consumption points and quadratic cost
- Linear models for the approximate solution of the problem of packing equal circles into a given domain
- Multiple Container Packing: A Case Study of Pipe Packing
- Network models with fixed parameters at the communication nodes. I
- Network models with fixed parameters at the communication nodes. II
- Network optimization and problems with coupling variables
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- Open transportation models with a minimax criterion.
- Optimization of schedules with precedence logical conditions
- Packing congruent spheres into a multi‐connected polyhedral domain
- Packing different-sized circles into a rectangular container
- Packing unequal circles using formulation space search
- Reconstructing 2-complexes by a nonnegative integer-valued vector
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Solving Non-standard Packing Problems by Global Optimization and Heuristics
- Solving the circular open dimension problem by using separate beams and look-ahead strategies
- Studying properties of Lagrangian bounds for many-to-many assignment problems
- The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach
- Transportation problems with a minimax criterion
Cited in
(27)- Cutting circles and polygons from area-minimizing rectangles
- Packing different-sized circles into a rectangular container
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Integer programming formulations for approximate packing circles in a rectangular container
- Best packing of rods into boxes
- 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 rectangles into a fixed size circular container: constructive and metaheuristic search approaches
- 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
- Packing non-identical circles within a rectangle with open length
- Minimizing the object dimensions in circle and sphere packing problems
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
- 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
- Mixed-integer DC programming based algorithms for the circular packing problem
- Proportional packing of circles in a circular container
- The concept of modeling packing and covering problems using modern computational geometry software
- A skyline-based heuristic for orthogonal packing rectangles in a circle
This page was built for publication: Packing circular-like objects in a rectangular container
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499146)
