A set-covering-based heuristic approach for bin-packing problems (Q2892273)
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 set-covering-based heuristic approach for bin-packing problems |
scientific article; zbMATH DE number 6047389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A set-covering-based heuristic approach for bin-packing problems |
scientific article; zbMATH DE number 6047389 |
Statements
18 June 2012
0 references
two-constraint bin-packing
0 references
two-dimensional bin-packing
0 references
set-covering heuristics
0 references
A set-covering-based heuristic approach for bin-packing problems (English)
0 references
0.8038994073867798
0 references
0.8026996850967407
0 references
0.8022817969322205
0 references
0.7996934652328491
0 references
