An optimization algorithm for the clearing of interbank payments

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.