Packings in two dimensions: Asymptotic average-case analysis of algorithms (Q1209735): 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: Dynamic Bin Packing / 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 stochastic model of bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624436 / 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: Probability Inequalities for Sums of Bounded Random Variables / 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: On-line bin packing in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for minimax grid matching with applications to the average case analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case analysis of the modified harmonic algorithm / 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 15:43, 17 May 2024

scientific article
Language Label Description Also known as
English
Packings in two dimensions: Asymptotic average-case analysis of algorithms
scientific article

    Statements

    Packings in two dimensions: Asymptotic average-case analysis of algorithms (English)
    0 references
    0 references
    16 May 1993
    0 references
    cutting stock problems
    0 references
    two-dimensional packing
    0 references
    asymptotic average-case analysis
    0 references
    off-line algorithm
    0 references
    on-line shelf packings
    0 references
    dynamic packing
    0 references
    bin-packing
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references