Lower bounds for a bin packing problem with linear usage cost (Q1755229): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129037857, #quickstatements; #temporary_batch_1725406550273 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129037857 / rank | |||
Normal rank | |||
Revision as of 00:41, 4 September 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
0 references
0 references
