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
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:06, 30 January 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
22 January 2015
0 references
bin packing
0 references
column generation
0 references
branch-and-price
0 references
beam search
0 references
