Drawer algorithms for 1-space bounded multidimensional hyperbox packing (Q2424663): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-018-0338-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2887600624 / 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: Two-dimensional rectangle packing: On-line methods and results / 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: A note on one-space bounded square 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: Beating the Harmonic Lower Bound for Online Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online packing of rectangular items into square bins / 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: A simple on-line bin-packing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for on-line bin packing / 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: On the online bin packing problem / 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: Improved Space for Bounded-Space, On-Line Bin-Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Bin Packing / 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: Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms for 1-space bounded 2-dimensional bin packing and square packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-space bounded online cube and hypercube packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line Packing Cubes into $n$ Unit Cubes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:06, 19 July 2024

scientific article
Language Label Description Also known as
English
Drawer algorithms for 1-space bounded multidimensional hyperbox packing
scientific article

    Statements

    Drawer algorithms for 1-space bounded multidimensional hyperbox packing (English)
    0 references
    0 references
    0 references
    25 June 2019
    0 references
    online algorithms
    0 references
    bin packing
    0 references
    multidimensional
    0 references
    one-space bounded
    0 references

    Identifiers