Optimal clustering of a pair of irregular objects
type: Item
instance of: scholarly article
title: Optimal clustering of a pair of irregular objects
zbMATH Open document ID: 1310.90096
author: Yanyan Li
published in: Journal of Global Optimization
publication date: 2015-03-24T00:00:00Z
full work available at URL: JGO optimal clusters final.pdf
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6419111
zbMATH Keywords: minimum containment
zbMATH Keywords: irregular shapes
zbMATH Keywords: cutting and packing
zbMATH Keywords: mathematical modeling
zbMATH Keywords: optimisation
describes a project that uses: Ipopt
MaRDI profile type: Publication
OpenAlex ID: W2088154686
cites work: Polygon placement under translation and rotation
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
cites work: The geometry of nesting problems: a tutorial
cites work: A tutorial in irregular shape packing problems
cites work: Tools of mathematical modeling of arbitrary object packing problems
cites work: Q3494643
cites work: Irregular Packing Using the Line and Arc No-Fit Polygon
cites work: The complexity of cutting complexes
cites work: Mathematical model and efficient algorithms for object packing problem
cites work: Phi-functions for 2D objects formed by line segments and circular arcs
cites work: Hardness of approximation for orthogonal rectangle packing and covering problems
cites work: Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
cites work: Solution approaches to irregular nesting problems
cites work: Containment of a single polygon using mathematical programming
cites work: A new algorithm for the two-polygon containment problem
cites work: A new algorithm for the minimal-area convex enclosure problem
cites work: Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
cites work: Cutting circles and polygons from area-minimizing rectangles
cites work: Multiple translational containment. II: Exact algorithms
cites work: Rotational polygon containment and minimum enclosure using only robust 2D constructions
cites work: Rotational polygon overlap minimization and compaction
cites work: TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS
cites work: An improved typology of cutting and packing problems
DOI: 10.1007/S10898-014-0192-0
description: scientific article; zbMATH DE number 6419111