A Strip-Packing Algorithm with Absolute Performance Bound 2
From MaRDI portal
Recommendations
Cited in
(73)- Closing the Gap for Pseudo-Polynomial Strip Packing
- New upper bounds for online strip packing
- New approximability results for two-dimensional bin packing
- UPS-\(k\): a set partitioning problem with applications in UPS pickup-delivery system
- On the approximability of orthogonal order preserving layout adjustment
- Approximating minimum-area rectangular and convex containers for packing convex polygons
- Approximability results for the resource-constrained project scheduling problem with a single type of resources
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
- A Tight (3/2+ε) Approximation for Skewed Strip Packing.
- A (5/3+)-approximation for strip packing
- Combinatorial Benders decomposition for single machine scheduling in additive manufacturing with two-dimensional packing constraints
- Rectangle packing with one-dimensional resource augmentation
- An improved approximation for packing big two-bar charts
- A posteriori analysis of the algorithms for two-bar charts packing problem
- An approximation scheme for the two-stage, two-dimensional knapsack problem
- An effective approximation algorithm for the malleable parallel task scheduling problem
- Approximation algorithms for two-stage flexible flow shop scheduling
- On-line scheduling of parallel jobs
- A two-phase heuristic for strip packing: Algorithm and probabilistic analysis
- On the two-dimensional knapsack problem for convex polygons
- On-line scheduling mesh jobs with dependencies
- Tight approximation algorithms for geometric bin packing with skewed items
- Recent advances on two-dimensional bin packing problems
- Approximation and online algorithms for multidimensional bin packing: a survey
- Peak demand minimization via sliced strip packing
- Average-case performance analysis of a 2D strip packing algorithm -- NFDH
- An approximation algorithm for scheduling trees of malleable tasks
- 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
- Strip packing with precedence constraints and strip packing with release times
- Two for one: tight approximation of 2D bin packing
- An improved approximation algorithm for scheduling monotonic moldable tasks
- A new lower bound for online strip packing
- Polynomial-time approximation schemes for circle and other packing problems
- Upper bounds for heuristic approaches to the strip packing problem
- Upper bounds for heuristic approaches to the strip packing problem
- An approximation algorithm for square packing.
- Two-bar charts packing problem
- On the two-dimensional knapsack problem for convex polygons
- On contiguous and non-contiguous parallel task scheduling
- Absolute approximation ratios for packing rectangles into bins
- On the two-dimensional knapsack problem
- Online multiple-strip packing
- Approximate algorithms to pack rectangles into several strips
- A 3-approximation algorithm for two-dimensional bin packing
- Two-dimensional packing problems: a survey
- Online square packing with gravity
- An approximation scheme for strip packing of rectangles with bounded dimensions
- A note on the Kenyon-Remila strip-packing algorithm
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- On-line scheduling of parallel jobs in a list
- Scheduling parallel jobs to minimize the makespan
- Approximate composable truthful mechanism design
- A note on online strip packing
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
- Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
- Two for One: Tight Approximation of 2D Bin Packing
- Packing Rectangles into 2OPT Bins Using Rotations
- Relations between capacity utilization, minimal bin size and bin number
- Improved approximation algorithms for scheduling parallel jobs on identical clusters
- Packing into the smallest square: worst-case analysis of lower bounds
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
- Approximation algorithms for multiple strip packing
- High multiplicity strip packing with three rectangle types
- Linear time algorithms for multiple cluster scheduling and multiple strip packing
- Tight approximation algorithms for 2D guillotine strip packing
- Efficient approximation algorithms for scheduling moldable tasks
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
- scientific article; zbMATH DE number 3904609 (Why is no real title available?)
- High multiplicity strip packing with three rectangle types
- Approximate truthful mechanism design for two-dimensional orthogonal knapsack problem
This page was built for publication: A Strip-Packing Algorithm with Absolute Performance Bound 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337640)
