Pages that link to "Item:Q2250088"
From MaRDI portal
The following pages link to A fully general, exact algorithm for nesting irregular shapes (Q2250088):
Displaying 13 items.
- A customized branch-and-bound approach for irregular shape nesting (Q1668808) (← links)
- Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations (Q1756757) (← links)
- On tackling reverse convex constraints for non-overlapping of unequal circles (Q2045013) (← links)
- Packing ellipsoids in an optimized cylinder (Q2183847) (← links)
- Descending packing algorithm for irregular graphics based on geometric feature points (Q2214815) (← links)
- Irregular packing problems: a review of mathematical models (Q2286866) (← links)
- Optimized packing clusters of objects in a rectangular container (Q2298400) (← links)
- Raster penetration map applied to the irregular packing problem (Q2312355) (← links)
- Packing convex polygons in minimum-perimeter convex hulls (Q2679237) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Decomposition Algorithm for Irregular Placement Problems (Q5117305) (← links)
- Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem (Q5117310) (← links)
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts (Q6087527) (← links)
