Probabilistic analysis for simple one- and two-dimensional bin packing algorithms (Q1149248): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Orthogonal Packings in Two Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stochastic model of bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4161330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Fast algorithms for bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Bin Packing / rank
 
Normal rank

Latest revision as of 10:29, 13 June 2024

scientific article
Language Label Description Also known as
English
Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
scientific article

    Statements

    Probabilistic analysis for simple one- and two-dimensional bin packing algorithms (English)
    0 references
    1980
    0 references
    approximation algorithm
    0 references
    expected performance
    0 references
    NP-complete problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references