A tutorial in irregular shape packing problems
From MaRDI portal
Recommendations
Cited in
(38)- A clique covering MIP model for the irregular strip packing problem
- Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers
- Dealing with nonregular shapes packing
- A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems
- Matheuristics for the irregular bin packing problem with free rotations
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- Optimal clustering of a pair of irregular objects
- Exact solution techniques for two-dimensional cutting and packing
- Optimized filling of a given cuboid with spherical powders for additive manufacturing
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
- Irreducible bin packing and normality in routing open shop
- A fully general, exact algorithm for nesting irregular shapes
- Irregular packing problems: a review of mathematical models
- A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem
- Raster penetration map applied to the irregular packing problem
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
- Packing convex polygons in minimum-perimeter convex hulls
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
- Packing problems in space solved by CPLEX: an experimental analysis
- Jostling for position: local improvement for irregular cutting patterns
- A hybrid approach for packing irregular patterns using evolutionary strategies and neural network
- An effective heuristic for the two-dimensional irregular bin packing problem
- Approximate packing: integer programming models, valid inequalities and nesting
- Heuristics for the two-dimensional irregular bin packing problem with limited rotations
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects
- Voxel-Based Solution Approaches to the Three-Dimensional Irregular Packing Problem
- Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems
- Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems
- Approximation schemes for geometric knapsack for packing spheres and fat objects
- An innovative irregular nesting algorithm for flaw avoidance
- Improving the efficiency of logic-based benders decomposition for p-batch scheduling problems with two-dimensional packing
- A parallel branch-and-bound-and-check algorithm for nesting
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
- A beam search implementation for the irregular shape packing problem
This page was built for publication: A tutorial in irregular shape packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3394054)
