Optimal clustering of a pair of irregular objects
From MaRDI portal
Publication:2018508
DOI10.1007/S10898-014-0192-0zbMATH Open1310.90096OpenAlexW2088154686MaRDI QIDQ2018508FDOQ2018508
Publication date: 24 March 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/390813/1/JGO_optimal%2520clusters_final.pdf
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Solution approaches to irregular nesting problems
- Mathematical model and efficient algorithms for object packing problem
- The geometry of nesting problems: a tutorial
- An improved typology of cutting and packing problems
- Tools of mathematical modeling of arbitrary object packing problems
- Hardness of approximation for orthogonal rectangle packing and covering problems
- Cutting circles and polygons from area-minimizing rectangles
- The complexity of cutting complexes
- Irregular Packing Using the Line and Arc No-Fit Polygon
- Phi-functions for 2D objects formed by line segments and circular arcs
- TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- A tutorial in irregular shape packing problems
- Rotational polygon overlap minimization and compaction
- Rotational polygon containment and minimum enclosure using only robust 2D constructions
- Containment of a single polygon using mathematical programming
- A new algorithm for the two-polygon containment problem
- A new algorithm for the minimal-area convex enclosure problem
- Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
- Polygon placement under translation and rotation
- Multiple translational containment. II: Exact algorithms
- Title not available (Why is that?)
Cited In (13)
- Packing circles into perimeter-minimizing convex hulls
- Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
- Quasi-phi-functions and optimal packing of ellipses
- Balance layout problem for 3D-objects: mathematical model and solution methods
- Optimized packing clusters of objects in a rectangular container
- Packing convex polygons in minimum-perimeter convex hulls
- A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines
- Irregular packing problems: a review of mathematical models
- Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
- The smallest convex \(k\)-gon containing \(n\) congruent disks
- Optimized Object Packings Using Quasi-Phi-Functions
- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
- The method of artificial space dilation in problems of optimal packing of geometric objects
Uses Software
This page was built for publication: Optimal clustering of a pair of irregular objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018508)
