Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (Q490206): 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: Q58644318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating column generation for variable sized bin-packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the variable size bin packing problem with discretized formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Sized Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the variable sized bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations and exact solution of the variable sized bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood search for the variable sized bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the variable sized bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for packing and scheduling problems. (Abstract of thesis) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Approximation Scheme for Variable-Sized Bin Packing / rank
 
Normal rank

Latest revision as of 13:50, 9 July 2024

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