On-line algorithms for 2-space bounded 2-dimensional bin packing (Q456101): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Packing Two-Dimensional Bins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded space on-line bin packing: Best is better than first / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online square and cube packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line grid-packing with a single active grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online removable square packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing rectangles into the unit square / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line Packing Squares into n Unit Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line packing sequences of cubes in the unit cube / rank
 
Normal rank

Latest revision as of 20:02, 5 July 2024

scientific article
Language Label Description Also known as
English
On-line algorithms for 2-space bounded 2-dimensional bin packing
scientific article

    Statements