
Gurobi 11.0.1 (mac64[x86], gurobi_cl) logging started Fri Nov  1 21:44:55 2024

Set parameter Username
Set parameter TimeLimit to value 50
Set parameter LogFile to value "./lp_solutions/grafo1016.18.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/grafo1016.18.lp
Reading time = 0.03 seconds
: 4174 rows, 378 columns, 12690 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 4174 rows, 378 columns and 12690 nonzeros
Model fingerprint: 0xc806f779
Variable types: 18 continuous, 360 integer (360 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 600 rows and 18 columns
Presolve time: 0.07s
Presolved: 3574 rows, 360 columns, 11016 nonzeros
Variable types: 0 continuous, 360 integer (342 binary)
Found heuristic solution: objective 5.0000000

Root relaxation: objective 1.000000e+01, 297 iterations, 0.06 seconds (0.02 work units)

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

     0     0   10.00000    0   32    5.00000   10.00000   100%     -    0s
H    0     0                       6.0000000   10.00000  66.7%     -    0s
     0     0   10.00000    0   39    6.00000   10.00000  66.7%     -    0s
H    0     0                       7.0000000   10.00000  42.9%     -    0s
     0     0   10.00000    0   38    7.00000   10.00000  42.9%     -    0s
     0     0   10.00000    0   47    7.00000   10.00000  42.9%     -    0s
     0     0   10.00000    0   51    7.00000   10.00000  42.9%     -    0s
     0     0   10.00000    0   57    7.00000   10.00000  42.9%     -    0s
     0     0   10.00000    0   57    7.00000   10.00000  42.9%     -    0s
     0     0   10.00000    0   45    7.00000   10.00000  42.9%     -    0s
     0     0   10.00000    0   49    7.00000   10.00000  42.9%     -    0s
     0     0   10.00000    0   46    7.00000   10.00000  42.9%     -    1s
     0     0   10.00000    0   45    7.00000   10.00000  42.9%     -    1s
     0     0   10.00000    0   38    7.00000   10.00000  42.9%     -    1s
     0     0   10.00000    0   38    7.00000   10.00000  42.9%     -    1s
     0     2   10.00000    0   38    7.00000   10.00000  42.9%     -    1s
H  269   142                       8.0000000   10.00000  25.0%  50.8    3s

Cutting planes:
  Gomory: 5
  Cover: 13
  MIR: 47
  StrongCG: 5
  Inf proof: 3
  Zero half: 16
  RLT: 13

Explored 399 nodes (16694 simplex iterations) in 3.60 seconds (1.09 work units)
Thread count was 8 (of 8 available processors)

Solution count 5: 8 7 6 ... 2

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

Wrote result file './lp_solutions/grafo1016.18.sol'


Gurobi 11.0.1 (mac64[x86], gurobi_cl) logging started Wed Nov 13 00:57:59 2024

Set parameter Username
Set parameter TimeLimit to value 50
Set parameter LogFile to value "./lp_solutions/grafo1016.18.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/grafo1016.18.lp
Reading time = 0.02 seconds
: 4174 rows, 378 columns, 12690 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 4174 rows, 378 columns and 12690 nonzeros
Model fingerprint: 0xc806f779
Variable types: 18 continuous, 360 integer (360 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 600 rows and 18 columns
Presolve time: 0.07s
Presolved: 3574 rows, 360 columns, 11016 nonzeros
Variable types: 0 continuous, 360 integer (342 binary)
Found heuristic solution: objective 5.0000000

Root relaxation: objective 1.000000e+01, 297 iterations, 0.08 seconds (0.02 work units)

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

     0     0   10.00000    0   32    5.00000   10.00000   100%     -    0s
H    0     0                       6.0000000   10.00000  66.7%     -    0s
     0     0   10.00000    0   39    6.00000   10.00000  66.7%     -    0s
H    0     0                       7.0000000   10.00000  42.9%     -    0s
     0     0   10.00000    0   38    7.00000   10.00000  42.9%     -    0s
     0     0   10.00000    0   47    7.00000   10.00000  42.9%     -    0s
     0     0   10.00000    0   51    7.00000   10.00000  42.9%     -    1s
     0     0   10.00000    0   57    7.00000   10.00000  42.9%     -    1s
     0     0   10.00000    0   57    7.00000   10.00000  42.9%     -    1s
     0     0   10.00000    0   45    7.00000   10.00000  42.9%     -    1s
     0     0   10.00000    0   49    7.00000   10.00000  42.9%     -    2s
     0     0   10.00000    0   46    7.00000   10.00000  42.9%     -    2s
     0     0   10.00000    0   45    7.00000   10.00000  42.9%     -    2s
     0     0   10.00000    0   38    7.00000   10.00000  42.9%     -    2s
     0     0   10.00000    0   38    7.00000   10.00000  42.9%     -    2s
     0     2   10.00000    0   38    7.00000   10.00000  42.9%     -    3s
   268   142 infeasible   17         7.00000   10.00000  42.9%  51.0    5s
H  269   142                       8.0000000   10.00000  25.0%  50.8    5s

Cutting planes:
  Gomory: 5
  Cover: 13
  MIR: 47
  StrongCG: 5
  Inf proof: 3
  Zero half: 16
  RLT: 13

Explored 399 nodes (16694 simplex iterations) in 5.31 seconds (1.09 work units)
Thread count was 8 (of 8 available processors)

Solution count 5: 8 7 6 ... 2

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

Wrote result file './lp_solutions/grafo1016.18.sol'

