Irregular packing: MILP model based on a polygonal enclosure
From MaRDI portal
Recommendations
- Irregular packing problems: a review of mathematical models
- A mixed-integer model for two-dimensional polyominoes strip packing and tiling problems
- Robust mixed-integer linear programming models for the irregular strip packing problem
- Dealing with nonregular shapes packing
- Modeling of packing problems
Cites work
- A 2-exchange heuristic for nesting problems
- A beam search implementation for the irregular shape packing problem
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
- A hybrid approach for packing irregular patterns using evolutionary strategies and neural network
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- A tabu thresholding implementation for the irregular stock cutting problem
- An improved typology of cutting and packing problems
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- Compaction and separation algorithms for non-convex polygons and their applications
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- Cutting and packing. Special issue
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- Fast neighborhood search for two- and three-dimensional nesting problems
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- Mathematical model and efficient algorithms for object packing problem
- Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
- Mixed-integer programming models for nesting problems
- On genetic algorithms for the packing of polygons
- Solution approaches to irregular nesting problems
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- The geometry of nesting problems: a tutorial
- Tools of mathematical modeling of arbitrary object packing problems
Cited in
(18)- A customized branch-and-bound approach for irregular shape nesting
- Dealing with nonregular shapes packing
- Placement problems for irregular objects: mathematical modeling, optimization and applications
- Optimal clustering of a pair of irregular objects
- Descending packing algorithm for irregular graphics based on geometric feature points
- A fully general, exact algorithm for nesting irregular shapes
- Mixed-integer programming models for nesting problems
- Irregular packing problems: a review of mathematical models
- Raster penetration map applied to the irregular packing problem
- A mixed-integer model for two-dimensional polyominoes strip packing and tiling problems
- Irregular packing using the line and arc no-fit polygon
- Robust mixed-integer linear programming models for the irregular strip packing problem
- Modeling of packing problems
- Approximate packing: integer programming models, valid inequalities and nesting
- 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
- A 2D convex shapes bin packing problem in the production of laminated safety glass
- A multi-objective evolutionary algorithm based on incremental support vector regression for the irregular strip packing problem
This page was built for publication: Irregular packing: MILP model based on a polygonal enclosure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256688)
