Heuristic evaluation techniques for bin packing approximation algorithms (Q1083199): 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: ``A posteriori'' evaluation of bin packing approximation algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of theorem-proving procedures / 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 16:22, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristic evaluation techniques for bin packing approximation algorithms |
scientific article |
Statements
Heuristic evaluation techniques for bin packing approximation algorithms (English)
0 references
1985
0 references
performance analysis
0 references
any fit decreasing algorithms
0 references
