method
active
method:dynamic-programming-subset-sum-payment-resolution

dynamic-programming subset-sum payment resolution

Algorithm that finds the minimum-overpay combination of discrete money cards to meet a payment amount with no change given.

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.