The following pages link to On Three-Dimensional Packing (Q3495654):
Displaying 18 items.
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- Relations between capacity utilization, minimal bin size and bin number (Q490141) (← links)
- A hybrid placement strategy for the three-dimensional strip packing problem (Q621967) (← links)
- An algorithm for the three-dimensional packing problem with asymptotic performance analysis (Q679456) (← links)
- Two- and three-dimensional parametric packing (Q875405) (← links)
- Three-dimensional packings with rotations (Q1017455) (← links)
- Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242) (← links)
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem (Q1330560) (← links)
- Parametric on-line algorithms for packing rectangles and boxes. (Q1405228) (← links)
- A global optimization algorithm for the three-dimensional packing problem (Q1584791) (← links)
- Introducing global constraints in CHIP (Q1842796) (← links)
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D (Q1862200) (← links)
- Constraints in container loading -- a state-of-the-art review (Q2355797) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Two-dimensional strip packing with unloading constraints (Q2448886) (← links)
- Global optimization for the three-dimensional open-dimension rectangular packing problem (Q5058800) (← links)
- AN EFFICIENT JOB SCHEDULING ALGORITHM IN PARTITIONABLE MESH CONNECTED SYSTEMS (Q5249289) (← links)
- SPATIAL SCHEDULING AND WORKFORCE ASSIGNMENT PROBLEM IN BLOCK ASSEMBLY SHOP OF SHIPBUILDING (Q5411733) (← links)