.png){kind=icon}
.png){kind=icon}
Return
Solving the market split problem with lattice enumeration
.png){kind=icon}
OA
AI
DOI：10.1007/s12532-026-00328-z.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The market split problem was proposed by Cornuéjols and Dawande in 1998 as benchmark problem for algorithms solving linear systems with binary variables. The recent (2025) Quantum Optimization Benchmark Library (QOBLIB) contains a set of feasible instances of the market split problem. In QOBLIB an instance of the market split problem is considered as solved as soon as at least one feasible solution has been found. The market split problem seems to be difficult to solve with the conventional branch-and-cut approach of integer linear programming software which reportedly can handle QOBLIB instances up to $$m=7$$ . In contrast, a new GPU implementation of the Schroeppel–Shamir algorithm solves instances up to $$m=11$$ . In this note we report about experiments with an algorithm that reduces the market split problem to a lattice problem. With the author’s most recent implementation – named solvediophant – instances of the QOBLIB market split benchmark problems can be solved up to $$m=14$$ on a standard computer.
Keywords:
Market split problem
Integer linear programming
Lattice enumeration
Lattice basis reduction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.