Improved approximation algorithms for three-dimensional knapsack
From MaRDI portal
Cites work
- A new asymptotic approximation algorithm for 3-dimensional strip packing
- A PTAS for packing hypercubes into a knapsack
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Approximating Geometric Knapsack via L-packings
- Approximating the geometric knapsack problem in near-linear time and dynamically
- 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
- Computational aspects of packing problems
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- Hardness of approximation for orthogonal rectangle packing and covering problems
- Improved approximation algorithms for 2-dimensional knapsack: packing into multiple l-shapes, spirals, and more
- Improved approximation schemes for scheduling unrelated parallel machines
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Maximizing the total profit of rectangles packed into a rectangle
- Multistage Cutting Stock Problems of Two and More Dimensions
- On guillotine separable packings for the two-dimensional geometric knapsack problem
- 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 Kepler Conjecture
- The Soma puzzle book. A new approach to the classic pieces
This page was built for publication: Improved approximation algorithms for three-dimensional knapsack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312708)
