On rectangle packing, maximizing benefits
From MaRDI portal
Recommendations
Cited in
(35)- Hardness of approximation for orthogonal rectangle packing and covering problems
- iGreen: green scheduling for peak demand minimization
- Exact algorithms for the two-dimensional guillotine knapsack
- Expected wasted space of optimal simple rectangle packing
- A 3-approximation algorithm for two-dimensional bin packing
- Two dimensional knapsack with unloading constraints
- On packing rectangles with resource augmentation: maximizing the profit
- Packing squares with profits
- Two for One: Tight Approximation of 2D Bin Packing
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
- A (2+)-approximation algorithm for the storage allocation problem
- A Polynomial Time Approximation Scheme for the Square Packing Problem
- Spectrum Bidding in Wireless Networks and Related
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
- Algorithm Theory - SWAT 2004
- Algorithms and Computation
- Tight approximation algorithms for geometric bin packing with skewed items
- On the two-dimensional knapsack problem for convex polygons
- Approximating the maximum independent set of convex polygons with a bounded number of directions
- Tight approximation algorithms for 2D guillotine strip packing
- A parameterized approximation scheme for the geometric knapsack problem with wide items
- Approximation algorithms for round-UFP and round-SAP
- Energy-efficient scheduling in an identical parallel machine environment with peak power consumption and deadline constraints
- On the two-dimensional knapsack problem for convex polygons
- Chips on wafers, or packing rectangles into grids
- Improved approximation algorithms for 2-dimensional knapsack: packing into multiple l-shapes, spirals, and more
- On guillotine separable packings for the two-dimensional geometric knapsack problem
- Rectangle packing with one-dimensional resource augmentation
- Maximizing the throughput of parallel jobs on hypercubes
- On-line scheduling mesh jobs with dependencies
- Maximizing the total profit of rectangles packed into a rectangle
- Online removable square packing
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems
- An approximation algorithm for sequential rectangle placement
This page was built for publication: On rectangle packing, maximizing benefits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501261)
