Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
From MaRDI portal
(Redirected from Publication:3893333)
Cited in
(only showing first 100 items - show all)- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- Three-dimensional packings with rotations
- A note on online strip packing
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Bin packing with divisible item sizes
- Guillotineable bin packing: A genetic approach
- A 2.5 times optimal algorithm for packing in two dimensions
- An improved BL lower bound
- Oriented aligned rectangle packing problem
- Packings in two dimensions: Asymptotic average-case analysis of algorithms
- An algorithm for the 2D guillotine cutting stock problem
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms
- Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
- An approximation scheme for strip packing of rectangles with bounded dimensions
- Parametric on-line algorithms for packing rectangles and boxes.
- Exact algorithms for the guillotine strip cutting/packing problem.
- Scheduling space-sharing for internet advertising
- iGreen: green scheduling for peak demand minimization
- Co-scheduling algorithms for high-throughput workload execution
- Offline first-fit decreasing height scheduling of power loads
- New upper bounds for online strip packing
- Exact algorithms for the two-dimensional guillotine knapsack
- The two-dimensional cutting stock problem revisited
- Average-case performance analysis of a 2D strip packing algorithm -- NFDH
- Two-dimensional packing problems: a survey
- Two-dimensional packing algorithms for layout of disconnected graphs
- The nesting problem in the leather manufacturing industry
- Efficient heuristics for robot acquisition planning for a CIM system
- A new upper bound for the online square packing problem in a strip
- Two-bar charts packing problem
- Techniques and results on approximation algorithms for packing circles
- Guillotine cutting is asymptotically optimal for packing consecutive squares
- Strip based compact formulation for two-dimensional guillotine cutting problems
- Asynchronous optimization of part logistics routing problem
- A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
- Greed in resource scheduling
- Heuristics for packing semifluids
- Malleable scheduling for flows of jobs and applications to MapReduce
- Approximation and online algorithms for multidimensional bin packing: a survey
- Triple-solution approach for the strip packing problem with two-staged patterns
- Absolute approximation ratios for packing rectangles into bins
- Two-dimensional bin packing with one-dimensional resource augmentation
- Resource augmentation in two-dimensional packing with orthogonal rotations
- New approximability results for two-dimensional bin packing
- Approximate strip packing: revisited
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Upper bounds for heuristic approaches to the strip packing problem
- Upper bounds for heuristic approaches to the strip packing problem
- Two dimensional knapsack with unloading constraints
- Selfish square packing
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
- Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
- Modeling two-dimensional guillotine cutting problems via integer programming
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
- A block-based layer building approach for the 2D guillotine strip packing problem
- Approximate truthful mechanism design for two-dimensional orthogonal knapsack problem
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
- A new lower bound for online strip packing
- Polynomial-time approximation schemes for circle and other packing problems
- Approximation algorithms for scheduling with resource and precedence constraints
- Approximate composable truthful mechanism design
- A Polynomial Time Approximation Scheme for the Square Packing Problem
- Packing Rectangles into 2OPT Bins Using Rotations
- Performance testing of rectangular parts-nesting heuristics
- A (5/3+)-approximation for strip packing
- On Packing Two-Dimensional Bins
- A comparison of heuristic algorithms for cost-oriented assembly line balancing
- An approximation scheme for the two-stage, two-dimensional knapsack problem
- An effective approximation algorithm for the malleable parallel task scheduling problem
- Asymptotically optimal scheduling of random malleable demands in smart grid
- Packing, covering and tiling in two-dimensional spaces
- Online square packing with gravity
- Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem
- Relations between capacity utilization, minimal bin size and bin number
- Analysis of a first-fit algorithm for the capacitated unit covering problem
- Online strip packing with polynomial migration
- A posteriori analysis of the algorithms for two-bar charts packing problem
- On two dimensional packing
- Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints
- Closing the Gap for Pseudo-Polynomial Strip Packing
- Prices of anarchy of selfish 2D bin packing games
- Probabilistic analysis of shelf algorithms for strip packing
- Approximate algorithms to pack rectangles into several strips
- scientific article; zbMATH DE number 2230208 (Why is no real title available?)
- Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
- Average-case analysis of cutting and packing in two dimensions
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
- Tight approximation algorithms for geometric bin packing with skewed items
- Peak demand minimization via sliced strip packing
- A Tight (3/2+ε) Approximation for Skewed Strip Packing.
- An improved approximation algorithm for scheduling monotonic moldable tasks
- High multiplicity strip packing with three rectangle types
- Dynamic multi-dimensional bin packing
- An improved approximation for packing big two-bar charts
- Models for two-dimensional bin packing problems with customer order spread
- On the two-dimensional knapsack problem for convex polygons
- Approximation schemes for geometric knapsack for packing spheres and fat objects
- Compliant-based robotic 3D bin packing with unavoidable uncertainties
- Tight approximation algorithms for 2D guillotine strip packing
- Covering a square with consecutive squares
This page was built for publication: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893333)
