Approximation and online algorithms for multidimensional bin packing: a survey
From MaRDI portal
Recommendations
Cites work
- A 2.5 times optimal algorithm for packing in two dimensions
- A 3-approximation algorithm for two-dimensional bin packing
- A (5/3+)-approximation for strip packing
- A algorithm for two-dimensional packing
- A better lower bound for on-line scheduling
- A branch-and-bound algorithm for the two-dimensional vector packing problem
- A breakthrough in sphere packing: the search for magic functions
- A Linear Programming Approach to the Cutting-Stock Problem
- A near-optimal solution to a two-dimensional cutting stock problem
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- A new asymptotic approximation algorithm for 3-dimensional strip packing
- A new upper bound 2.5545 on 2D Online Bin Packing
- A note on online hypercube packing
- A note on online strip packing
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- A Polynomial Time Approximation Scheme for the Square Packing Problem
- A quasi-PTAS for the two-dimensional geometric knapsack problem
- A simple on-line bin-packing algorithm
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- A structural lemma in 2-dimensional packing, and its implications on approximability
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
- About the structure of the integer cone and its application to bin packing
- Absolute approximation ratios for packing rectangles into bins
- Algorithm Theory - SWAT 2004
- Algorithms and Computation
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
- An asymptotic fully polynomial time approximation scheme for bin covering.
- An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables
- An improved deterministic rescaling for linear programming algorithms
- An improved lower bound for on-line bin packing algorithms
- An on-line algorithm for multidimensional bin packing
- Approximate max-min resource sharing for structured concave optimization
- Approximate strip packing: revisited
- Approximating vector scheduling: almost matching upper and lower bounds
- Approximation Algorithms for 3D Orthogonal Knapsack
- Approximation algorithms for knapsack problems with cardinality constraints
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation algorithms for NP-hard problems.
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Approximation schemes for scheduling on parallel machines
- Beating the harmonic lower bound for online bin packing
- Better approximation algorithms for bin covering
- Better Bounds for Online Scheduling
- Bin packing can be solved within 1+epsilon in linear time
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Bin packing with fixed number of bins revisited
- Book review of: A. Agnetis et al., Multiagent scheduling. Models and algorithms
- Bounds for Certain Multiprocessing Anomalies
- Bounds for online bounded space hypercube packing
- Carathéodory bounds for integer cones
- Completeness in approximation classes
- Constructive discrepancy minimization by walking on the edges
- Coordination Complexity of Parallel Price-Directive Decomposition
- Differential approximation algorithms for some combinatorial optimization problems
- Exact algorithms and APX-hardness results for geometric packing and covering problems
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
- Faster approximation schemes for the two-dimensional knapsack problem
- Geometric algorithms and combinatorial optimization
- Handbook of Approximation Algorithms and Metaheuristics
- Harmonic algorithm for 3-dimensional strip packing problem
- Heuristic algorithms for on-line packing in three dimensions
- scientific article; zbMATH DE number 1670659 (Why is no real title available?)
- scientific article; zbMATH DE number 6678949 (Why is no real title available?)
- scientific article; zbMATH DE number 4130003 (Why is no real title available?)
- scientific article; zbMATH DE number 6118219 (Why is no real title available?)
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 52589 (Why is no real title available?)
- scientific article; zbMATH DE number 3557207 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 566079 (Why is no real title available?)
- scientific article; zbMATH DE number 1003243 (Why is no real title available?)
- scientific article; zbMATH DE number 2016848 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 742967 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 2119702 (Why is no real title available?)
- scientific article; zbMATH DE number 871933 (Why is no real title available?)
- scientific article; zbMATH DE number 1445351 (Why is no real title available?)
- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
- Improved approximation algorithm for two-dimensional bin packing
- Improved Approximation for Vector Bin Packing
- Improved bound for online square-into-square packing
- Improved Lower Bound for Online Strip Packing
- Improved online algorithms for parallel job scheduling and strip packing
- Improved pseudo-polynomial-time approximation for strip packing
- Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations
- LATIN 2004: Theoretical Informatics
- Lower bounds for on-line two-dimensional packing algorithms
- Mathematical Foundations of Computer Science 2003
- Maximizing the total profit of rectangles packed into a rectangle
- Multi-budgeted matchings and matroid intersection via dependent rounding
- Multidimensional cube packing
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- New algorithms for an ancient scheduling problem.
- New Algorithms for Bin Packing
- New Approximability Results for 2-Dimensional Packing Problems
- New approximability results for two-dimensional bin packing
- New lower bounds for certain classes of bin packing algorithms
- Offline first-fit decreasing height scheduling of power loads
- On a dual version of the one-dimensional bin packing problem
- On approximating strip packing with a better ratio than 3/2
- On guillotine cutting sequences
- On Multidimensional Packing Problems
- On packing of squares and cubes
- On Packing Two-Dimensional Bins
- On some geometric methods in scheduling theory: A survey
- On strip packing with rotations
- On the online bin packing problem
- On the Sum-of-Squares algorithm for bin packing
- On the two-dimensional knapsack problem
- On Three-Dimensional Packing
- On weighted bipartite edge coloring
- On-line and off-line approximation algorithms for vector covering problems
- On-line bin packing ? A restricted survey
- On-line bin packing in linear time
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Online algorithms for a dual version of bin packing
- Online algorithms: a survey
- Online lower bounds via duality
- Online multidimensional load balancing
- Online square and cube packing
- Optimal analysis of best fit bin packing
- Optimal Online Algorithms for Multidimensional Packing Problems
- Orthogonal Packings in Two Dimensions
- Packing Rectangles into 2OPT Bins Using Rotations
- Packing small vectors
- Parameterized approximation scheme for the multiple knapsack problem
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
- Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems
- Polynomiality for bin packing with a constant number of item types
- Probabilistic analysis of algorithms for dual bin packing problems
- Rectangle packing with one-dimensional resource augmentation
- Resource constrained scheduling as generalized bin packing
- Shelf algorithms for on-line strip packing
- Shelf Algorithms for Two-Dimensional Packing Problems
- The accommodating function: A generalization of the competitive ratio
- The design of approximation algorithms
- The entropy rounding method in approximation algorithms
- The Loading Problem
- The multiplicative weights update method: a meta-algorithm and applications
- The optimal absolute ratio for online bin packing
- The relative worst order ratio for online algorithms
- The two-dimensional cutting stock problem revisited
- Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
- There is no asymptotic PTAS for two-dimensional vector packing
- There is no EPTAS for two-dimensional knapsack
- This side up!
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
- Tight bounds for online vector bin packing
- Tight bounds for online vector scheduling
- Two for One: Tight Approximation of 2D Bin Packing
- Two simple algorithms for bin covering
- Two-dimensional bin packing with one-dimensional resource augmentation
- Two-dimensional on-line bin packing problem with rotatable items.
- Two-dimensional online bin packing with rotation
- Two-dimensional packing problems: a survey
- Vector assignment problems: a general framework
- Vector assignment schemes for asymmetric settings
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(80)- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- Vector scheduling with rejection on a single machine
- Fast approximate PCPs for multidimensional bin-packing problems
- Best fit bin packing with random order revisited
- Exact solution techniques for two-dimensional cutting and packing
- Improved online algorithms for knapsack and GAP in the random order model
- Two-bar charts packing problem
- Techniques and results on approximation algorithms for packing circles
- 2DPackLib: a two-dimensional cutting and packing library
- Asynchronous optimization of part logistics routing problem
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Adaptive simulated annealing with greedy search for the circle bin packing problem
- Efficient 1-space bounded hypercube packing algorithm
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
- Irreducible bin packing and normality in routing open shop
- Fully dynamic bin packing revisited
- Algorithm for online 3-path vertex cover
- Online circle and sphere packing
- Two dimensional guillotine cutting stock and scheduling problem in printing industry
- Approximation algorithms for a virtual machine allocation problem with finite types
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem
- Online strip packing with polynomial migration
- A tight lower bound for the online bounded space hypercube bin packing problem
- Constant-ratio approximation for robust bin packing with budgeted uncertainty
- A posteriori analysis of the algorithms for two-bar charts packing problem
- Closing the Gap for Pseudo-Polynomial Strip Packing
- Best fit bin packing with random order revisited
- scientific article; zbMATH DE number 7559382 (Why is no real title available?)
- The container selection problem
- Adaptive Bin Packing with Overflow
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- Online bin packing of squares and cubes
- Approximation schemes for generalized \(2\)-dimensional vector packing with application to data placement
- Streaming algorithms for bin packing and vector scheduling
- Streaming algorithms for bin packing and vector scheduling
- Online bin packing of squares and cubes
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
- On data reduction for dynamic vector bin packing
- Tight approximation algorithms for geometric bin packing with skewed items
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Cutting and packing problems under uncertainty: literature review and classification framework
- Peak demand minimization via sliced strip packing
- There is no APTAS for 2-dimensional vector bin packing: revisited
- A Tight (3/2+ε) Approximation for Skewed Strip Packing.
- On Guillotine Separability of Squares and Rectangles.
- Three-Bar Charts Packing Problem
- A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority
- Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints
- A 4/3 OPT+2/3 approximation for big two-bar charts packing problem
- An improved approximation for packing big two-bar charts
- Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
- A PTAS for the horizontal rectangle stabbing problem
- (Re)packing equal disks into rectangle
- Algorithms for the bin packing problem with scenarios
- Max-min and 1-bounded space algorithms for the bin packing problem
- Comparing loading strategies for auto-trains: balancing efficiency with information requirements
- Two-dimensional bin packing, cutting stock, and open dimension problems: a survey of practical requirements
- Using helical polyhedron for online irregular strip packing problem with free rotations
- A polynomial mixed-integer linear programming model for two-dimensional guillotine strip packing problem
- A survey of online knapsack problems
- Tight approximation algorithms for 2D guillotine strip packing
- Updated estimates for algorithms for packing 2-bar charts in a strip
- Approximation algorithms for round-UFP and round-SAP
- Classification and evaluation of the algorithms for vector bin packing
- Solving the online on-demand warehousing problem
- Improved hardness of approximation for geometric bin packing
- New bounds on the price of anarchy of selfish bin packing with partial punishment
- Online packing to minimize area or perimeter
- 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
- Random-order online independent set of intervals and hyperrectangles
- Cost-sharing mechanisms for the selfish maximum open-end bin packing problem
- On approximation schemes for stabbing rectilinear polygons
- Max-min and 1-bounded space algorithms for the bin packing problem
- Improved approximation algorithms for three-dimensional knapsack
- Improved approximation guarantees for advertisement placement
- An APTAS for bin packing with clique-graph conflicts
This page was built for publication: Approximation and online algorithms for multidimensional bin packing: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2400930)
