26 citations · 31 across the 6 of their papers we have counts for
1 paper · 1 filter
Constantin Enea, Peter Habermehl, Omar Inverso +1
We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs.…