Build (method = -2) #dp: 9037 Step-3' Graph: 1184 vertices and 3545 arcs (0.06s) Step-4' Graph: 890 vertices and 2957 arcs (0.06s) #V4/#V3 = 0.75 #A4/#A3 = 0.83 Ready! (0.06s) Optimize a model with 909 rows, 2958 columns and 7098 nonzeros Presolve removed 279 rows and 552 columns Presolve time: 0.05s Presolved: 630 rows, 2406 columns, 6754 nonzeros Variable types: 0 continuous, 2406 integer (0 binary) Optimize a model with 630 rows, 2406 columns and 6754 nonzeros Presolved: 630 rows, 2406 columns, 6754 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 4.513e+03 Factor NZ : 2.825e+04 (roughly 1 MByte of memory) Factor Ops : 2.369e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.36124407e+02 -2.16172431e+04 5.49e+04 1.16e-02 5.86e+01 0s 1 1.85023301e+02 -1.32764839e+04 8.01e+03 4.36e-02 1.02e+01 0s 2 8.67670976e+01 -5.43702418e+03 1.45e+03 1.95e-14 2.29e+00 0s 3 6.00926660e+01 -1.13742808e+03 1.71e+02 2.00e-15 3.65e-01 0s 4 4.69509670e+01 -3.96720602e+02 4.01e+01 1.92e-15 1.15e-01 0s 5 3.93465808e+01 -2.27941187e+02 2.02e+01 2.38e-15 6.53e-02 0s 6 3.38608571e+01 -1.34417192e+02 1.12e+01 1.92e-15 3.93e-02 0s 7 2.97056179e+01 -8.49012363e+01 4.56e+00 1.59e-15 2.53e-02 0s 8 2.66621920e+01 -3.25774477e+01 2.35e+00 1.37e-15 1.29e-02 0s 9 2.43448364e+01 -1.29772092e+01 1.16e+00 1.28e-15 7.98e-03 0s 10 2.21317469e+01 -2.21024612e+00 5.54e-01 1.36e-15 5.15e-03 0s 11 2.11812336e+01 5.99832449e+00 3.62e-01 1.46e-15 3.21e-03 0s 12 2.04093264e+01 1.22347616e+01 1.79e-01 1.42e-15 1.72e-03 0s 13 2.00468794e+01 1.92132341e+01 1.11e-03 1.06e-15 1.74e-04 0s 14 2.00004212e+01 1.99984710e+01 1.76e-12 1.03e-15 4.06e-07 0s 15 2.00000000e+01 2.00000000e+01 2.76e-12 8.88e-16 4.37e-13 0s Barrier solved model in 15 iterations and 0.06 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 1613 iterations, 0.08 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 20.0000000 20.00000 0.0% - 0s Explored 0 nodes (3347 simplex iterations) in 0.28 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.08 seconds Gurobi run time: 0.28 seconds Total run time: 0.36 seconds Objective: 20 Solution: 1 x [1, 3, 4, 5, 6, 7, 11] 2 x [1, 3, 4, 5, 7, 8] 1 x [1, 3, 4, 5, 7, 11, 13, 15, 16, 18] 7 x [1, 3, 5, 7, 9, 11, 14, 15, 16, 17, 18] 3 x [1, 3, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19] 1 x [2, 3, 4, 9, 11, 12, 13, 14, 15, 16, 19] 1 x [2, 3, 5, 7, 11, 12, 15, 16, 19] 2 x [3, 4, 5, 7, 8, 9, 10, 15, 17] 1 x [3, 4, 5, 7, 9, 15, 16, 19] 1 x [3, 6, 7, 8, 9, 11, 12, 13, 14]