Build (method = -2) #dp: 852 Step-3' Graph: 184 vertices and 545 arcs (0.01s) Step-4' Graph: 93 vertices and 363 arcs (0.01s) #V4/#V3 = 0.51 #A4/#A3 = 0.67 Ready! (0.01s) Optimize a model with 113 rows, 364 columns and 910 nonzeros Presolve removed 10 rows and 22 columns Presolve time: 0.00s Presolved: 103 rows, 342 columns, 873 nonzeros Variable types: 0 continuous, 342 integer (0 binary) Found heuristic solution: objective 937.0000000 Optimize a model with 103 rows, 342 columns and 873 nonzeros Presolved: 103 rows, 342 columns, 873 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.860e+02 Factor NZ : 2.144e+03 Factor Ops : 5.394e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.18953822e+04 -5.49681416e+04 7.14e+04 2.22e-16 5.09e+02 0s 1 3.88728429e+03 -2.40349789e+04 1.11e+04 5.55e-16 9.22e+01 0s 2 1.46009131e+03 -5.99562852e+03 1.29e+03 7.55e-15 1.50e+01 0s 3 9.26880021e+02 -1.63915998e+03 4.66e+01 2.66e-15 3.74e+00 0s 4 6.84185408e+02 -4.50860979e+02 4.84e+00 9.99e-16 1.63e+00 0s 5 5.89706146e+02 8.85268786e+01 2.36e+00 6.07e-16 7.16e-01 0s 6 5.41594830e+02 2.79031280e+02 1.10e+00 7.23e-16 3.75e-01 0s 7 5.08963674e+02 4.02771904e+02 4.78e-01 7.29e-16 1.52e-01 0s 8 4.95433741e+02 4.58901637e+02 1.63e-01 5.15e-16 5.22e-02 0s 9 4.86462507e+02 4.74770993e+02 1.68e-02 4.44e-16 1.67e-02 0s 10 4.85413028e+02 4.81772092e+02 6.65e-03 5.32e-16 5.20e-03 0s 11 4.84960253e+02 4.83365834e+02 4.02e-03 4.68e-16 2.28e-03 0s 12 4.84384645e+02 4.83766112e+02 1.13e-03 5.62e-16 8.83e-04 0s 13 4.84190899e+02 4.84150429e+02 5.96e-05 5.68e-16 5.78e-05 0s 14 4.84181826e+02 4.84181809e+02 3.69e-08 6.31e-16 2.43e-08 0s 15 4.84181818e+02 4.84181818e+02 4.51e-11 4.20e-16 2.43e-11 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 4.84181818e+02 Root relaxation: objective 4.841818e+02, 83 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 484.18182 0 28 937.00000 484.18182 48.3% - 0s H 0 0 485.0000000 484.18182 0.17% - 0s Explored 0 nodes (193 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.850000000000e+02, best bound 4.850000000000e+02, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.02 seconds Total run time: 0.04 seconds Objective: 485 Solution: 1 x [1] 21 x [1, 15, 18] 3 x [1, 13, 15] 2 x [1, 17, 20] 3 x [1, 6, 11] 1 x [1, 5, 14] 44 x [1, 5, 11, 15] 17 x [4, 5, 12] 72 x [4, 12, 14] 5 x [2, 16, 19] 12 x [2, 11, 18] 1 x [2, 5, 12] 65 x [2, 3, 6, 19] 1 x [2, 19] 9 x [3, 9, 16] 80 x [9, 10, 13] 3 x [5, 9, 12] 40 x [11, 16, 18, 20] 8 x [3, 13, 16, 19] 28 x [6, 16, 17] 69 x [7, 8, 17]