Lower bounds for a bin packing problem with linear usage cost (Q1755229): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2018.10.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2897983212 / rank | |||
Normal rank | |||
Revision as of 21:09, 19 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
