Exact and approximate methods for a one-dimensional minimax bin-packing problem (Q363606)
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: Exact and approximate methods for a one-dimensional minimax bin-packing problem |
scientific article; zbMATH DE number 6203961
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact and approximate methods for a one-dimensional minimax bin-packing problem |
scientific article; zbMATH DE number 6203961 |
Statements
Exact and approximate methods for a one-dimensional minimax bin-packing problem (English)
0 references
3 September 2013
0 references
one-dimensional bin-packing
0 references
combinatorial optimization
0 references
integer programming
0 references
simulated annealing
0 references
test splitting
0 references
0 references
0 references
0.7642931938171387
0 references
0.7551730871200562
0 references
0.7544851899147034
0 references
0.7520672678947449
0 references
0.7520672678947449
0 references
