Numerical optimization method for packing regular convex polygons
DOI10.1134/S0965542516080066zbMath1361.65039MaRDI QIDQ519665
Sh. I. Galiev, Maria S. Lisafina
Publication date: 5 April 2017
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
algorithmpacking problemlinear programming problemnumerical algorithmnumerical resultpacking of polygons in a given domainpacking of regular convex polygonspolygon packing
Numerical mathematical programming methods (65K05) Linear programming (90C05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Related Items (1)
Cites Work
- Mathematical programming algorithms for bin packing problems with item fragmentation
- A heuristic approach for packing identical rectangles in convex regions
- A new heuristic algorithm for rectangle packing
- Optimal packing and covering in the plane are NP-complete
- On the complexity of asymptotically optimal coverings and packings
- Two-dimensional packing problems: a survey
- LP models for bin packing and cutting stock problems
- \(\Phi\)-functions for complex 2D-objects
- Mathematical model and efficient algorithms for object packing problem
- Linear models for the approximate solution of the problem of packing equal circles into a given domain
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing
- Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain
- A Parallel Genetic Algorithm for Solving the Container Loading Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Using Block Norms for Location Modeling
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Probabilistic analysis of shelf algorithms for strip packing
- Approximate algorithms to pack rectangles into several strips
- Convex Analysis
This page was built for publication: Numerical optimization method for packing regular convex polygons
