New approximability results for two-dimensional bin packing
From MaRDI portal
Publication:261358
DOI10.1007/s00453-014-9943-zzbMath1341.90111OpenAlexW2003941356MaRDI QIDQ261358
Publication date: 23 March 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://macau.uni-kiel.de/receive/macau_mods_00001779
Integer programming (90C10) Linear programming (90C05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (3)
Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ A mixed‐integer linear programming model and a metaheuristic approach for the selection and allocation of land parcels problem ⋮ A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
Cites Work
- Unnamed Item
- Rectangle packing with one-dimensional resource augmentation
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- Hardness of approximation for orthogonal rectangle packing and covering problems
- Bin packing can be solved within 1+epsilon in linear time
- Absolute approximation ratios for packing rectangles into bins
- Carathéodory bounds for integer cones
- A 3-approximation algorithm for two-dimensional bin packing
- Approximate Max-Min Resource Sharing for Structured Concave Optimization
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS
- A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing
- Two for One: Tight Approximation of 2D Bin Packing
- On strip packing With rotations
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
- Minkowski's Convex Body Theorem and Integer Programming
- Fast Approximation Algorithms for Knapsack Problems
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- On Packing Two-Dimensional Bins
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Improved Approximation Algorithm for Two-Dimensional Bin Packing
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Packing d-Dimensional Bins in d Stages
- Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications
This page was built for publication: New approximability results for two-dimensional bin packing
