Average-case analysis of cutting and packing in two dimensions
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial optimization (90C27)
The paper presents some illustrative results in the average-case analysis of algorithms for two-dimensional packing. Several cutting and packing algorithms are given with their probabilistic analysis. Some open problems are discussed.
- A class of simple stochastic online bin packing algorithms
- A provably efficient algorithm for dynamic storage allocation
- A simple on-line bin-packing algorithm
- A typology of cutting and packing problems
- Algorithms for Packing Squares: A Probabilistic Analysis
- Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics
- Exact Bounds for the Stochastic Upward Matching Problem
- Expected performance of the shelf heuristic for 2-dimensional packing
- First-fit allocation of queues: Tight probabilistic bounds on wasted space
- scientific article; zbMATH DE number 4014028 (Why is no real title available?)
- Next-fit bin packing with random piece sizes
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Shelf Algorithms for Two-Dimensional Packing Problems
- The average-case analysis of some on-line algorithms for bin packing
- Two-dimensional packing: expected performance of simple level algorithms
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Packing problems
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Exact algorithms for the guillotine strip cutting/packing problem.
- Average-case performance analysis of a 2D strip packing algorithm -- NFDH
- Two-dimensional packing problems: a survey
- A simulated annealing approach to the nesting problem in the textile manufacturing industry
- The nesting problem in the leather manufacturing industry
- Interactive procedures in large-scale two-dimensional cutting stock problems
- A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
- Triple-solution approach for the strip packing problem with two-staged patterns
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
- scientific article; zbMATH DE number 176070 (Why is no real title available?)
- Packing, covering and tiling in two-dimensional spaces
- Fuzzy bin packing problem.
This page was built for publication: Average-case analysis of cutting and packing in two dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582210)
