Improved approximation algorithms for three-dimensional bin packing
From MaRDI portal
Cites work
- A (5/3+)-approximation for strip packing
- A comparative evaluation of heuristics for container loading
- A harmonic algorithm for the 3D strip packing problem
- A heuristic for solving large bin packing problems in two and three dimensions
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- A hybrid placement strategy for the three-dimensional strip packing problem
- A linear programming approach for the three-dimensional bin-packing problem
- A near-optimal solution to a two-dimensional cutting stock problem
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- A new asymptotic approximation algorithm for 3-dimensional strip packing
- A PTAS for packing hypercubes into a knapsack
- A reference length approach for the 3D strip packing problem
- A simple on-line bin-packing algorithm
- An algorithm for the three-dimensional packing problem with asymptotic performance analysis
- An asymptotic approximation algorithm for 3D-strip packing
- An effective shaking procedure for 2D and 3D strip packing problems
- An on-line algorithm for multidimensional bin packing
- Approximating Geometric Knapsack via L-packings
- Approximating Smallest Containers for Packing Three-Dimensional Convex Objects
- Approximation algorithms for orthogonal packing problems for hypercubes
- Approximation and online algorithms for multidimensional bin packing: a survey
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Closing the Gap for Pseudo-Polynomial Strip Packing
- Complexity and inapproximability results for parallel task scheduling and strip packing
- Computational aspects of packing problems
- Extreme point-based heuristics for three-dimensional bin packing
- Guided local search for the three-dimensional bin-packing problem
- Hardness of approximation for orthogonal rectangle packing and covering problems
- Heuristic algorithms for on-line packing in three dimensions
- Heuristic algorithms for the three-dimensional bin packing problem
- scientific article; zbMATH DE number 7799610 (Why is no real title available?)
- Improved approximation algorithm for two-dimensional bin packing
- LATIN 2004: Theoretical Informatics
- Multistage Cutting Stock Problems of Two and More Dimensions
- New approximability results for two-dimensional bin packing
- On packing of squares and cubes
- On Three-Dimensional Packing
- Optimal online bounded space multidimensional packing
- Packing d-Dimensional Bins in d Stages
- Packing cubes into a cube is NP-complete in the strong sense
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- The Three-Dimensional Bin Packing Problem
- Tight approximation algorithms for maximum separable assignment problems
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Two for one: tight approximation of 2D bin packing
This page was built for publication: Improved approximation algorithms for three-dimensional bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363192)
