Build (method = -2) #dp: 93617 Step-3' Graph: 1736 vertices and 12853 arcs (0.69s) Step-4' Graph: 1638 vertices and 12671 arcs (0.70s) #V4/#V3 = 0.94 #A4/#A3 = 0.99 Ready! (0.70s) Optimize a model with 1658 rows, 12672 columns and 34735 nonzeros Presolve removed 164 rows and 306 columns Presolve time: 0.13s Presolved: 1494 rows, 12366 columns, 34576 nonzeros Variable types: 0 continuous, 12366 integer (0 binary) Found heuristic solution: objective 194.0000000 Optimize a model with 1494 rows, 12366 columns and 34576 nonzeros Presolved: 1494 rows, 12366 columns, 34576 nonzeros Root barrier log... Ordering time: 0.07s Barrier statistics: AA' NZ : 2.163e+04 Factor NZ : 1.794e+05 (roughly 7 MBytes of memory) Factor Ops : 3.753e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.97155542e+03 -5.13552845e+05 3.38e+05 2.22e-16 2.03e+02 0s 1 9.82225714e+02 -3.13140128e+05 5.61e+04 4.00e-15 4.13e+01 0s 2 6.04167758e+02 -1.53472239e+05 2.17e+04 3.00e-15 1.65e+01 0s 3 3.23819334e+02 -5.63131594e+04 5.87e+03 5.33e-15 4.77e+00 0s 4 2.55409855e+02 -2.22390844e+04 1.46e+03 6.13e-14 1.49e+00 0s 5 2.23417047e+02 -1.15968226e+04 2.37e+02 8.08e-14 5.65e-01 0s 6 1.94202373e+02 -4.66961317e+03 2.31e+01 3.60e-14 2.03e-01 0s 7 1.90269862e+02 -2.07144912e+03 1.21e+01 1.35e-14 9.31e-02 0s 8 1.88503790e+02 -8.16439906e+02 3.88e+00 6.44e-15 4.09e-02 0s 9 1.72096392e+02 -6.02187280e+02 1.04e+00 7.11e-15 3.14e-02 0s 10 9.81834927e+01 -5.10648107e+02 3.76e-01 6.81e-15 2.46e-02 0s 11 7.42184571e+01 -2.41461302e+02 2.49e-01 5.94e-15 1.28e-02 0s 12 5.06599976e+01 -1.36023549e+02 1.49e-01 5.62e-15 7.55e-03 0s 13 3.60530617e+01 -7.73373382e+01 9.95e-02 5.78e-15 4.59e-03 0s 14 3.31573117e+01 -6.04360981e+01 8.74e-02 7.38e-15 3.79e-03 0s 15 2.54697376e+01 -3.36735523e+01 4.94e-02 6.45e-15 2.39e-03 0s 16 2.39500804e+01 -1.94334735e+01 3.52e-02 7.87e-15 1.75e-03 1s 17 2.14260077e+01 2.13852753e+00 1.98e-02 5.03e-15 7.80e-04 1s 18 1.94730101e+01 1.02595303e+01 9.44e-03 5.02e-15 3.72e-04 1s 19 1.88400880e+01 1.45896080e+01 5.44e-03 4.66e-15 1.72e-04 1s 20 1.84465736e+01 1.68905272e+01 2.39e-03 4.58e-15 6.29e-05 1s 21 1.81912733e+01 1.81249598e+01 3.15e-12 5.24e-15 2.68e-06 1s 22 1.81818278e+01 1.81817613e+01 9.17e-12 4.39e-15 2.69e-09 1s 23 1.81818182e+01 1.81818182e+01 2.26e-12 6.06e-15 2.70e-15 1s Barrier solved model in 23 iterations and 0.70 seconds Optimal objective 1.81818182e+01 Root relaxation: objective 1.818182e+01, 8095 iterations, 0.91 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 18.18182 0 94 194.00000 18.18182 90.6% - 4s H 0 0 20.0000000 18.18182 9.09% - 4s H 0 0 19.0000000 18.18182 4.31% - 4s Explored 0 nodes (20453 simplex iterations) in 4.95 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.900000000000e+01, best bound 1.900000000000e+01, gap 0.0% Preprocessing time: 0.75 seconds Gurobi run time: 4.95 seconds Total run time: 5.70 seconds Objective: 19 Solution: 1 x [2, 3, 4, 5, 7, 7, 11, 13, 19] 2 x [1, 3, 3, 6, 7, 13, 15, 15, 15, 17, 19] 2 x [3, 3, 4, 5, 9, 11, 12, 12, 18, 18, 18] 2 x [2, 5, 5, 8, 8, 9, 9, 9, 13, 14, 14] 1 x [2, 5, 5, 8, 8, 8, 9, 13, 16] 1 x [5, 5, 7, 10, 10, 10, 12, 13, 13] 1 x [1, 2, 4, 5, 8, 8, 11, 16, 16] 1 x [1, 4, 5, 10, 10, 10, 11, 11, 11, 12] 1 x [1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 19] 2 x [2, 4, 5, 5, 8, 9, 14, 14, 14, 14, 14] 2 x [1, 1, 1, 1, 2, 5, 8, 11, 16, 16, 20] 3 x [9, 9, 9, 11, 11, 11, 11, 14, 16, 16, 16]