Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (Q490206)

From MaRDI portal
Revision as of 13:51, 28 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q58644318, #quickstatements; #temporary_batch_1711626644914)
scientific article
Language Label Description Also known as
English
Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
scientific article

    Statements

    Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 January 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    bin packing
    0 references
    column generation
    0 references
    branch-and-price
    0 references
    beam search
    0 references
    0 references
    0 references