Lower and upper bounds for the bin packing problem with fragile objects (Q406499)
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: Lower and upper bounds for the bin packing problem with fragile objects |
scientific article; zbMATH DE number 6341243
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower and upper bounds for the bin packing problem with fragile objects |
scientific article; zbMATH DE number 6341243 |
Statements
Lower and upper bounds for the bin packing problem with fragile objects (English)
0 references
8 September 2014
0 references
bin packing problem
0 references
fragile objects
0 references
variable neighborhood search
0 references
column generation
0 references
dual cuts
0 references
0 references
0 references
0.9321776628494264
0 references
0.8270925879478455
0 references
0.8077309727668762
0 references
0.7803240418434143
0 references
0.780090868473053
0 references
