\ Reid Example

\ Gurobi requires that the maximization field be EMPTY for our problems.
Maximize
  
Subject To
  e1: x1 + x6 = 1
  e2: x1 + x7 = 1
  e3: x2 + x6 + x8 = 1
  e4: x2 + x3 + x7 + x9 = 1
  e5: x3 + x10 = 1
  e6: x4 + x8 = 1
  e7: x4 + x5 + x9 = 1
  e8: x5 + x10 = 1
  e9: 2 x1 + 2 x2 + 2 x3 + 2 x4 + 2 x5 + 2 x6 + 2 x7 + 2 x8 + 2 x9 + 2 x10 = 8
Binary
  x1 x2 x3 x4 x5 x6 x7 x8 x9 x10
End