Pages that link to "Item:Q679456"
From MaRDI portal
The following pages link to An algorithm for the three-dimensional packing problem with asymptotic performance analysis (Q679456):
Displaying 12 items.
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- Two- and three-dimensional parametric packing (Q875405) (← links)
- Three-dimensional packings with rotations (Q1017455) (← links)
- Cube packing. (Q1401310) (← links)
- Parametric on-line algorithms for packing rectangles and boxes. (Q1405228) (← links)
- A global optimization algorithm for the three-dimensional packing problem (Q1584791) (← links)
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container (Q1847196) (← links)
- Constraints in container loading -- a state-of-the-art review (Q2355797) (← links)
- 3-D container packing heuristics (Q2574088) (← links)
- Resource augmentation in two-dimensional packing with orthogonal rotations (Q2583714) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- A comparative review of 3D container loading algorithms (Q2803269) (← links)
