New lower bounds for bin packing problems with conflicts (Q976310)
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: New lower bounds for bin packing problems with conflicts |
scientific article; zbMATH DE number 5720318
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New lower bounds for bin packing problems with conflicts |
scientific article; zbMATH DE number 5720318 |
Statements
New lower bounds for bin packing problems with conflicts (English)
0 references
11 June 2010
0 references
bin packing with conflicts
0 references
Knapsack problem
0 references
lower bounds
0 references
chordal graphs
0 references
tree-decomposition
0 references
dual-feasible functions
0 references
0 references
0 references
0.8520045876502991
0 references
0.8512254357337952
0 references
0.8300339579582214
0 references
0.8215722441673279
0 references
0.8084208965301514
0 references
