TUM Theorem

• An integer matrix A is TUM if

  • All entries are -1, 0 or 1
  • At most two non-zero entries appear in any column
  • The rows of A can be partitioned into two disjoint sets such that
    • If a column has two entries of the same sign, their rows are in different sets.
    • If a column has two entries of different signs, their rows are in the same set.

• The MCNFP constraint matrices are TUM.

Previous slide

Next slide

Back to first slide

View graphic version