Build (method = -2) #dp: 16893 Step-3' Graph: 488 vertices and 7771 arcs (0.12s) Step-4' Graph: 430 vertices and 7492 arcs (0.13s) #V4/#V3 = 0.88 #A4/#A3 = 0.96 Ready! (0.13s) Optimize a model with 476 rows, 7493 columns and 21623 nonzeros Presolve removed 16 rows and 22 columns Presolve time: 0.10s Presolved: 460 rows, 7471 columns, 21602 nonzeros Variable types: 0 continuous, 7471 integer (2320 binary) Found heuristic solution: objective 80.0000000 Optimize a model with 460 rows, 7471 columns and 21602 nonzeros Presolved: 460 rows, 7471 columns, 21602 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 1.301e+04 Factor NZ : 3.814e+04 (roughly 3 MBytes of memory) Factor Ops : 4.241e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.13085550e+03 -1.11503675e+05 8.67e+04 1.19e-01 6.87e+01 0s 1 2.35556627e+03 -3.47138895e+04 1.68e+04 6.22e-15 1.39e+01 0s 2 6.32297115e+02 -1.38077880e+04 2.21e+03 4.55e-15 2.36e+00 0s 3 4.29790961e+02 -4.38931256e+03 3.75e+02 5.83e-15 5.18e-01 0s 4 2.59401519e+02 -1.32608452e+03 8.54e+01 6.66e-15 1.41e-01 0s 5 1.90434197e+02 -7.89067313e+02 3.67e+01 5.72e-15 7.79e-02 0s 6 1.70811028e+02 -5.48895623e+02 2.65e+01 6.90e-15 5.55e-02 0s 7 1.48211533e+02 -4.02456522e+02 2.15e+01 6.04e-15 4.23e-02 0s 8 1.29687189e+02 -2.87569473e+02 1.63e+01 6.41e-15 3.16e-02 0s 9 8.72589623e+01 -2.34718439e+02 7.43e+00 6.87e-15 2.31e-02 0s 10 6.30874575e+01 -1.62889563e+02 4.19e+00 7.11e-15 1.59e-02 0s 11 4.03094431e+01 -9.57948017e+01 2.42e+00 5.53e-15 9.50e-03 0s 12 2.86107182e+01 -4.55005574e+01 1.60e+00 6.09e-15 5.17e-03 0s 13 2.23308631e+01 -2.62286249e+01 1.06e+00 5.41e-15 3.37e-03 0s 14 2.05359345e+01 -2.25965782e+01 8.44e-01 7.69e-15 2.98e-03 0s 15 1.80125475e+01 -4.62920169e+00 4.55e-01 5.87e-15 1.55e-03 0s 16 1.57072932e+01 1.00259090e+01 1.05e-01 5.19e-15 3.83e-04 0s 17 1.49156352e+01 1.23320185e+01 4.43e-02 4.46e-15 1.74e-04 0s 18 1.46241263e+01 1.32222465e+01 2.40e-02 5.73e-15 9.42e-05 0s 19 1.43928213e+01 1.36670518e+01 1.04e-02 5.14e-15 4.87e-05 0s 20 1.43528718e+01 1.37854765e+01 8.53e-03 6.08e-15 3.81e-05 0s 21 1.42689736e+01 1.39336081e+01 4.83e-03 5.50e-15 2.25e-05 0s 22 1.42212745e+01 1.40309802e+01 2.65e-03 5.70e-15 1.28e-05 0s 23 1.41694674e+01 1.41288433e+01 2.17e-04 4.03e-15 2.72e-06 0s 24 1.41631590e+01 1.41615301e+01 1.80e-06 5.00e-15 1.09e-07 0s 25 1.41630026e+01 1.41629920e+01 1.04e-13 5.42e-15 7.10e-10 0s 26 1.41630000e+01 1.41630000e+01 3.33e-13 4.75e-15 8.20e-16 0s Barrier solved model in 26 iterations and 0.20 seconds Optimal objective 1.41630000e+01 Root relaxation: objective 1.416300e+01, 4085 iterations, 0.31 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 14.16300 0 76 80.00000 14.16300 82.3% - 1s H 0 0 15.0000000 14.16300 5.58% - 1s Explored 0 nodes (10244 simplex iterations) in 1.67 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.500000000000e+01, best bound 1.500000000000e+01, gap 0.0% Preprocessing time: 0.16 seconds Gurobi run time: 1.67 seconds Total run time: 1.83 seconds Objective: 15 Solution: 1 x [2, 2, 9, 19, 23, 34, 46] 1 x [2, 4, 5, 11, 16, 19, 34] 1 x [13, 20, 24, 33, 38, 41] 1 x [3, 4, 13, 13, 32, 40] 1 x [9, 12, 15, 32, 32, 43, 44] 1 x [7, 13, 17, 29, 31, 43, 44] 1 x [2, 8, 8, 13, 15, 15, 31] 1 x [10, 17, 20, 22, 30, 42, 42] 1 x [4, 17, 20, 22, 30, 43, 45] 1 x [2, 8, 13, 14, 16, 30] 1 x [3, 4, 10, 24, 26, 29, 39] 1 x [6, 17, 21, 24, 29, 42, 42] 1 x [3, 12, 25, 28, 28, 43, 44] 1 x [18, 21, 22, 27, 38] 1 x [1, 26, 35, 36, 37, 37, 41]