Build (method = -2) #dp: 737 Step-3' Graph: 152 vertices and 449 arcs (0.00s) Step-4' Graph: 82 vertices and 309 arcs (0.00s) #V4/#V3 = 0.54 #A4/#A3 = 0.69 Ready! (0.00s) Optimize a model with 101 rows, 310 columns and 770 nonzeros Presolve removed 23 rows and 32 columns Presolve time: 0.00s Presolved: 78 rows, 278 columns, 732 nonzeros Variable types: 0 continuous, 278 integer (0 binary) Found heuristic solution: objective 992.0000000 Optimize a model with 78 rows, 278 columns and 732 nonzeros Presolved: 78 rows, 278 columns, 732 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.010e+02 Factor NZ : 1.516e+03 Factor Ops : 3.563e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.07251370e+03 -3.62094722e+04 2.59e+04 2.22e-16 2.93e+02 0s 1 2.30823792e+03 -1.38116453e+04 4.04e+03 4.44e-16 5.56e+01 0s 2 1.31101414e+03 -3.09386841e+03 3.68e+02 2.61e-15 9.36e+00 0s 3 9.90104919e+02 -8.48290628e+02 2.32e+01 2.50e-15 3.30e+00 0s 4 8.50843541e+02 7.75040386e+01 8.16e+00 2.15e-15 1.37e+00 0s 5 7.69448692e+02 3.39072171e+02 3.65e+00 1.74e-15 7.62e-01 0s 6 7.20099448e+02 5.18946997e+02 1.60e+00 1.73e-15 3.55e-01 0s 7 6.88408067e+02 6.04489367e+02 4.65e-01 2.61e-15 1.48e-01 0s 8 6.78275784e+02 6.44890157e+02 1.07e-01 1.63e-15 5.88e-02 0s 9 6.74858399e+02 6.62642052e+02 4.32e-02 1.84e-15 2.15e-02 0s 10 6.72990780e+02 6.71349540e+02 5.72e-03 2.66e-15 2.89e-03 0s 11 6.72672644e+02 6.72645215e+02 8.98e-12 1.71e-15 4.83e-05 0s 12 6.72666673e+02 6.72666645e+02 4.42e-11 1.97e-15 4.84e-08 0s 13 6.72666667e+02 6.72666667e+02 1.71e-11 1.75e-15 4.84e-14 0s Barrier solved model in 13 iterations and 0.00 seconds Optimal objective 6.72666667e+02 Root relaxation: objective 6.726667e+02, 98 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 672.66667 0 27 992.00000 672.66667 32.2% - 0s H 0 0 674.0000000 672.66667 0.20% - 0s H 0 0 673.0000000 672.66667 0.05% - 0s Explored 0 nodes (131 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.730000000000e+02, best bound 6.730000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.03 seconds Objective: 673 Solution: 66 x [1, 11] 30 x [1, 12, 19] 31 x [1, 14, 18] 44 x [1, 15, 18, 19] 34 x [2, 9] 62 x [2, 10] 55 x [3, 10, 18] 120 x [4, 8] 38 x [4, 11, 13] 5 x [4, 11, 17, 18] 29 x [5, 10, 15, 19] 15 x [6, 10, 15, 19] 16 x [7, 9, 11] 51 x [7, 9, 13, 19] 2 x [7, 15, 16, 17, 18] 7 x [7, 15, 16, 17, 18, 19] 40 x [9, 10, 13, 16] 5 x [10, 11, 14, 15, 16] 22 x [10, 12, 13, 15, 17] 1 x [10, 13, 14]