Build (method = -2) #dp: 3099 Step-3' Graph: 40 vertices and 535 arcs (0.01s) Step-4' Graph: 40 vertices and 535 arcs (0.01s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.01s) Optimize a model with 80 rows, 536 columns and 1564 nonzeros Presolve removed 18 rows and 18 columns Presolve time: 0.00s Presolved: 62 rows, 518 columns, 1512 nonzeros Variable types: 0 continuous, 518 integer (0 binary) Found heuristic solution: objective 649.0000000 Found heuristic solution: objective 443.0000000 Optimize a model with 62 rows, 518 columns and 1512 nonzeros Presolved: 62 rows, 518 columns, 1512 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.880e+02 Factor NZ : 1.517e+03 Factor Ops : 4.752e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.16274364e+03 -1.32054201e+04 5.72e+03 2.22e-16 1.34e+02 0s 1 1.46911064e+03 -7.77064175e+03 7.44e+02 6.66e-16 2.24e+01 0s 2 6.46251949e+02 -2.26591516e+03 1.84e+01 1.01e-14 2.94e+00 0s 3 4.86078528e+02 -2.53507020e+02 6.59e-02 1.11e-15 6.99e-01 0s 4 3.78213561e+02 2.69679891e+01 1.76e-02 5.52e-16 3.32e-01 0s 5 3.25377959e+02 1.44223882e+02 9.04e-03 4.70e-16 1.71e-01 0s 6 2.92551195e+02 1.87226246e+02 3.72e-03 4.76e-16 9.94e-02 0s 7 2.88967352e+02 2.13941779e+02 3.09e-03 6.46e-16 7.08e-02 0s 8 2.76838722e+02 2.46484999e+02 1.19e-03 4.95e-16 2.86e-02 0s 9 2.71524628e+02 2.53141073e+02 5.70e-04 3.23e-16 1.73e-02 0s 10 2.70581295e+02 2.63215618e+02 3.73e-04 4.78e-16 6.95e-03 0s 11 2.68626652e+02 2.66567128e+02 5.38e-05 4.65e-16 1.94e-03 0s 12 2.67853885e+02 2.67464974e+02 1.11e-05 5.25e-16 3.67e-04 0s 13 2.67836949e+02 2.67693163e+02 4.51e-06 7.08e-16 1.36e-04 0s 14 2.67750971e+02 2.67746453e+02 2.08e-07 4.63e-16 4.26e-06 0s 15 2.67750000e+02 2.67750000e+02 1.21e-10 6.92e-16 9.01e-11 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 2.67750000e+02 Root relaxation: objective 2.677500e+02, 439 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 267.75000 0 4 443.00000 267.75000 39.6% - 0s H 0 0 268.0000000 267.75000 0.09% - 0s Explored 0 nodes (505 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.680000000000e+02, best bound 2.680000000000e+02, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.02 seconds Total run time: 0.04 seconds Objective: 268 Solution: 3 x [10, 14] 3 x [10, 12, 23] 11 x [5, 10, 23] 7 x [27, 32] 6 x [22, 27, 35] 15 x [3, 21] 6 x [3, 9] 5 x [8, 9, 18, 20] 10 x [19, 24] 8 x [6, 19] 7 x [19, 20, 27] 17 x [31, 33] 14 x [7, 11] 5 x [6, 11, 18] 8 x [4, 11, 27] 9 x [15, 26] 8 x [16, 40] 2 x [16, 30] 3 x [26, 30, 35] 16 x [17, 26, 35] 25 x [36, 38] 3 x [13, 35, 39] 1 x [12, 36, 39] 4 x [1, 12, 39] 5 x [8, 26, 39] 6 x [2, 28] 5 x [13, 20, 28] 1 x [20, 27, 34] 11 x [34, 34] 5 x [10, 13, 20, 25] 1 x [10, 12, 13, 25] 8 x [8, 13, 20, 25] 11 x [13, 24, 37] 5 x [29, 31, 36] 11 x [25, 29, 31] 1 x [6, 20, 29, 35, 35, 37] 1 x [6, 18, 29, 35, 35, 37] 1 x [29, 35, 37, 37]