Pages that link to "Item:Q1330560"
From MaRDI portal
The following pages link to Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem (Q1330560):
Displaying 15 items.
- The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
- Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
- A MIP-based slicing heuristic for three-dimensional bin packing (Q1686545) (← links)
- A computer-based heuristic for packing pooled shipment containers (Q1825771) (← links)
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems (Q2003558) (← links)
- A data-driven approach for mixed-case palletization with support (Q2168642) (← links)
- The exact solutions of several types of container loading problems (Q2301942) (← 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)
- A 3D-BPP approach for optimising stowage plans and terminal productivity (Q2643974) (← links)
- A comparative review of 3D container loading algorithms (Q2803269) (← links)
- A general purpose algorithm for three-dimensional packing (Q2890477) (← links)
- Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem (Q4979988) (← links)
- Layout optimization for the objects located within a rotating vessel -- a three-dimensional packing problem with behavioral constraints (Q5936135) (← links)
