| This feels like a marketing piece without any good content. The way it's described, it's not a knapsack problem at all. The knapsack problem is to maximize the total value of the items you fit into the container. In reconciliation, you presumably want to get the best matching between transactions, which is not defined here, and in any case is a completely different problem. Ignoring the knapsack comparison, the article doesn't describe why you'd want to check each possible combination. Assuming the individual amounts are correct, you can do each batch separately - no need to check each combination within one batch with each combination of a different batch. (And if you drop that assumption, that still won't be a sensible thing to do). I can imagine you can have a "scoring" algorithm that gives a confidence score for a match - then if you check every combination, you can pick the combination with the best overall score. But the article doesn't actually describe anything like that. It also doesn't describe any alternatives to "AI". For example, what about a greedy algorithm? What about alternative methods to do address comparisons? I'm sure there are issues with those, but none of that is described here. |
Combinatorics: Check
Algorithms: Check
Real world problem: Check
Crowbarred connection between 1-3 to show how your AI algorithm is better? Check