Algorithms for the bin packing problem with conflicts (Q2899071)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6060484
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for the bin packing problem with conflicts |
scientific article; zbMATH DE number 6060484 |
Statements
28 July 2012
0 references
bin packing with conflicts
0 references
vertex coloring
0 references
lower bounds heuristics
0 references
branch and price
0 references
0.94174755
0 references
0.9394938
0 references
0 references
0 references
0.93553233
0 references
0.93553233
0 references
0.9199075
0 references
0.9188949
0 references
Algorithms for the bin packing problem with conflicts (English)
0 references
