Lower bounds for a bin packing problem with linear usage cost (Q1755229): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:33, 5 March 2024
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
