Heuristics for solving the bin-packing problem with conflicts (Q2898516)
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: Heuristics for solving the bin-packing problem with conflicts |
scientific article; zbMATH DE number 6054555
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristics for solving the bin-packing problem with conflicts |
scientific article; zbMATH DE number 6054555 |
Statements
11 July 2012
0 references
bin-packing
0 references
maximal clique
0 references
conflicts graph
0 references
maximal-stablesubset
0 references
Heuristics for solving the bin-packing problem with conflicts (English)
0 references
0.896388053894043
0 references
0.8750335574150085
0 references
0.8526290655136108
0 references
0.8427755236625671
0 references
0.8310894966125488
0 references
