A 2D convex shapes bin packing problem in the production of laminated safety glass
From MaRDI portal
Publication:6606599
DOI10.1007/978-3-031-24907-5_62MaRDI QIDQ6606599FDOQ6606599
Authors: Steffen J. Goebbels, Thomas Lühring, Jochen Rethmann 
Publication date: 17 September 2024
Recommendations
- Mixed-integer programming models for nesting problems
- scientific article; zbMATH DE number 1313602
- Irregular packing: MILP model based on a polygonal enclosure
- Fast neighborhood search for two- and three-dimensional nesting problems
- A SCANLINE-BASED ALGORITHM FOR THE 2D FREE-FORM BIN PACKING PROBLEM
Cites Work
- Mixed-integer programming models for nesting problems
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- Irregular packing problems: a review of mathematical models
- An improved method for calculating the no-fit polygon
This page was built for publication: A 2D convex shapes bin packing problem in the production of laminated safety glass
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606599)
