Build (method = -2) #dp: 909 Step-3' Graph: 52 vertices and 145 arcs (0.00s) Step-4' Graph: 7 vertices and 55 arcs (0.00s) #V4/#V3 = 0.13 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 17 rows, 56 columns and 162 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 15 rows, 54 columns, 158 nonzeros Variable types: 0 continuous, 54 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 839.0000000 Optimize a model with 15 rows, 54 columns and 158 nonzeros Presolved: 15 rows, 54 columns, 158 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.700e+01 Factor NZ : 1.200e+02 Factor Ops : 1.240e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.24262972e+03 -6.04438898e+03 8.62e+02 2.22e-16 2.36e+02 0s 1 8.26412066e+02 -2.71696548e+03 5.13e+01 4.44e-16 3.70e+01 0s 2 4.23808393e+02 -6.74506520e+01 3.24e-02 3.33e-16 4.20e+00 0s 3 2.15171794e+02 1.23695976e+02 2.25e-03 2.22e-16 7.76e-01 0s 4 2.00595722e+02 1.94678154e+02 3.34e-05 1.11e-16 5.01e-02 0s 5 2.00013001e+02 1.98944267e+02 3.95e-06 1.11e-16 9.06e-03 0s 6 2.00000025e+02 1.99999922e+02 3.88e-11 2.22e-16 8.73e-07 0s 7 2.00000000e+02 2.00000000e+02 4.87e-14 1.11e-16 2.42e-12 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 2.00000000e+02 Root relaxation: objective 2.000000e+02, 45 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 200.0000000 200.00000 0.0% - 0s Explored 0 nodes (45 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+02, best bound 2.000000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 200 Solution: 1 x [3, 4, 5, 6, 7] 13 x [4, 5, 6, 7, 8] 55 x [2, 5, 6, 8, 9] 2 x [2, 3, 5, 6, 7] 6 x [2, 4, 5, 5, 7] 23 x [1, 4, 5, 5, 5] 3 x [3, 5, 5, 5, 6] 97 x [1, 4, 7, 8, 10]