A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980)
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: A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint |
scientific article; zbMATH DE number 5826010
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint |
scientific article; zbMATH DE number 5826010 |
Statements
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (English)
0 references
13 December 2010
0 references
bin packing
0 references
column generation
0 references
branch-and-price
0 references
0 references
0 references
0 references
0 references
