Pages that link to "Item:Q5901656"
From MaRDI portal
The following pages link to LATIN 2004: Theoretical Informatics (Q5901656):
Displaying 15 items.
- Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped (Q466345) (← links)
- A hybrid placement strategy for the three-dimensional strip packing problem (Q621967) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- Three-dimensional packings with rotations (Q1017455) (← links)
- Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242) (← links)
- New lower bounds for the three-dimensional orthogonal bin packing problem (Q2253499) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Resource augmentation in two-dimensional packing with orthogonal rotations (Q2583714) (← links)
- A harmonic algorithm for the 3D strip packing problem (Q2840983) (← links)
- (Q3979317) (← links)
- Efficient algorithms for orthogonal packing problems (Q5413218) (← links)
- (Q5708494) (← links)
- Approximation and Online Algorithms (Q5713448) (← links)
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing (Q6046946) (← links)
- A Tight (3/2+ε) Approximation for Skewed Strip Packing. (Q6084400) (← links)