Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (Q490206)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items |
scientific article; zbMATH DE number 6389164
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items |
scientific article; zbMATH DE number 6389164 |
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
0 references
0 references
0 references
0 references
0 references
0 references
0.8251852989196777
0 references
0.7952011823654175
0 references
0.7798759937286377
0 references
0.7797631621360779
0 references
0.7781715393066406
0 references
