How might one find integer solutions to:
$$ \textrm{diag}(x)Ax = Bx $$
$A$ and $B$ are integer-valued, square, non-invertible, sparse, and large. The values of $x$ should be $0$ or $1$ (ideally; constraint can be relaxed to include all integers). Are there techniques out there besides MIP?