Compaction and separation algorithms for non-convex polygons and their applications

Cites Work

Cited In (33)

Irregular packing: MILP model based on a polygonal enclosure
Column-based strip packing using ordered and compliant containment
An algorithm for polygon placement using a bottom-left strategy
Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
Complete and robust no-fit polygon generation for the irregular stock cutting problem
Solving the irregular strip packing problem via guided local search for overlap minimization
A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
A heuristic algorithm for solving triangle packing problem
Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning
Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
A 2-exchange heuristic for nesting problems
Layout optimization for the objects located within a rotating vessel -- a three-dimensional packing problem with behavioral constraints
Irregular packing problems: a review of mathematical models
Mathematical model and efficient algorithms for object packing problem
Mixed-integer programming models for nesting problems
Densest translational lattice packing of non-convex polygons
Raster penetration map applied to the irregular packing problem
A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
The geometry of nesting problems: a tutorial
An improved typology of cutting and packing problems
Fast neighborhood search for two- and three-dimensional nesting problems
A moment based metric for 2-D and 3-D packing
Rotational polygon overlap minimization and compaction
Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
A hybrid approach for packing irregular patterns using evolutionary strategies and neural network
A fully general, exact algorithm for nesting irregular shapes
The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
An object-based evolutionary algorithm for solving nesting problems
A method of optimal lattice packing of congruent oriented polygons in the plane
A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
Two-dimensional profile-packing approach for multi-torch flame cutting

This page was built for publication: Compaction and separation algorithms for non-convex polygons and their applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127207)