The following pages link to Algorithms for nesting with defects (Q406491):
Displaying 17 items.
- Robust mixed-integer linear programming models for the irregular strip packing problem (Q323210) (← links)
- Irregular stock cutting system based on AutoCAD (Q654369) (← links)
- TOPOS -- A new constructive algorithm for nesting problems (Q1569799) (← links)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
- The nesting problem in the leather manufacturing industry (Q1897382) (← links)
- A variable neighborhood search algorithm for the leather nesting problem (Q1954576) (← links)
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation (Q2116899) (← links)
- Descending packing algorithm for irregular graphics based on geometric feature points (Q2214815) (← links)
- Irregular packing problems: a review of mathematical models (Q2286866) (← links)
- Exact approaches for the cutting path determination problem (Q2329729) (← links)
- Fast neighborhood search for two- and three-dimensional nesting problems (Q2643957) (← links)
- Decomposition Algorithm for Irregular Placement Problems (Q5117305) (← links)
- Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem (Q5117310) (← 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)
- Solving two-dimensional cutting stock problem via a DNA computing algorithm (Q6095483) (← links)
- An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry (Q6551075) (← links)
