Lower bounds for a bin packing problem with linear usage cost (Q1755229)
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: Lower bounds for a bin packing problem with linear usage cost |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for a bin packing problem with linear usage cost |
scientific article |
Statements
Lower bounds for a bin packing problem with linear usage cost (English)
0 references
9 January 2019
0 references
packing
0 references
combinatorial optimization
0 references
lower bounds
0 references
performance ratio
0 references
branch and bound
0 references
0 references
0 references
