A method of optimal lattice packing of congruent oriented polygons in the plane
type: Item
instance of: scholarly article
title: A method of optimal lattice packing of congruent oriented polygons in the plane
zbMATH Open document ID: 0990.90103
DOI: 10.1016/S0377-2217(99)00115-0
author: Yu. Stoyan
author: V. N. Patsuk
published in: European Journal of Operational Research
publication date: 2000-08-14T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 65D18
zbMATH DE Number: 1491150
zbMATH Keywords: packing
zbMATH Keywords: optimization problem
zbMATH Keywords: lattice packing
MaRDI profile type: Publication
cites work: Q5331777
cites work: A typology of cutting and packing problems
cites work: Q4739659
cites work: Q5824053
cites work: Q4751848
cites work: Q5567096
cites work: Double-lattice packings of convex bodies in the plane
cites work: Compaction and separation algorithms for non-convex polygons and their applications
cites work: Packing and covering the plane with translates of a convex polygon
cites work: Q5568974
cites work: Q4060043
cites work: Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
description: scientific article; zbMATH DE number 1491150