Pages that link to "Item:Q1897382"
From MaRDI portal
The following pages link to The nesting problem in the leather manufacturing industry (Q1897382):
Displaying 9 items.
- Algorithms for nesting with defects (Q406491) (← links)
- Translational packing of arbitrary polytopes (Q1005325) (← links)
- Optimal placement of convex polygons to maximize point containment (Q1265324) (← links)
- Computing closely matching upper and lower bounds on textile nesting problems (Q1296780) (← links)
- A new variant of a vehicle routing problem: Lower and upper bounds (Q1598727) (← links)
- A simulated annealing approach to the nesting problem in the textile manufacturing industry (Q1897378) (← links)
- A variable neighborhood search algorithm for the leather nesting problem (Q1954576) (← links)
- Fast neighborhood search for two- and three-dimensional nesting problems (Q2643957) (← links)
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts (Q6087527) (← links)
