Construct · 1 fields · 1 citations

bin packing problem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
bin packingproblem1 CONSTRUCTBin packing problemJOHNSON · ALGORITHMS AND DATA

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Algorithms and data structures

the NP-hard task of placing items of given sizes into the fewest fixed-capacity bins, with worst-case bounds proved for simple heuristics such as first fit.

In algorithms and data structures, bin packing problem refers to the NP-hard task of placing items of given sizes into the fewest fixed-capacity bins, with worst-case bounds proved for simple heuristics such as first fit. This meaning comes from Johnson (1974) in SIAM Journal on Computing.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how bin packing problem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

packing2 fields · 2 citationsjingle · one word, two carrierssimple2 fields · 2 citationsjingle · one word, two constructs

References

  1. Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., & Graham, R. L. (1974). Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms. SIAM Journal on Computing, 3(4), 299-325. https://doi.org/10.1137/0203025

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct