Build (method = -2) #dp: 61648 Step-3' Graph: 1368 vertices and 10720 arcs (0.44s) Step-4' Graph: 1322 vertices and 10628 arcs (0.45s) #V4/#V3 = 0.97 #A4/#A3 = 0.99 Ready! (0.45s) Optimize a model with 1341 rows, 10629 columns and 29258 nonzeros Presolve removed 100 rows and 184 columns Presolve time: 0.13s Presolved: 1241 rows, 10445 columns, 29065 nonzeros Variable types: 0 continuous, 10445 integer (0 binary) Found heuristic solution: objective 200.0000000 Optimize a model with 1241 rows, 10445 columns and 29065 nonzeros Presolved: 1241 rows, 10445 columns, 29065 nonzeros Root barrier log... Ordering time: 0.07s Barrier statistics: AA' NZ : 1.810e+04 Factor NZ : 1.538e+05 (roughly 6 MBytes of memory) Factor Ops : 3.374e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.63774549e+03 -3.10702967e+05 1.69e+05 2.22e-16 1.26e+02 0s 1 7.29137342e+02 -2.18930538e+05 2.84e+04 8.88e-16 2.82e+01 0s 2 5.06629027e+02 -1.28561986e+05 1.33e+04 1.78e-15 1.38e+01 0s 3 3.09058267e+02 -5.99230519e+04 4.52e+03 6.93e-14 5.25e+00 0s 4 2.27900628e+02 -2.27802941e+04 1.15e+03 1.24e-14 1.66e+00 0s 5 2.03118157e+02 -1.00448603e+04 1.41e+02 3.11e-14 5.51e-01 0s 6 1.99786367e+02 -1.93839654e+03 7.71e+00 1.47e-14 1.04e-01 0s 7 1.98989548e+02 -6.41008705e+02 9.71e-03 5.77e-15 4.02e-02 0s 8 1.69716061e+02 -6.61471699e+02 7.06e-03 5.66e-15 3.98e-02 0s 9 1.60731280e+02 -4.76839224e+02 6.14e-03 4.00e-15 3.05e-02 0s 10 1.21981885e+02 -4.38311246e+02 4.89e-03 3.55e-15 2.68e-02 0s 11 1.21025719e+02 -3.20263082e+02 4.70e-03 2.44e-15 2.11e-02 0s 12 7.42999856e+01 -1.46706961e+02 2.64e-03 1.67e-15 1.06e-02 0s 13 4.44569642e+01 -7.37399641e+01 1.39e-03 8.95e-16 5.65e-03 0s 14 3.60767005e+01 -5.65950189e+01 1.07e-03 7.91e-16 4.43e-03 0s 15 3.16787609e+01 -3.66118654e+01 8.79e-04 8.75e-16 3.27e-03 0s 16 2.43790188e+01 -1.50317583e+01 5.09e-04 7.25e-16 1.88e-03 0s 17 2.41375257e+01 -1.23090859e+01 4.77e-04 9.97e-16 1.74e-03 0s 18 2.24132447e+01 -1.93139644e+00 3.77e-04 8.28e-16 1.16e-03 0s 19 2.08744642e+01 5.83599851e+00 2.80e-04 6.66e-16 7.19e-04 1s 20 1.91501743e+01 1.22228710e+01 1.31e-04 7.61e-16 3.31e-04 1s 21 1.89465070e+01 1.49996099e+01 8.96e-05 6.34e-16 1.89e-04 1s 22 1.86739302e+01 1.57508177e+01 6.76e-05 7.41e-16 1.40e-04 1s 23 1.80892883e+01 1.69185520e+01 5.49e-06 7.97e-16 5.60e-05 1s 24 1.79522437e+01 1.74916154e+01 4.17e-07 5.61e-16 2.20e-05 1s 25 1.79377096e+01 1.77193890e+01 2.06e-07 6.14e-16 1.04e-05 1s 26 1.79281044e+01 1.78103403e+01 9.41e-08 6.35e-16 5.63e-06 1s 27 1.79235595e+01 1.78635915e+01 5.14e-08 6.53e-16 2.87e-06 1s 28 1.79192695e+01 1.78926862e+01 1.49e-08 7.27e-16 1.27e-06 1s 29 1.79172653e+01 1.79151810e+01 6.68e-10 4.49e-16 9.97e-08 1s 30 1.79170003e+01 1.79169981e+01 2.26e-13 6.47e-16 1.04e-10 1s 31 1.79170000e+01 1.79170000e+01 3.79e-13 5.16e-16 1.10e-16 1s Barrier solved model in 31 iterations and 0.77 seconds Optimal objective 1.79170000e+01 Root relaxation: objective 1.791700e+01, 5910 iterations, 0.89 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 17.91700 0 74 200.00000 17.91700 91.0% - 3s H 0 0 19.0000000 17.91700 5.70% - 3s 0 0 17.91700 0 95 19.00000 17.91700 5.70% - 4s H 0 0 18.0000000 17.91700 0.46% - 4s Cutting planes: Gomory: 1 MIR: 1 Explored 0 nodes (15823 simplex iterations) in 4.89 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.800000000000e+01, best bound 1.800000000000e+01, gap 0.0% Preprocessing time: 0.49 seconds Gurobi run time: 4.89 seconds Total run time: 5.38 seconds Objective: 18 Solution: 1 x [2, 2, 4, 5, 7, 14, 15, 17, 19, 19] 1 x [4, 4, 4, 11, 12, 14, 17] 1 x [2, 6, 7, 7, 14, 14, 16, 17, 18, 19] 1 x [2, 2, 6, 6, 8, 9, 16, 17, 17, 17, 17, 18] 1 x [2, 7, 7, 8, 9, 9, 13, 13, 14, 14, 17, 18] 1 x [1, 2, 3, 3, 5, 9, 13, 13, 13, 15] 1 x [1, 3, 3, 9, 13, 13, 13, 13, 14, 15] 1 x [2, 5, 7, 7, 7, 8, 9, 13, 13, 14, 15, 17] 3 x [2, 7, 7, 8, 12, 14, 14, 15, 17, 19, 19, 19] 1 x [2, 2, 2, 2, 7, 7, 8, 8, 9, 10, 10, 16] 1 x [2, 2, 2, 10, 10, 10, 13, 13, 16, 17, 17, 19] 1 x [2, 7, 7, 8, 14, 14, 14, 16, 17, 19, 19, 19] 2 x [3, 3, 8, 9, 9, 13, 13, 13, 16, 16, 17] 1 x [6, 6, 7, 7, 9, 11, 11, 12, 13, 13, 19, 19] 1 x [8, 9, 11, 11, 11, 11, 13, 13, 13, 17, 17]