Abstract
The globalisation of corporations’ operations has produced a huge volume of inter-company invoices. Optimisation of those known as payment clearance can produce a significant saving in costs associated with those transfers and handling. The paper revises some common and so practical approaches to the payment clearance problem and proposes some novel algorithms based on graphs theory and heuristic totals’ distribution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
V. Srinivasan and Y. H Kim, “Payments netting in international cash management: a network optimization approach”, Journal of International Business Studies, vol 17(2), 1986, pp. 1-20,
M.M. Güntzer, D. Jungnickel, and M. Leclerc, “Efficient algorithms for the clearing of interbank payments,” European Journal of Operational Research, vol. 106, pp. 212–219, 1998.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, New-York: Freeman, 2003.
Y.M. Shafransky, A.A. Doudkin, “An optimization algorithm for the clearing of interbank payments,” European Journal of Operational Research, vol. 171(3), pp.743-749, 2006.
D.S. Johnson and M.A. Trick, “Cliques, Colouring and Satisfiability: Second DIMACS Implementation Challenge,” DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, vol. 26, 1996.
A. Datta, U. Derigs, and H. Thomas, “Scalable Payments Netting in Electronic Commerce”, working paper, 2003.
J. Chomicki, S. Naqvi, and M.F. Pucci, “Decentralized Micropayment Consolidation,” 18th IEEE International Conference on Distributed Computing Systems (ICDCS’98), pp. 332-341, 1998.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media B.V.
About this paper
Cite this paper
Kumlander, D. (2010). Some Practical Payments Clearance Algorithms. In: Elleithy, K. (eds) Advanced Techniques in Computing Sciences and Software Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-3660-5_52
Download citation
DOI: https://doi.org/10.1007/978-90-481-3660-5_52
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-3659-9
Online ISBN: 978-90-481-3660-5
eBook Packages: Computer ScienceComputer Science (R0)