Pages that link to "Item:Q2286866"
From MaRDI portal
The following pages link to Irregular packing problems: a review of mathematical models (Q2286866):
Displayed 21 items.
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Sparsest balanced packing of irregular 3D objects in a cylindrical container (Q2029950) (← links)
- Sparse balanced layout of spherical voids in three-dimensional domains (Q2044059) (← links)
- Optimized filling of a given cuboid with spherical powders for additive manufacturing (Q2059194) (← links)
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation (Q2116899) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes (Q2160486) (← links)
- Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning (Q2242334) (← links)
- Extracting maximal objects from three-dimensional solid materials (Q2668729) (← links)
- Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning (Q2668752) (← links)
- An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations (Q2669649) (← links)
- Packing convex polygons in minimum-perimeter convex hulls (Q2679237) (← links)
- Model development and solver demonstrations using randomized test problems (Q2689552) (← links)
- Decomposition Algorithm for Irregular Placement Problems (Q5117305) (← links)
- Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem (Q5117310) (← links)
- Cutting and packing problems under uncertainty: literature review and classification framework (Q6056892) (← links)
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands (Q6060670) (← links)
- Heuristics for the two-dimensional irregular bin packing problem with limited rotations (Q6068729) (← links)
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts (Q6087527) (← links)
- An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects (Q6106774) (← links)