File task_poi_soi\poi_soi_problem_budget_50.txt opened.
instance loaded
Academic license - for non-commercial use only
Gurobi Optimizer version 9.0.2 build v9.0.2rc0 (win64)
Optimize a model with 2754 rows, 2755 columns and 20454 nonzeros
Model fingerprint: 0x2198a5ce
Variable types: 0 continuous, 2755 integer (2704 binary)
Coefficient statistics:
  Matrix range     [8e-01, 5e+01]
  Objective range  [2e+00, 2e+01]
  Bounds range     [1e+00, 5e+01]
  RHS range        [1e+00, 5e+01]
Found heuristic solution: objective -0.0000000
Presolve removed 101 rows and 154 columns
Presolve time: 0.03s
Presolved: 2653 rows, 2601 columns, 20062 nonzeros
Variable types: 0 continuous, 2601 integer (2551 binary)

Root relaxation: objective 2.424906e+02, 1265 iterations, 0.03 seconds

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

     0     0  242.49057    0   38   -0.00000  242.49057      -     -    0s
H    0     0                      35.0000000  242.49057   593%     -    0s
H    0     0                      55.0000000  242.49057   341%     -    0s
H    0     0                      95.0000000  242.49057   155%     -    0s
     0     0  216.29918    0   48   95.00000  216.29918   128%     -    0s
     0     0  215.64086    0   51   95.00000  215.64086   127%     -    0s
     0     0  213.63797    0   72   95.00000  213.63797   125%     -    0s
     0     0  213.63797    0   71   95.00000  213.63797   125%     -    0s
     0     0  212.58724    0   82   95.00000  212.58724   124%     -    0s
     0     0  211.26558    0   70   95.00000  211.26558   122%     -    0s
     0     0  211.26341    0   68   95.00000  211.26341   122%     -    0s
     0     0  209.90179    0   53   95.00000  209.90179   121%     -    0s
     0     0  209.90179    0   55   95.00000  209.90179   121%     -    0s
     0     0  209.54900    0   50   95.00000  209.54900   121%     -    0s
     0     0  209.47424    0   51   95.00000  209.47424   120%     -    0s
     0     0  209.47424    0   52   95.00000  209.47424   120%     -    0s
     0     0  209.47424    0   48   95.00000  209.47424   120%     -    0s
     0     0  209.47424    0   47   95.00000  209.47424   120%     -    0s
     0     2  206.45033    0   47   95.00000  206.45033   117%     -    0s
H   33    38                     145.0000000  206.45033  42.4%  28.8    1s
H 1272   982                     160.0000000  205.99674  28.7%  10.1    4s
H 1279   937                     175.0000000  205.88951  17.7%  10.0    5s
H 3292  1309                     190.0000000  203.70013  7.21%  14.6    9s
  3863  1557  196.44339   38   53  190.00000  203.53140  7.12%  14.9   10s
H17665  4946                     195.0000000  200.74131  2.94%  17.4   14s
 17675  4922  199.36574   41   83  195.00000  200.74131  2.94%  17.4   15s
H17775  4707                     195.0000338  200.74131  2.94%  17.5   17s
 24674  4147  195.07893   59   52  195.00003  199.52938  2.32%  19.1   20s

Cutting planes:
  Learned: 26
  Gomory: 16
  Cover: 45
  Implied bound: 20
  MIR: 24
  StrongCG: 3
  Flow cover: 121
  Inf proof: 15
  Zero half: 32
  RLT: 30
  Relax-and-lift: 5

Explored 33320 nodes (659620 simplex iterations) in 22.05 seconds
Thread count was 12 (of 12 available processors)

Solution count 10: 195 195 190 ... 35

Optimal solution found (tolerance 1.00e-04)
Best objective 1.950000000000e+02, best bound 1.950000000000e+02, gap 0.0000%
1 (0)  28 (10)  27 (10)  26 (15)  31 (10)  30 (10)  32 (0)  33 (0)  25 (15)  24 (15)  23 (10)  22 (10)  21 (10)  12 (10)  11 (10)  10 (10)  8 (5)  2 (10)  3 (10)  7 (5)  6 (5)  13 (5)  52
Objective MAX:195
actual duration:49.3445
  actual profit:195
