Pages that link to "Item:Q930941"
From MaRDI portal
The following pages link to A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach (Q930941):
Displaying 14 items.
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry (Q319718) (← links)
- A fast heuristic for a three-dimensional non-convex domain loading problem (Q538281) (← links)
- A tree search method for the container loading problem with shipment priority (Q635159) (← links)
- Layer-layout-based heuristics for loading homogeneous items into a single container (Q926048) (← links)
- A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning (Q1042176) (← links)
- A new quasi-human algorithm for solving the packing problem of unit equilateral triangles (Q1723821) (← links)
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
- Three-dimensional container loading models with cargo stability and load bearing constraints (Q1761946) (← links)
- Deterministic model for customized pilot manufacture production with various backplane sizes (Q2310672) (← links)
- Constraints in container loading -- a state-of-the-art review (Q2355797) (← links)
- Weight distribution in container loading: a case study (Q2803266) (← links)
- A comparative review of 3D container loading algorithms (Q2803269) (← links)
- An efficient method for the three-dimensional container loading problem by forming box sizes (Q6048170) (← links)
- A large neighbourhood search algorithm for solving container loading problems (Q6109572) (← links)
