mlsanityData to 14 Oct 2026

The Subset Sum Matching Problem

arXiv 2508.19218 ↗First posted 26 Aug 2025cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 25 references that are in the map. First posted on arXiv 26 Aug 2025.

Builds on

2 of 25 references.

References · 2

  1. 2020Reinforcement Learning for Combinatorial Optimization: A Surveycited by 236
  2. 2016A Near-Linear Pseudopolynomial Time Algorithm for Subset Sumcited by 3

Built on by

Not cited yet.