| Article ID: | iaor2007772 |
| Country: | Netherlands |
| Volume: | 171 |
| Issue: | 3 |
| Start Page Number: | 743 |
| End Page Number: | 749 |
| Publication Date: | Jun 2006 |
| Journal: | European Journal of Operational Research |
| Authors: | Shafransky Yakov M., Doudkin Alexander A. |
| Keywords: | heuristics, optimization, combinatorial optimization |
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.