
Gurobi 11.0.1 (mac64[x86], gurobi_cl) logging started Wed Nov 13 04:55:18 2024

Set parameter Username
Set parameter TimeLimit to value 50
Set parameter LogFile to value "./lp_solutions/grafo2625.14.log"
Using license file /Users/sara/gurobi.lic
Academic license - for non-commercial use only - expires 2025-05-12

Gurobi Optimizer version 11.0.1 build v11.0.1rc0 (mac64[x86] - Darwin 21.6.0 21G651)
Copyright (c) 2024, Gurobi Optimization, LLC

Read LP format model from file ./lp_problems/grafo2625.14.lp
Reading time = 0.01 seconds
: 2204 rows, 236 columns, 6673 nonzeros

CPU model: Intel(R) Core(TM) i5-1038NG7 CPU @ 2.00GHz
Thread count: 4 physical cores, 8 logical processors, using up to 8 threads

Optimize a model with 2204 rows, 236 columns and 6673 nonzeros
Model fingerprint: 0x5c38bde2
Variable types: 13 continuous, 223 integer (223 binary)
Coefficient statistics:
  Matrix range     [5e-01, 5e+01]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [1e+00, 5e+01]
Found heuristic solution: objective 2.0000000
Presolve removed 588 rows and 11 columns
Presolve time: 0.02s
Presolved: 1616 rows, 225 columns, 4996 nonzeros
Variable types: 0 continuous, 225 integer (212 binary)
Found heuristic solution: objective 3.0000000

Root relaxation: objective 1.100000e+01, 114 iterations, 0.01 seconds (0.00 work units)

    Nodes    |    Current Node    |     Objective Bounds      |     Work
 Expl Unexpl |  Obj  Depth IntInf | Incumbent    BestBd   Gap | It/Node Time

     0     0   11.00000    0   46    3.00000   11.00000   267%     -    0s
H    0     0                       4.0000000   11.00000   175%     -    0s
H    0     0                       5.0000000   11.00000   120%     -    0s
     0     0   11.00000    0   61    5.00000   11.00000   120%     -    0s
     0     0   11.00000    0   61    5.00000   11.00000   120%     -    0s
     0     0   11.00000    0   83    5.00000   11.00000   120%     -    0s
     0     0   11.00000    0   95    5.00000   11.00000   120%     -    0s
     0     0   10.50000    0   48    5.00000   10.50000   110%     -    0s
     0     0   10.00000    0   35    5.00000   10.00000   100%     -    0s
     0     0   10.00000    0   35    5.00000   10.00000   100%     -    0s
     0     0   10.00000    0   61    5.00000   10.00000   100%     -    0s
     0     0   10.00000    0   56    5.00000   10.00000   100%     -    0s
     0     0   10.00000    0   65    5.00000   10.00000   100%     -    0s
     0     0   10.00000    0   66    5.00000   10.00000   100%     -    0s
     0     0   10.00000    0   78    5.00000   10.00000   100%     -    0s
     0     0   10.00000    0   68    5.00000   10.00000   100%     -    0s
     0     2   10.00000    0   53    5.00000   10.00000   100%     -    0s
* 1758   824              27       6.0000000    9.60055  60.0%  32.8    2s
  2603   966 infeasible   31         6.00000    9.59238  59.9%  34.5    5s

Cutting planes:
  MIR: 3
  Inf proof: 2
  RLT: 4
  Relax-and-lift: 1

Explored 5416 nodes (210314 simplex iterations) in 9.24 seconds (3.87 work units)
Thread count was 8 (of 8 available processors)

Solution count 8: 6 6 6 ... 2

Optimal solution found (tolerance 1.00e-04)
Best objective 6.000000000000e+00, best bound 6.000000000000e+00, gap 0.0000%

Wrote result file './lp_solutions/grafo2625.14.sol'

