Build (method = -2) #dp: 39982 Step-3' Graph: 1130 vertices and 7260 arcs (0.25s) Step-4' Graph: 1046 vertices and 7094 arcs (0.26s) #V4/#V3 = 0.93 #A4/#A3 = 0.98 Ready! (0.26s) Optimize a model with 1063 rows, 7095 columns and 19204 nonzeros Presolve removed 109 rows and 218 columns Presolve time: 0.06s Presolved: 954 rows, 6877 columns, 19010 nonzeros Variable types: 0 continuous, 6877 integer (0 binary) Found heuristic solution: objective 196.0000000 Optimize a model with 954 rows, 6877 columns and 19010 nonzeros Presolved: 954 rows, 6877 columns, 19010 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 1.200e+04 Factor NZ : 9.412e+04 (roughly 4 MBytes of memory) Factor Ops : 1.594e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.36491051e+03 -1.87894943e+05 2.04e+05 2.22e-16 1.71e+02 0s 1 7.64831588e+02 -1.15203881e+05 2.79e+04 7.77e-16 2.84e+01 0s 2 4.52375623e+02 -5.36054029e+04 9.32e+03 1.78e-15 9.74e+00 0s 3 2.65654028e+02 -2.22526377e+04 2.43e+03 5.68e-14 3.01e+00 0s 4 2.07185056e+02 -6.98484990e+03 2.68e+02 6.13e-14 6.56e-01 0s 5 1.99714495e+02 -2.31059212e+03 6.39e+00 9.99e-15 1.84e-01 0s 6 1.98238614e+02 -7.46324265e+02 1.01e-02 3.33e-15 6.86e-02 0s 7 1.63470697e+02 -7.60878286e+02 6.53e-03 3.55e-15 6.71e-02 0s 8 1.24341917e+02 -4.78425516e+02 3.63e-03 2.11e-15 4.38e-02 0s 9 9.54484439e+01 -2.74920290e+02 2.63e-03 1.22e-15 2.69e-02 0s 10 8.05213687e+01 -2.30216132e+02 2.16e-03 8.88e-16 2.26e-02 0s 11 7.74066632e+01 -1.55159055e+02 2.05e-03 5.55e-16 1.69e-02 0s 12 4.26021054e+01 -4.94539857e+01 1.01e-03 3.33e-16 6.68e-03 0s 13 3.24234289e+01 -1.54249113e+01 5.95e-04 2.31e-16 3.47e-03 0s 14 2.81684473e+01 -1.75001921e+00 4.32e-04 2.94e-16 2.17e-03 0s 15 2.42151644e+01 8.53225393e+00 2.49e-04 2.22e-16 1.14e-03 0s 16 2.24767459e+01 1.44165138e+01 1.52e-04 2.56e-16 5.85e-04 0s 17 2.20308511e+01 1.71926686e+01 8.80e-05 2.22e-16 3.51e-04 0s 18 2.08377423e+01 1.92060828e+01 2.29e-05 2.13e-16 1.18e-04 0s 19 2.06093954e+01 1.99290541e+01 8.64e-06 2.22e-16 4.94e-05 0s 20 2.05378766e+01 2.00904646e+01 5.59e-06 1.54e-16 3.25e-05 0s 21 2.04406300e+01 2.02627509e+01 1.57e-06 2.59e-16 1.29e-05 0s 22 2.04132079e+01 2.03421508e+01 6.40e-07 2.22e-16 5.16e-06 0s 23 2.03995367e+01 2.03706763e+01 2.24e-07 2.22e-16 2.10e-06 0s 24 2.03953045e+01 2.03846246e+01 1.08e-07 2.22e-16 7.76e-07 0s 25 2.03912157e+01 2.03902894e+01 3.75e-09 2.76e-16 6.73e-08 0s 26 2.03910002e+01 2.03909993e+01 2.10e-12 2.22e-16 6.75e-11 0s 27 2.03910000e+01 2.03910000e+01 3.32e-12 2.22e-16 6.75e-14 0s Barrier solved model in 27 iterations and 0.45 seconds Optimal objective 2.03910000e+01 Root relaxation: objective 2.039100e+01, 2981 iterations, 0.52 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 20.39100 0 58 196.00000 20.39100 89.6% - 1s H 0 0 22.0000000 20.39100 7.31% - 1s H 0 0 21.0000000 20.39100 2.90% - 1s Explored 0 nodes (8777 simplex iterations) in 1.73 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.100000000000e+01, best bound 2.100000000000e+01, gap 0.0% Preprocessing time: 0.29 seconds Gurobi run time: 1.73 seconds Total run time: 2.02 seconds Objective: 21 Solution: 8 x [1, 4, 5, 6, 6, 8, 8, 9, 15, 17] 1 x [1, 5, 10, 11, 14, 16, 16, 16, 17] 1 x [4, 5, 13, 15, 16, 17, 17] 5 x [2, 2, 3, 5, 9, 13, 13, 14, 14, 16] 1 x [3, 3, 3, 4, 4, 9, 10, 14, 16, 16] 1 x [2, 2, 2, 2, 2, 9, 10, 14] 1 x [2, 2, 2, 10, 10, 12] 1 x [1, 1, 10, 10, 10, 10, 10, 10, 11, 14] 2 x [4, 7, 7, 7, 7, 12, 13, 13, 15, 16]