Average-case analysis of cutting and packing in two dimensions (Q582210): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Shelf Algorithms for Two-Dimensional Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected performance of the shelf heuristic for 2-dimensional packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-fit allocation of queues: Tight probabilistic bounds on wasted space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Packing Squares: A Probabilistic Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A provably efficient algorithm for dynamic storage allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Next-fit bin packing with random piece sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of simple stochastic online bin packing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional packing: expected performance of simple level algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple on-line bin-packing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3026343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Bounds for the Stochastic Upward Matching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average-case analysis of some on-line algorithms for bin packing / rank
 
Normal rank

Revision as of 11:13, 20 June 2024

scientific article
Language Label Description Also known as
English
Average-case analysis of cutting and packing in two dimensions
scientific article

    Statements

    Average-case analysis of cutting and packing in two dimensions (English)
    0 references
    1990
    0 references
    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.
    0 references
    0 references
    average-case analysis
    0 references
    two-dimensional packing
    0 references
    cutting
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references