Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

Cited In (only showing first 100 items - show all)

Approximation Algorithms for Scheduling with Resource and Precedence Constraints
New upper bounds for online strip packing
New approximability results for two-dimensional bin packing
Bin packing with divisible item sizes
A \((5/3+\varepsilon)\)-approximation for strip packing
Resource augmentation in two-dimensional packing with orthogonal rotations
Two-dimensional packing algorithms for layout of disconnected graphs
Rectangle packing with one-dimensional resource augmentation
An improved BL lower bound
An approximation scheme for the two-stage, two-dimensional knapsack problem
Resource sharing combined with layout effects in high-level synthesis
Title not available (Why is that?)
Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem
An effective approximation algorithm for the malleable parallel task scheduling problem
Three-dimensional packings with rotations
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
Title not available (Why is that?)
Average-case analysis of cutting and packing in two dimensions
Recent advances on two-dimensional bin packing problems
The nesting problem in the leather manufacturing industry
Approximation and online algorithms for multidimensional bin packing: a survey
An algorithm for the 2D guillotine cutting stock problem
Dynamic multi-dimensional bin packing
Two-dimensional bin packing with one-dimensional resource augmentation
Exact algorithms for the two-dimensional guillotine knapsack
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
Parametric on-line algorithms for packing rectangles and boxes.
Strip packing with precedence constraints and strip packing with release times
Guillotineable bin packing: A genetic approach
A new lower bound for online strip packing
Polynomial-time approximation schemes for circle and other packing problems
Approximate algorithms to pack rectangles into several strips
Packing, covering and tiling in two-dimensional spaces
Improved upper bounds for online malleable job scheduling
On contiguous and non-contiguous parallel task scheduling
Absolute approximation ratios for packing rectangles into bins
Selfish square packing
Exact algorithms for the guillotine strip cutting/packing problem.
Two- and three-dimensional parametric packing
Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
Two-dimensional packing problems: a survey
Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
An approximation scheme for strip packing of rectangles with bounded dimensions
Online square packing with gravity
A note on the Kenyon-Remila strip-packing algorithm
On-line scheduling of parallel jobs in a list
Scheduling parallel jobs to minimize the makespan
Approximate composable truthful mechanism design
Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
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
A 2.5 times optimal algorithm for packing in two dimensions
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
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
Multiple-type, two-dimensional bin packing problems: Applications and algorithms
A comparison of heuristic algorithms for cost-oriented assembly line balancing
Scheduling space-sharing for internet advertising
A Polynomial Time Approximation Scheme for the Square Packing Problem
Network flows and non-guillotine cutting patterns
On Packing Two-Dimensional Bins
Packings in two dimensions: Asymptotic average-case analysis of algorithms
Malleable scheduling for flows of jobs and applications to MapReduce
The two-dimensional cutting stock problem revisited
Probabilistic analysis of shelf algorithms for strip packing
A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
Complexity and inapproximability results for parallel task scheduling and strip packing
A Tight (3/2+ε) Approximation for Skewed Strip Packing.
Strip based compact formulation for two-dimensional guillotine cutting problems
Analysis of a first-fit algorithm for the capacitated unit covering problem
An improved approximation for packing big two-bar charts
A new upper bound for the online square packing problem in a strip
Tight approximation algorithms for geometric bin packing with skewed items
A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
Asynchronous optimization of part logistics routing problem
Peak demand minimization via sliced strip packing
Efficient heuristics for robot acquisition planning for a CIM system
Average-case performance analysis of a 2D strip packing algorithm -- NFDH
An improved approximation algorithm for scheduling monotonic moldable tasks
Upper bounds for heuristic approaches to the strip packing problem
Upper Bounds for Heuristic Approaches to the Strip Packing Problem
Triple-solution approach for the strip packing problem with two-staged patterns
Models for two-dimensional bin packing problems with customer order spread
Two-bar charts packing problem
Approximate strip packing: revisited
Improved approximation for two dimensional strip packing with polynomial bounded width
Prices of Anarchy of Selfish 2D Bin Packing Games
Two dimensional knapsack with unloading constraints
Asymptotically optimal scheduling of random malleable demands in smart grid
Greed in resource scheduling
iGreen: green scheduling for peak demand minimization
Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
On two dimensional packing
Heuristics for packing semifluids
Packing Rectangles into 2OPT Bins Using Rotations
A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem

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)