Picture for Alberto Pozanco Lancho

Alberto Pozanco Lancho

The Subset Sum Matching Problem

Add code
Aug 26, 2025
Yufei Wu, Manuel R. Torres, Parisa Zehtabi, Alberto Pozanco Lancho, Michael Cashmore, Daniel Borrajo, Manuela Veloso
Figure 1 for The Subset Sum Matching Problem
Figure 2 for The Subset Sum Matching Problem
Figure 3 for The Subset Sum Matching Problem
Figure 4 for The Subset Sum Matching Problem

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.

* Paper accepted at ECAI 2025. This is an extended version that includes Supplementary Material 
Viaarxiv icon
Github IconAccess Paper or Ask Questions
Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon