More on batched bin packing (Q1785762): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2016.02.006 / rank
Normal rank
 
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.1016/j.orl.2016.02.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2252413103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing / 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: The optimal absolute ratio for online bin packing / rank
 
Normal rank
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: On the absolute approximation ratio for first fit and related results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource augmentation for online bounded space bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batched bin packing revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Bin Packing with Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bin Packing with Conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing can be solved within 1+epsilon in linear time / 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: Repacking helps in bounded space on-line bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batched bin packing / 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: An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the online bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4290987 / 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 / DOI
 
Property / DOI: 10.1016/J.ORL.2016.02.006 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:12, 11 December 2024

scientific article
Language Label Description Also known as
English
More on batched bin packing
scientific article

    Statements

    More on batched bin packing (English)
    0 references
    0 references
    1 October 2018
    0 references
    bin packing
    0 references
    approximation ratio
    0 references
    batched problems
    0 references

    Identifiers