Find link

language:

Find link is a tool written by Edward Betts.

searching for Bin packing problem 6 found (37 total)

Strong NP-completeness (642 words) [view diff] exact match in snippet view article find links to article

problem may have numerical parameters. For example, the input to the bin packing problem is a list of objects of specific sizes and a size for the bins that

Configuration linear program (2,473 words) [view diff] exact match in snippet view article find links to article

solutions using only a polynomial number of configurations. In the bin packing problem, there are n items with different sizes. The goal is to pack the

Next-fit-decreasing bin packing (468 words) [view diff] case mismatch in snippet view article find links to article

David (1994-04-01). "Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures". Operations Research. 42 (2): 287–298

Unit fraction (2,978 words) [view diff] exact match in snippet view article find links to article

scheduling problem can only come from a solution to the unit fraction bin packing problem with the channels as bins and the fractions 1 / k {\displaystyle

Harmonic bin packing (1,359 words) [view diff] exact match in snippet view article find links to article

1016/0196-6774(89)90031-X. hdl:2142/74206. Seiden, Steven S. (2002). "On the online bin packing problem". Journal of the ACM. 49 (5): 640–671. doi:10.1145/585265.585269

First-fit bin packing (2,556 words) [view diff] no match in snippet view article find links to article

(August 2010). "Tighter bounds of the First Fit algorithm for the bin-packing problem". Discrete Applied Mathematics. 158 (15): 1668–1675. doi:10.1016/j