File task_poi_soi\poi_soi_problem_budget_70.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: 0xd58f0cff
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, 7e+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 3.103127e+02, 1077 iterations, 0.02 seconds

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

     0     0  310.31272    0   67   -0.00000  310.31272      -     -    0s
H    0     0                      10.0000000  310.31272  3003%     -    0s
H    0     0                      52.7393353  310.31272   488%     -    0s
H    0     0                     122.7393353  310.31272   153%     -    0s
H    0     0                     175.0000000  310.31272  77.3%     -    0s
     0     0  280.02091    0   74  175.00000  280.02091  60.0%     -    0s
     0     0  280.02091    0   69  175.00000  280.02091  60.0%     -    0s
     0     0  274.96253    0   65  175.00000  274.96253  57.1%     -    0s
     0     0  274.87606    0   62  175.00000  274.87606  57.1%     -    0s
     0     0  274.87606    0   60  175.00000  274.87606  57.1%     -    0s
     0     0  274.56572    0   72  175.00000  274.56572  56.9%     -    0s
     0     0  274.56395    0   73  175.00000  274.56395  56.9%     -    0s
     0     0  274.46892    0   86  175.00000  274.46892  56.8%     -    0s
     0     0  274.42041    0   85  175.00000  274.42041  56.8%     -    0s
     0     0  274.20742    0   88  175.00000  274.20742  56.7%     -    0s
     0     0  273.95920    0   70  175.00000  273.95920  56.5%     -    0s
     0     0  273.95920    0   61  175.00000  273.95920  56.5%     -    0s
     0     0  273.95920    0   79  175.00000  273.95920  56.5%     -    0s
     0     0  273.83943    0   71  175.00000  273.83943  56.5%     -    0s
     0     0  273.83943    0   71  175.00000  273.83943  56.5%     -    0s
     0     0  273.76056    0   72  175.00000  273.76056  56.4%     -    0s
     0     0  273.57157    0   74  175.00000  273.57157  56.3%     -    0s
     0     0  273.57157    0   76  175.00000  273.57157  56.3%     -    0s
     0     0  273.56594    0   75  175.00000  273.56594  56.3%     -    0s
     0     0  273.56594    0   75  175.00000  273.56594  56.3%     -    0s
     0     0  273.56594    0   83  175.00000  273.56594  56.3%     -    0s
     0     0  273.56594    0   68  175.00000  273.56594  56.3%     -    0s
     0     0  273.56594    0   64  175.00000  273.56594  56.3%     -    0s
     0     0  273.56594    0   68  175.00000  273.56594  56.3%     -    0s
     0     0  273.56594    0   68  175.00000  273.56594  56.3%     -    0s
     0     2  272.78482    0   68  175.00000  272.78482  55.9%     -    1s
H   31    38                     265.0000000  272.78482  2.94%  32.5    1s

Cutting planes:
  Learned: 11
  Gomory: 16
  Cover: 16
  Implied bound: 99
  MIR: 180
  Inf proof: 14
  Zero half: 6
  RLT: 83
  Relax-and-lift: 164

Explored 6823 nodes (109693 simplex iterations) in 4.11 seconds
Thread count was 12 (of 12 available processors)

Solution count 6: 265 175 122.739 ... -0

Optimal solution found (tolerance 1.00e-04)
Best objective 2.650000000000e+02, best bound 2.650000000000e+02, gap 0.0000%
1 (0)  27 (10)  26 (15)  31 (10)  30 (10)  32 (0)  33 (0)  25 (15)  23 (10)  22 (10)  21 (10)  12 (10)  11 (10)  10 (10)  9 (5)  8 (5)  2 (10)  3 (10)  7 (5)  6 (5)  5 (10)  4 (10)  14 (10)  15 (15)  16 (15)  50 (0)  51 (0)  17 (10)  28 (10)  52
Objective MAX:265
actual duration:69.5927
  actual profit:265
