The stochastic generalized bin packing problem (Q423955): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q58644411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4162318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-stage stochastic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Line Bin Packing with Items of Random Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Bin Packing with Items of Random Sizes III / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stochastic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the Auto-Carrier Transportation Problem / rank
 
Normal rank

Revision as of 06:29, 5 July 2024

scientific article
Language Label Description Also known as
English
The stochastic generalized bin packing problem
scientific article

    Statements

    The stochastic generalized bin packing problem (English)
    0 references
    0 references
    0 references
    0 references
    30 May 2012
    0 references
    generalized bin packing
    0 references
    random item profit
    0 references
    extreme values
    0 references
    deterministic approximation
    0 references

    Identifiers