Pages that link to "Item:Q4018521"
From MaRDI portal
The following pages link to A Method for Solving Container Packing for a Single Size of Box (Q4018521):
Displaying 11 items.
- A heuristic algorithm for container loading of pallets with infill boxes (Q322963) (← links)
- A fast heuristic for a three-dimensional non-convex domain loading problem (Q538281) (← links)
- Effective methods for a container packing operation (Q1361222) (← links)
- Three-dimensional container loading models with cargo stability and load bearing constraints (Q1761946) (← 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)
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity (Q2404356) (← links)
- 3-D container packing heuristics (Q2574088) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- A comparative review of 3D container loading algorithms (Q2803269) (← links)
- Analysing trade‐offs in container loading: combining load plan construction heuristics with agent‐based simulation (Q5416758) (← links)