Pages that link to "Item:Q4814103"
From MaRDI portal
The following pages link to Solving nesting problems with non-convex polygons by constraint logic programming (Q4814103):
Displaying 9 items.
- A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
- Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations (Q1756757) (← links)
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems (Q1992380) (← links)
- Irregular packing problems: a review of mathematical models (Q2286866) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed (Q6048503) (← links)
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands (Q6060670) (← links)
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts (Q6087527) (← links)
- Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems (Q6572836) (← links)
