Pages that link to "Item:Q1035685"
From MaRDI portal
The following pages link to Approximation algorithms for orthogonal packing problems for hypercubes (Q1035685):
Displayed 7 items.
- 2D knapsack: packing squares (Q388093) (← links)
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303) (← links)
- Online square-into-square packing (Q521815) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Packing cubes into a cube is NP-complete in the strong sense (Q2354306) (← links)
- 2D Knapsack: Packing Squares (Q3004667) (← links)
- Packing Cubes into a Cube in (D>3)-Dimensions (Q3196389) (← links)