We consider mixed-integer sets of the type MIX TU = {x : Ax amp;#8805; b; xi integer, i amp;#8712; I}, where A is a totally unimodular matrix, b is an arbitrary vector and I is a nonempty subset of the column indices of A. We show that the problem of checking nonemptiness of a set MIX TU is NP-complete...