A greedy heuristic for 3-partitioning with similar elements (Q685863)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A greedy heuristic for 3-partitioning with similar elements |
scientific article; zbMATH DE number 425524
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A greedy heuristic for 3-partitioning with similar elements |
scientific article; zbMATH DE number 425524 |
Statements
A greedy heuristic for 3-partitioning with similar elements (English)
0 references
18 October 1993
0 references
A greedy-type algorithm for a special bin packing problem is described and a tight bound for its relative error is obtained. The bound depends on the ratio \(\beta\) between the greatest and the smallest elements and is valid when \(1\leq \beta\leq 4\).
0 references
greedy-type algorithm
0 references
bin packing
0 references
0.7978056073188782
0 references
0.7911000847816467
0 references
0.7842057347297668
0 references
0.7585631012916565
0 references
0.7584670186042786
0 references
