Pages that link to "Item:Q2367010"
From MaRDI portal
The following pages link to Using a tabu search approach for solving the two-dimensional irregular cutting problem (Q2367010):
Displaying 17 items.
- Algorithms for nesting with defects (Q406491) (← links)
- MIP-based heuristic for non-standard 3D-packing problems (Q1029557) (← links)
- Solution approaches to irregular nesting problems (Q1127203) (← links)
- Containment of a single polygon using mathematical programming (Q1268270) (← links)
- A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
- A 2-exchange heuristic for nesting problems (Q1847180) (← links)
- A local search approach for two-dimensional irregular cutting (Q1908994) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes (Q2160486) (← links)
- Exact approaches for the cutting path determination problem (Q2329729) (← links)
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering (Q2356195) (← links)
- Fast neighborhood search for two- and three-dimensional nesting problems (Q2643957) (← links)
- A hybrid approach for packing irregular patterns using evolutionary strategies and neural network (Q3163153) (← links)
- Solving the irregular strip packing problem via guided local search for overlap minimization (Q3401324) (← links)
- [NO TITLE AVAILABLE] (Q5189100) (← links)
- An object-based evolutionary algorithm for solving nesting problems (Q5444463) (← links)
- An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects (Q6106774) (← links)
