Build (method = -2) #dp: 96299 Step-3' Graph: 893 vertices and 20632 arcs (0.71s) Step-4' Graph: 893 vertices and 20632 arcs (0.73s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.73s) Optimize a model with 930 rows, 20633 columns and 60126 nonzeros Presolve removed 16 rows and 38 columns Presolve time: 0.18s Presolved: 914 rows, 20595 columns, 60070 nonzeros Variable types: 0 continuous, 20595 integer (0 binary) Found heuristic solution: objective 362.0000000 Found heuristic solution: objective 341.0000000 Found heuristic solution: objective 312.0000000 Optimize a model with 914 rows, 20595 columns and 60070 nonzeros Presolved: 914 rows, 20595 columns, 60070 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 4.067e+04 Factor NZ : 1.819e+05 (roughly 10 MBytes of memory) Factor Ops : 4.568e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.94583815e+04 -6.65983310e+05 5.29e+05 2.22e-16 4.88e+02 0s 1 4.50678361e+03 -4.17014482e+05 8.28e+04 4.66e-15 8.20e+01 0s 2 1.83481944e+03 -2.32001869e+05 2.21e+04 5.55e-15 2.36e+01 0s 3 1.12122922e+03 -1.41391531e+05 7.36e+03 7.99e-15 8.66e+00 0s 4 8.04969695e+02 -5.53567345e+04 2.42e+03 7.28e-14 2.75e+00 0s 5 7.46427790e+02 -4.10526310e+04 1.37e+03 5.06e-14 1.75e+00 0s 6 6.87721055e+02 -2.42159572e+04 5.48e+02 3.46e-14 8.61e-01 0s 7 6.66368231e+02 -1.55001150e+04 1.05e+02 1.69e-14 4.34e-01 0s 8 6.55630615e+02 -7.21839995e+03 6.91e-12 1.11e-14 1.91e-01 0s 9 6.25694738e+02 -4.08428967e+03 1.26e-11 6.00e-15 1.14e-01 0s 10 6.03914664e+02 -3.70963784e+03 8.92e-12 4.66e-15 1.05e-01 0s 11 5.30487293e+02 -2.18115005e+03 6.76e-12 3.35e-15 6.58e-02 0s 12 4.87900190e+02 -2.16172126e+03 3.77e-12 4.33e-15 6.43e-02 0s 13 4.55558372e+02 -1.73158336e+03 4.22e-12 4.20e-15 5.31e-02 1s 14 4.23912833e+02 -1.34466210e+03 4.25e-12 4.66e-15 4.29e-02 1s 15 3.57255488e+02 -1.09063059e+03 3.99e-12 4.27e-15 3.51e-02 1s 16 3.63463093e+02 -9.88101064e+02 4.06e-12 4.78e-15 3.28e-02 1s 17 3.29446315e+02 -8.80069252e+02 4.40e-11 4.87e-15 2.93e-02 1s 18 2.84301638e+02 -7.89580328e+02 3.47e-11 5.32e-15 2.60e-02 1s 19 2.61114482e+02 -5.91376233e+02 3.07e-11 4.55e-15 2.07e-02 1s 20 2.02243389e+02 -3.56478354e+02 2.30e-11 3.86e-15 1.36e-02 1s 21 1.46672289e+02 -1.97912466e+02 1.47e-11 3.05e-15 8.36e-03 1s 22 1.10318604e+02 -8.62345542e+01 9.67e-12 2.95e-15 4.77e-03 1s 23 7.91140165e+01 -4.61778423e+01 5.56e-12 3.12e-15 3.04e-03 1s 24 7.21287522e+01 -1.61341357e+01 4.55e-12 2.82e-15 2.14e-03 1s 25 5.73966100e+01 3.88870166e+00 2.72e-12 3.06e-15 1.30e-03 1s 26 5.56503359e+01 1.59071466e+01 2.42e-12 3.09e-15 9.64e-04 1s 27 5.23357667e+01 2.03790891e+01 2.06e-12 3.44e-15 7.75e-04 1s 28 5.00998164e+01 2.69224583e+01 1.57e-12 3.48e-15 5.62e-04 1s 29 4.83167537e+01 3.34600679e+01 1.28e-12 3.29e-15 3.60e-04 1s 30 4.66688263e+01 3.76960933e+01 7.36e-13 3.13e-15 2.18e-04 1s 31 4.67950232e+01 4.01424195e+01 5.94e-13 3.20e-15 1.61e-04 1s 32 4.61059135e+01 4.18977111e+01 3.70e-13 2.79e-15 1.02e-04 1s 33 4.57219567e+01 4.27542818e+01 3.66e-13 3.06e-15 7.20e-05 1s 34 4.54445955e+01 4.34239506e+01 2.03e-13 3.05e-15 4.90e-05 1s 35 4.51147838e+01 4.40104787e+01 1.19e-13 2.83e-15 2.68e-05 1s 36 4.50450927e+01 4.42271705e+01 1.75e-13 3.09e-15 1.98e-05 1s 37 4.49445564e+01 4.43478590e+01 1.37e-13 3.37e-15 1.45e-05 1s 38 4.48353549e+01 4.44866463e+01 2.29e-13 3.06e-15 8.46e-06 1s 39 4.48164273e+01 4.45620988e+01 2.75e-13 3.14e-15 6.17e-06 1s 40 4.47343468e+01 4.46205724e+01 2.04e-13 3.21e-15 2.76e-06 1s 41 4.47276039e+01 4.46605798e+01 4.23e-13 2.66e-15 1.63e-06 1s 42 4.47009584e+01 4.46946671e+01 4.08e-13 1.83e-15 1.53e-07 1s 43 4.46990020e+01 4.46989956e+01 9.64e-13 2.13e-15 1.53e-10 1s 44 4.46990000e+01 4.46990000e+01 6.17e-13 2.12e-15 1.53e-13 2s Barrier solved model in 44 iterations and 1.52 seconds Optimal objective 4.46990000e+01 Root relaxation: objective 4.469900e+01, 17230 iterations, 2.06 seconds Total elapsed time = 5.97s Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 44.69900 0 118 312.00000 44.69900 85.7% - 10s H 0 0 46.0000000 44.69900 2.83% - 10s H 0 0 45.0000000 44.69900 0.67% - 12s Explored 0 nodes (34514 simplex iterations) in 12.11 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.500000000000e+01, best bound 4.500000000000e+01, gap 0.0% Preprocessing time: 0.80 seconds Gurobi run time: 12.11 seconds Total run time: 12.91 seconds Objective: 45 Solution: 2 x [10, 12, 21, 21, 21, 22] 2 x [10, 14, 16, 20, 22, 31] 1 x [10, 20, 22, 23, 23, 26, 33, 36] 1 x [6, 9, 10, 20, 20, 22, 29] 2 x [2, 2, 4, 10, 12, 18, 21, 30] 2 x [2, 4, 4, 5, 10, 17, 18, 35] 3 x [4, 4, 10, 13, 20, 24, 33] 1 x [2, 3, 5, 5, 10, 13, 26, 33, 37] 1 x [3, 3, 10, 13, 19, 26, 29, 35] 1 x [1, 3, 3, 5, 8, 10, 11, 13, 19, 26, 29] 3 x [6, 6, 10, 13, 13, 20] 2 x [2, 2, 18, 20, 22, 28, 35] 1 x [1, 3, 5, 6, 7, 8, 16, 18, 22, 25] 1 x [6, 7, 15, 16, 22, 24, 29, 37] 1 x [2, 2, 6, 16, 22, 24, 31] 3 x [6, 16, 22, 24, 31, 32, 33, 33] 1 x [6, 6, 6, 16, 22, 24, 35] 1 x [12, 17, 19, 21, 21, 25, 34, 35] 1 x [2, 2, 4, 5, 17, 18, 30, 37] 2 x [4, 9, 15, 15, 15, 15, 17, 25, 26, 29, 30, 37] 1 x [2, 5, 9, 9, 15, 16, 17, 17, 25, 35] 1 x [17, 17, 17, 18, 18, 19, 25, 33, 35] 1 x [8, 9, 13, 15, 18, 20, 29, 29, 29, 32, 35] 1 x [9, 18, 18, 20, 20, 29, 29, 33, 34, 35] 1 x [2, 3, 4, 7, 9, 15, 15, 15, 25, 26, 30] 1 x [1, 3, 4, 5, 6, 8, 18, 30, 34, 36, 36] 1 x [1, 3, 3, 4, 9, 9, 15, 15, 19, 25, 26, 30] 3 x [1, 3, 4, 4, 5, 5, 8, 11, 18, 19, 30, 36, 36] 3 x [1, 3, 5, 8, 9, 9, 27, 29, 29, 32, 34, 35, 35]