Build (method = -2) #dp: 4010 Step-3' Graph: 616 vertices and 1841 arcs (0.03s) Step-4' Graph: 440 vertices and 1489 arcs (0.03s) #V4/#V3 = 0.71 #A4/#A3 = 0.81 Ready! (0.03s) Optimize a model with 457 rows, 1490 columns and 3594 nonzeros Presolve removed 127 rows and 245 columns Presolve time: 0.01s Presolved: 330 rows, 1245 columns, 3395 nonzeros Variable types: 0 continuous, 1245 integer (0 binary) Found heuristic solution: objective 75.0000000 Optimize a model with 330 rows, 1245 columns and 3395 nonzeros Presolved: 330 rows, 1245 columns, 3395 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.313e+03 Factor NZ : 1.177e+04 Factor Ops : 6.014e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.48923308e+02 -1.95922654e+04 2.16e+04 2.22e-16 5.40e+01 0s 1 2.33112764e+02 -1.00384156e+04 3.41e+03 6.66e-16 1.05e+01 0s 2 1.41107845e+02 -3.90322660e+03 8.75e+02 1.33e-15 3.00e+00 0s 3 8.22078136e+01 -7.01418179e+02 1.21e+02 7.49e-16 4.67e-01 0s 4 6.35328326e+01 -2.91616526e+02 2.27e+01 4.58e-16 1.64e-01 0s 5 5.37039393e+01 -1.42699348e+02 8.38e+00 4.16e-16 8.43e-02 0s 6 4.42766001e+01 -6.25265670e+01 4.36e+00 3.09e-16 4.50e-02 0s 7 4.05300213e+01 -7.87775565e+00 1.23e+00 4.65e-16 1.98e-02 0s 8 3.86192655e+01 1.99476702e+01 2.55e-01 3.37e-16 7.55e-03 0s 9 3.80052050e+01 3.79517609e+01 8.73e-05 5.82e-16 2.14e-05 0s 10 3.80000053e+01 3.79999518e+01 4.40e-14 3.78e-16 2.14e-08 0s 11 3.80000000e+01 3.80000000e+01 1.46e-13 4.81e-16 2.14e-11 0s Barrier solved model in 11 iterations and 0.02 seconds Optimal objective 3.80000000e+01 Root relaxation: objective 3.800000e+01, 701 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 38.0000000 38.00000 0.0% - 0s Explored 0 nodes (701 simplex iterations) in 0.06 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.800000000000e+01, best bound 3.800000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.06 seconds Total run time: 0.10 seconds Objective: 38 Solution: 5 x [1, 2, 4, 5, 9] 1 x [1, 2, 9, 10, 16] 2 x [1, 2, 9, 16] 2 x [1, 3, 6, 7, 8, 9] 2 x [1, 6, 7, 8, 9] 1 x [1, 9, 10, 13, 16, 17] 1 x [1, 9, 10, 16] 7 x [2, 3, 4, 6, 9, 10, 11, 15, 16] 2 x [2, 9] 5 x [3, 6, 8, 9] 1 x [6, 9, 13] 3 x [8, 9, 10, 11, 13, 14] 1 x [9, 10, 13, 16, 17] 1 x [9, 11, 12, 13] 1 x [9, 11, 12, 13, 14] 1 x [9, 11, 13, 17] 2 x [9, 14]