A Polynomial Time Approximation Scheme for the Square Packing Problem
From MaRDI portal
Publication:3503847
DOI10.1007/978-3-540-68891-4_13zbMath1143.90399OpenAlexW1517042457MaRDI QIDQ3503847
Roberto Solis-Oba, Klaus Jansen
Publication date: 10 June 2008
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_13
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (9)
Packing anchored rectangles ⋮ Two for One: Tight Approximation of 2D Bin Packing ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ 2D knapsack: packing squares ⋮ 2D Knapsack: Packing Squares ⋮ Online square-into-square packing ⋮ Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack ⋮ Approximation algorithms for orthogonal packing problems for hypercubes ⋮ Two Dimensional Knapsack with Unloading Constraints
Cites Work
- Unnamed Item
- An efficient approximation for the generalized assignment problem
- Maximizing the total profit of rectangles packed into a rectangle
- Two-dimensional bin packing with one-dimensional resource augmentation
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- Approximating the Orthogonal Knapsack Problem for Hypercubes
- Fast Approximation Algorithms for Knapsack Problems
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Mathematical Foundations of Computer Science 2005
This page was built for publication: A Polynomial Time Approximation Scheme for the Square Packing Problem
