Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
From MaRDI portal
Publication:6574943
DOI10.1007/978-3-031-49815-2_11MaRDI QIDQ6574943
Flávio K. Miyazawa, Vítor Gomes Chagas, Elisa Dell'Arriva
Publication date: 19 July 2024
Cites Work
- Unnamed Item
- Packing ellipsoids by nonlinear optimization
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- A literature review on circle and sphere packing problems: models and methodologies
- A formulation of the Kepler conjecture
- A beam search algorithm for the circular packing problem
- Approximation algorithms for orthogonal packing problems for hypercubes
- Optimal packing and covering in the plane are NP-complete
- A local search-based method for sphere packing problems
- A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids
- Techniques and results on approximation algorithms for packing circles
- Two-dimensional knapsack for circles
- The sphere packing problem in dimension 8
- The sphere packing problem in dimension \(24\)
- Approximation and online algorithms for multidimensional bin packing: a survey
- Minimizing the object dimensions in circle and sphere packing problems
- A near-optimal solution to a two-dimensional cutting stock problem
- Polynomial-Time Approximation Schemes for Circle Packing Problems
- Packing circles within ellipses
- Improved Approximation Algorithm for Two-Dimensional Bin Packing
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Proportional packing of circles in a circular container
- A PTAS for packing hypercubes into a knapsack
This page was built for publication: Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
