A lower bound for online rectangle packing (Q2331592): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q127824340, #quickstatements; #temporary_batch_1722203565125
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: New lower bounds for certain classes of bin packing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound for 3-batched bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for classic online bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for several online variants of bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for online bin packing with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional on-line bin packing: Algorithms and worst-case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line algorithm for multidimensional bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional rectangle packing: On-line methods and results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional online bin packing with rotation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online square and cube packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Online Algorithms for Multidimensional Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional on-line bin packing problem with rotatable items. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds for the online bin packing problem with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3988808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on online hypercube packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound 2.5545 on 2D Online 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: New bounds for multidimensional packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved lower bound for on-line bin packing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ordered Open-End Bin-Packing Problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127824340 / rank
 
Normal rank

Latest revision as of 23:06, 28 July 2024

scientific article
Language Label Description Also known as
English
A lower bound for online rectangle packing
scientific article

    Statements

    A lower bound for online rectangle packing (English)
    0 references
    0 references
    29 October 2019
    0 references
    rectangle packing
    0 references
    online algorithms
    0 references
    competitive ratio
    0 references

    Identifiers