BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (Q1362971)
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: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem |
scientific article; zbMATH DE number 1045748
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem |
scientific article; zbMATH DE number 1045748 |
Statements
BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (English)
0 references
7 August 1997
0 references
one-dimensional bin packing
0 references
meta-strategy tabu search
0 references
branch and bound
0 references
0.8010240197181702
0 references
0.7946166396141052
0 references
0.7902398705482483
0 references
0.781227707862854
0 references
0.7792797088623047
0 references
