Build (method = -2) #dp: 287 Step-3' Graph: 73 vertices and 212 arcs (0.00s) Step-4' Graph: 27 vertices and 120 arcs (0.00s) #V4/#V3 = 0.37 #A4/#A3 = 0.57 Ready! (0.00s) Optimize a model with 47 rows, 121 columns and 313 nonzeros Presolve removed 14 rows and 14 columns Presolve time: 0.00s Presolved: 33 rows, 107 columns, 281 nonzeros Variable types: 0 continuous, 107 integer (24 binary) Found heuristic solution: objective 158.0000000 Found heuristic solution: objective 143.0000000 Optimize a model with 33 rows, 107 columns and 281 nonzeros Presolved: 33 rows, 107 columns, 281 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.790e+02 Factor NZ : 4.590e+02 Factor Ops : 8.041e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.60399486e+02 -1.43976358e+03 1.10e+03 4.22e-02 3.57e+01 0s 1 2.31914423e+02 -4.84155082e+02 1.13e+02 4.44e-16 5.46e+00 0s 2 1.58249450e+02 -3.48425210e+01 1.45e+01 4.44e-16 1.03e+00 0s 3 1.19783222e+02 7.38030040e+01 9.18e-01 2.22e-16 2.13e-01 0s 4 1.05480773e+02 9.76153929e+01 1.20e-01 3.33e-16 3.58e-02 0s 5 1.03856305e+02 9.93837682e+01 6.96e-02 2.36e-16 2.04e-02 0s 6 1.03393555e+02 1.00781733e+02 1.71e-02 1.90e-16 1.18e-02 0s 7 1.02766968e+02 1.00896111e+02 5.33e-03 3.03e-16 8.44e-03 0s 8 1.02574777e+02 1.02263849e+02 2.35e-03 2.42e-16 1.41e-03 0s 9 1.02532153e+02 1.02390250e+02 1.09e-03 2.85e-16 6.42e-04 0s 10 1.02504925e+02 1.02496863e+02 3.04e-12 3.33e-16 3.63e-05 0s 11 1.02500005e+02 1.02499997e+02 8.38e-12 3.33e-16 3.63e-08 0s 12 1.02500000e+02 1.02500000e+02 2.59e-11 2.57e-16 3.63e-11 0s Barrier solved model in 12 iterations and 0.00 seconds Optimal objective 1.02500000e+02 Root relaxation: objective 1.025000e+02, 51 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 102.50000 0 3 143.00000 102.50000 28.3% - 0s H 0 0 103.0000000 102.50000 0.49% - 0s Explored 0 nodes (66 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.030000000000e+02, best bound 1.030000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.01 seconds Objective: 103 Solution: 3 x [1, 18] 8 x [1, 19] 5 x [2] 1 x [2, 19] 3 x [3] 1 x [3, 17] 7 x [3, 19] 14 x [4, 13] 4 x [4, 14] 14 x [5, 12] 4 x [6, 12] 9 x [6, 14] 1 x [6, 16, 20] 14 x [7, 10] 7 x [8, 9] 2 x [8, 10] 3 x [9, 10] 1 x [10] 1 x [11, 12, 20] 1 x [14, 15, 16]