Linear Programming, Kakuro Puzzles, Gurobi, Puzzle Game, Discrete Optimization.
The numbers 1–9 can appear at most once in that horizontal run. We refer to this as the horizontal clue uniqueness constraint. The numbers we choose in the empty cells must sum up to the value of the horizontal clue. We refer to this as the horizontal sum constraint. In order to characterize these