Bin packing: Maximizing the number of pieces packed (Q1133327): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bin packing: Maximizing the number of pieces packed / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank | |||
Normal rank | |||
Latest revision as of 02:43, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bin packing: Maximizing the number of pieces packed |
scientific article |
Statements
Bin packing: Maximizing the number of pieces packed (English)
0 references
1978
0 references
bin packing
0 references
storage allocation
0 references
task sequencing
0 references
