Build (method = -2) #dp: 8210 Step-3' Graph: 1092 vertices and 3269 arcs (0.06s) Step-4' Graph: 818 vertices and 2721 arcs (0.06s) #V4/#V3 = 0.75 #A4/#A3 = 0.83 Ready! (0.06s) Optimize a model with 837 rows, 2722 columns and 6534 nonzeros Presolve removed 256 rows and 504 columns Presolve time: 0.04s Presolved: 581 rows, 2218 columns, 6192 nonzeros Variable types: 0 continuous, 2218 integer (0 binary) Optimize a model with 581 rows, 2218 columns and 6192 nonzeros Presolved: 581 rows, 2218 columns, 6192 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.140e+03 Factor NZ : 2.618e+04 (roughly 1 MByte of memory) Factor Ops : 2.169e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.39170802e+03 -2.67618856e+05 4.93e+05 1.45e-02 6.21e+02 0s 1 1.97016622e+03 -1.64904177e+05 7.94e+04 1.74e-02 1.20e+02 0s 2 9.93159542e+02 -6.71306950e+04 1.58e+04 1.24e-03 2.92e+01 0s 3 6.25610111e+02 -1.37041294e+04 1.97e+03 1.78e-15 4.72e+00 0s 4 4.54215194e+02 -3.75891077e+03 2.82e+02 1.25e-15 1.12e+00 0s 5 4.20170415e+02 -2.57305061e+03 6.80e+01 1.26e-15 7.11e-01 0s 6 4.08481181e+02 -2.37759577e+03 6.00e+01 1.54e-15 6.59e-01 0s 7 3.82581676e+02 -1.54605239e+03 2.59e+01 1.76e-15 4.45e-01 0s 8 3.19266244e+02 -7.67447504e+02 2.14e+00 1.47e-15 2.46e-01 0s 9 2.63628497e+02 -4.47486641e+02 8.59e-01 1.17e-15 1.61e-01 0s 10 2.38855095e+02 -1.01564653e+02 4.21e-01 8.58e-16 7.70e-02 0s 11 2.20454988e+02 1.25627425e+02 4.36e-02 6.71e-16 2.14e-02 0s 12 2.17050793e+02 2.15398940e+02 1.34e-10 2.84e-15 3.73e-04 0s 13 2.17000052e+02 2.16998399e+02 4.11e-12 1.80e-15 3.73e-07 0s 14 2.17000000e+02 2.16999998e+02 6.91e-12 1.66e-15 3.73e-10 0s 15 2.17000000e+02 2.17000000e+02 7.53e-12 1.80e-15 1.37e-15 0s Barrier solved model in 15 iterations and 0.06 seconds Optimal objective 2.17000000e+02 Root relaxation: objective 2.170000e+02, 1165 iterations, 0.08 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 217.0000000 217.00000 0.0% - 0s Explored 0 nodes (2449 simplex iterations) in 0.26 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.170000000000e+02, best bound 2.170000000000e+02, gap 0.0% Preprocessing time: 0.08 seconds Gurobi run time: 0.26 seconds Total run time: 0.34 seconds Objective: 217 Solution: 1 x [1, 2, 4, 6, 11, 12, 19] 31 x [1, 2, 4, 7, 9, 10, 12, 14, 16, 17, 18] 3 x [1, 2, 4, 8, 9, 12, 19] 54 x [1, 2, 5, 6, 9, 10, 12, 14, 15, 16] 3 x [1, 2, 5, 6, 9, 10, 12, 16, 18] 2 x [1, 2, 5, 6, 9, 10, 12, 18] 12 x [1, 2, 6, 9, 10, 12, 18] 5 x [1, 2, 8, 9, 10, 12, 13] 8 x [1, 2, 8, 12] 15 x [1, 2, 9, 12, 18, 19] 3 x [1, 4, 5, 6, 7, 8, 12, 19] 16 x [1, 4, 5, 6, 8, 12, 19] 1 x [1, 4, 8, 11, 12] 12 x [2, 4, 8, 9, 10, 11, 12] 1 x [2, 4, 8, 9, 10, 11, 12, 19] 20 x [3, 6, 7, 8, 10, 11, 12, 16, 18, 19] 23 x [4, 5, 6, 7, 8, 9, 12, 14, 15, 16, 17, 18, 19] 1 x [4, 5, 6, 7, 8, 9, 12, 14, 15, 16, 18, 19] 3 x [4, 5, 6, 7, 8, 9, 12, 15, 16, 18, 19] 3 x [4, 5, 6, 7, 8, 9, 12, 16, 18, 19]