Compaction and separation algorithms for non-convex polygons and their applications
From MaRDI portal
Publication:1127207
Cites work
- scientific article; zbMATH DE number 3902440 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 1142297 (Why is no real title available?)
- scientific article; zbMATH DE number 219272 (Why is no real title available?)
- scientific article; zbMATH DE number 742950 (Why is no real title available?)
- scientific article; zbMATH DE number 3894985 (Why is no real title available?)
- A typology of cutting and packing problems
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Finding the upper envelope of n line segments in O(n log n) time
- Multiple translational containment. I: An approximate algorithm
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- On the solution of inequality systems relevant to IC-layout
- Relationships between nondeterministic and deterministic tape complexities
- Robust polygon modelling
- Verifiable implementations of geometric algorithms using finite precision arithmetic
Cited in
(33)- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- A heuristic algorithm for solving triangle packing problem
- A method of optimal lattice packing of congruent oriented polygons in the plane
- A 2-exchange heuristic for nesting problems
- An algorithm for polygon placement using a bottom-left strategy
- Layout optimization for the objects located within a rotating vessel -- a three-dimensional packing problem with behavioral constraints
- A moment based metric for 2-D and 3-D packing
- Rotational polygon overlap minimization and compaction
- Two-dimensional profile-packing approach for multi-torch flame cutting
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- Solving the irregular strip packing problem via guided local search for overlap minimization
- An improved typology of cutting and packing problems
- Fast neighborhood search for two- and three-dimensional nesting problems
- A fully general, exact algorithm for nesting irregular shapes
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Irregular packing problems: a review of mathematical models
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
- Irregular packing: MILP model based on a polygonal enclosure
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
- A hybrid approach for packing irregular patterns using evolutionary strategies and neural network
- Mathematical model and efficient algorithms for object packing problem
- An object-based evolutionary algorithm for solving nesting problems
- Mixed-integer programming models for nesting problems
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- The geometry of nesting problems: a tutorial
- Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning
- Densest translational lattice packing of non-convex polygons
- Raster penetration map applied to the irregular packing problem
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- Column-based strip packing using ordered and compliant containment
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)
