Pages that link to "Item:Q1129950"
From MaRDI portal
The following pages link to An analytical model for the container loading problem (Q1129950):
Displayed 14 items.
- A new heuristic algorithm for rectangle packing (Q883288) (← links)
- A global optimization algorithm for the three-dimensional packing problem (Q1584791) (← links)
- Heuristics for the container loading problem (Q1847185) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container (Q1847196) (← links)
- Transshipment of containers at a container terminal: An overview (Q1869526) (← links)
- An optimization model for storage yard management in transshipment hubs (Q2432102) (← links)
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem (Q2566944) (← links)
- The two-dimensional bin packing problem with variable bin sizes and costs (Q2568334) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948) (← links)
- A 3D-BPP approach for optimising stowage plans and terminal productivity (Q2643974) (← links)
- A greedy search for the three-dimensional bin packing problem: the packing static stability case (Q3044093) (← links)
- Applying genetic algorithms and neural networks to the container loading problem (Q4469156) (← links)