Maximizing the total profit of rectangles packed into a rectangle
From MaRDI portal
Publication:878442
DOI10.1007/s00453-006-0194-5zbMath1111.68150OpenAlexW2155087380MaRDI QIDQ878442
Publication date: 26 April 2007
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-006-0194-5
Related Items (23)
Packing anchored rectangles ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Two for One: Tight Approximation of 2D Bin Packing ⋮ Approximate composable truthful mechanism design ⋮ Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ 2D knapsack: packing squares ⋮ A \((5/3+\varepsilon)\)-approximation for strip packing ⋮ A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing ⋮ Peak demand minimization via sliced strip packing ⋮ A Polynomial Time Approximation Scheme for the Square Packing Problem ⋮ Efficient approximation algorithms for scheduling moldable tasks ⋮ Packing Rectangles into 2OPT Bins Using Rotations ⋮ An approximation scheme for the two-stage, two-dimensional knapsack problem ⋮ Absolute approximation ratios for packing rectangles into bins ⋮ Relations between capacity utilization, minimal bin size and bin number ⋮ 2D Knapsack: Packing Squares ⋮ A Tight (3/2+ε) Approximation for Skewed Strip Packing. ⋮ Online square-into-square packing ⋮ TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING ⋮ Packing resizable items with application to video delivery over wireless networks ⋮ Approximation algorithms for orthogonal packing problems for hypercubes ⋮ Weighted completion time minimization for capacitated parallel machines
This page was built for publication: Maximizing the total profit of rectangles packed into a rectangle
