Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
From MaRDI portal
Publication:6574943
Cites work
- A beam search algorithm for the circular packing problem
- A formulation of the Kepler conjecture
- A literature review on circle and sphere packing problems: models and methodologies
- A local search-based method for sphere packing problems
- A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids
- A near-optimal solution to a two-dimensional cutting stock problem
- A PTAS for packing hypercubes into a knapsack
- 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
- scientific article; zbMATH DE number 3633251 (Why is no real title available?)
- Improved approximation algorithm for two-dimensional bin packing
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- Minimizing the object dimensions in circle and sphere packing problems
- Optimal packing and covering in the plane are NP-complete
- Packing circles within ellipses
- Packing ellipsoids by nonlinear optimization
- Polynomial-time approximation schemes for circle packing problems
- Proportional packing of circles in a circular container
- Techniques and results on approximation algorithms for packing circles
- The sphere packing problem in dimension 8
- The sphere packing problem in dimension \(24\)
- Two-dimensional knapsack for circles
This page was built for publication: Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574943)
