Computing the asymptotic worst-case of bin packing lower bounds (Q2643960): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/eor/CrainicPPT07, #quickstatements; #temporary_batch_1731475607626
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: An analysis of lower bound procedures for the bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bin packing fast lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: New classes of fast lower bounds for bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Vehicle Routing on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and reduction procedures for the bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/eor/CrainicPPT07 / rank
 
Normal rank

Latest revision as of 07:06, 13 November 2024

scientific article
Language Label Description Also known as
English
Computing the asymptotic worst-case of bin packing lower bounds
scientific article

    Statements

    Computing the asymptotic worst-case of bin packing lower bounds (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 August 2007
    0 references
    packing
    0 references
    bin packing lower bounds
    0 references
    asymptotic worst-case analysis
    0 references

    Identifiers