New lower bounds for bin packing problems with conflicts (Q976310): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:49, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New lower bounds for bin packing problems with conflicts |
scientific article |
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
