Search

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2004.09.003 Byline: Yakov M. Shafransky, Alexander A. Doudkin Keywords: OR in banking; Combinatorial optimization; Complexity; Heuristics Abstract: We consider the clearing of interbank payments under limited amount of money used by banks for the maintenance of the clearing process. We show that the corresponding discrete optimization problem is non-approximable and propose a fast heuristic for solving the problem. The results of computational experiments demonstrate the high quality of solutions. Author Affiliation: United Institute of Informatics Problems, National Academy of Sciences of Belarus, Surganov str. 6, 220012 Minsk, Belarus