The Subset Sum Matching Problem
Artificial Intelligence
2025-08-27 v1
Abstract
This paper presents a new combinatorial optimisation task, the Subset Sum Matching Problem (SSMP), which is an abstraction of common financial applications such as trades reconciliation. We present three algorithms, two suboptimal and one optimal, to solve this problem. We also generate a benchmark to cover different instances of SSMP varying in complexity, and carry out an experimental evaluation to assess the performance of the approaches.
Cite
@article{arxiv.2508.19218,
title = {The Subset Sum Matching Problem},
author = {Yufei Wu and Manuel R. Torres and Parisa Zehtabi and Alberto Pozanco Lancho and Michael Cashmore and Daniel Borrajo and Manuela Veloso},
journal= {arXiv preprint arXiv:2508.19218},
year = {2025}
}
Comments
Paper accepted at ECAI 2025. This is an extended version that includes Supplementary Material