Mixed-integer linear programming models for 3D irregular strip packing problems
From MaRDI portal
Cites work
- A typology of cutting and packing problems
- An improved typology of cutting and packing problems
- Constraints in container loading -- a state-of-the-art review
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- Exact solution techniques for two-dimensional cutting and packing
- Fast neighborhood search for two- and three-dimensional nesting problems
- Heuristics for container loading of furniture
- Irregular packing problems: a review of mathematical models
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- Mixed-integer programming models for nesting problems
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- Packing of convex polytopes into a parallelepiped
- Robust mixed-integer linear programming models for the irregular strip packing problem
- Sparsest balanced packing of irregular 3D objects in a cylindrical container
- The geometry of nesting problems: a tutorial
- Translational packing of arbitrary polytopes
- Voxel-Based Solution Approaches to the Three-Dimensional Irregular Packing Problem
This page was built for publication: Mixed-integer linear programming models for 3D irregular strip packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233343)
