[Kmymoney-devel] patch containing an algorithm for automatic reconciliation

[Cristian Oneţ]

Hi,

I've attached a patch that contains an implementation of this algorithm:
http://en.wikipedia.org/wiki/Subset_sum_problem#Polynomial_time_approximate_algorithm
that can be used for the automatic reconciliation feature. It's only connected 
in the application for testing purposes. The algorithm is called when pressing 
'Finish' on the reconciliation balance dialog, it's results can be seen on the 
output of the application.
It's performance depends largely on the number of transactions passed to it 
and on the precision of the account. I've tested it with 17 transactions 
having values ranging between 0,01 and 6000 and the results were acceptable 
however at this precision if the transactions count grew to about 20 then the 
algorithm's performance would become useless. This means that, if we are to 
use this, some checking should be implemented that guarantees a result within 
a reasonable time frame and computer resources. If these performance 
constraints would not be met than the algorithm should fail.

Any thoughts?

-- 
Regards,

Cristian Oneţ
-------------- next part --------------
A non-text attachment was scrubbed...
Name: automatic_reconciliation.patch
Type: text/x-patch
Size: 5345 bytes
Desc: not available
Url : http://mail.kde.org/pipermail/kmymoney-devel/attachments/20100228/c9786d8e/attachment.patch 
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 198 bytes
Desc: This is a digitally signed message part.
Url : http://mail.kde.org/pipermail/kmymoney-devel/attachments/20100228/c9786d8e/attachment.sig