Pages that link to "Item:Q2116899"
From MaRDI portal
The following pages link to A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation (Q2116899):
Displaying 4 items.
- The necessary and sufficient condition and the efficient algorithms for gradually varied fill (Q749234) (← links)
- TOPOS -- A new constructive algorithm for nesting problems (Q1569799) (← links)
- A 2-exchange heuristic for nesting problems (Q1847180) (← links)
- Fast neighborhood search for two- and three-dimensional nesting problems (Q2643957) (← links)