On-line bin packing ? A restricted survey (Q4845093): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a dual version of the one-dimensional bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A algorithm for two-dimensional packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Packings in Two Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shelf Algorithms for Two-Dimensional Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for on-line two-dimensional packing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Does randomization help in on-line 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: Multidimensional on-line bin packing: Algorithms and worst-case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line algorithm for variable-sized bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms for a dual version of bin packing / 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: Next-fit packs a list and its reverse into the same number of bins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Sized Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Lower Bound for On-Line Bin-Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3483093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3988808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case / 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: Repacking helps in bounded space on-line bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource constrained scheduling as generalized bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Multiprocessor Scheduling with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Certain Nonlinear Recurring Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773321 / 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: Online variable-sized bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional Bin Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems / 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: Tight Worst-Case Performance Bounds for Next-<i>k</i>-Fit Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best \(k\)-fit 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: Improved bounds for harmonic-based bin packing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximation of Numbers as Sums of Reciprocals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2.5 times optimal algorithm for packing in two dimensions / 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

Latest revision as of 17:05, 23 May 2024

scientific article; zbMATH DE number 792547
Language Label Description Also known as
English
On-line bin packing ? A restricted survey
scientific article; zbMATH DE number 792547

    Statements

    On-line bin packing ? A restricted survey (English)
    0 references
    0 references
    0 references
    0 references
    4 September 1995
    0 references
    0 references
    survey
    0 references
    approximation
    0 references
    on-line bin packing
    0 references
    lower bounds on worst ratios
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references