Build (method = -2) #dp: 4092 Step-3' Graph: 638 vertices and 1907 arcs (0.02s) Step-4' Graph: 448 vertices and 1527 arcs (0.03s) #V4/#V3 = 0.70 #A4/#A3 = 0.80 Ready! (0.03s) Optimize a model with 465 rows, 1528 columns and 3692 nonzeros Presolve removed 107 rows and 205 columns Presolve time: 0.02s Presolved: 358 rows, 1323 columns, 3575 nonzeros Variable types: 0 continuous, 1323 integer (0 binary) Found heuristic solution: objective 760.0000000 Optimize a model with 358 rows, 1323 columns and 3575 nonzeros Presolved: 358 rows, 1323 columns, 3575 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.426e+03 Factor NZ : 1.146e+04 Factor Ops : 5.438e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.76355685e+03 -2.42360652e+05 2.95e+05 2.22e-16 6.93e+02 0s 1 3.09275634e+03 -1.37333033e+05 6.29e+04 1.11e-15 1.65e+02 0s 2 1.41852454e+03 -5.87653688e+04 9.87e+03 1.22e-14 3.73e+01 0s 3 9.25633624e+02 -9.47304324e+03 1.13e+03 1.78e-15 5.33e+00 0s 4 6.86350388e+02 -3.29609770e+03 1.83e+02 7.55e-15 1.68e+00 0s 5 5.30011955e+02 -1.67054740e+03 4.26e+01 3.66e-15 8.57e-01 0s 6 4.37536336e+02 -1.62410882e+03 2.32e+01 3.55e-15 7.91e-01 0s 7 3.84134687e+02 -7.54496718e+02 1.44e+01 2.00e-15 4.35e-01 0s 8 3.27962095e+02 -6.91927964e+02 9.14e+00 1.55e-15 3.88e-01 0s 9 2.99567321e+02 -5.60309850e+01 4.86e+00 9.34e-16 1.35e-01 0s 10 2.68469641e+02 1.41572552e+02 8.34e-01 9.98e-16 4.80e-02 0s 11 2.65449977e+02 2.64029564e+02 7.08e-12 8.88e-16 5.34e-04 0s 12 2.65000004e+02 2.64999929e+02 2.44e-11 8.86e-16 2.82e-08 0s 13 2.65000000e+02 2.65000000e+02 2.13e-11 8.66e-16 2.98e-14 0s Barrier solved model in 13 iterations and 0.02 seconds Optimal objective 2.65000000e+02 Root relaxation: objective 2.650000e+02, 639 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 265.0000000 265.00000 0.0% - 0s Explored 0 nodes (825 simplex iterations) in 0.09 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.650000000000e+02, best bound 2.650000000000e+02, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.09 seconds Total run time: 0.13 seconds Objective: 265 Solution: 61 x [1, 2, 4, 5, 6, 14, 16] 7 x [1, 2, 4, 5, 9, 13, 16, 17] 10 x [1, 3, 6, 9, 11, 14, 16, 17] 2 x [1, 3, 6, 9, 14, 16, 17] 12 x [1, 4, 5, 9, 13, 16, 17] 15 x [2, 4, 5, 8, 9, 12, 15, 16, 17] 5 x [2, 4, 5, 9, 12, 15, 16, 17] 73 x [2, 6, 7, 8, 9, 10, 11, 16] 11 x [3, 4, 5, 10, 11, 12, 13, 16, 17] 36 x [3, 4, 5, 11, 12, 13, 16, 17] 9 x [4, 5, 7, 12, 14, 16, 17] 8 x [5, 6, 7, 16, 17] 1 x [5, 7, 12, 14, 16, 17] 4 x [5, 9, 12, 14, 16] 1 x [5, 9, 12, 14, 16, 17] 2 x [5, 9, 14, 16, 17] 8 x [6, 13, 14, 15, 16, 17]