Gurobi 7.0.1 (mac64, Python) logging started Mon Jan 2 13:57:45 2017 Optimize a model with 2 rows, 3 columns and 5 nonzeros Variable types: 0 continuous, 3 integer (3 binary) Coefficient statistics: Matrix range [1e+00, 3e+00] Objective range [1e+00, 2e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 4e+00] Presolve removed 2 rows and 3 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 3 Pool objective bound 3 Optimal solution found (tolerance 1.00e-04) Best objective 3.000000000000e+00, best bound 3.000000000000e+00, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 13 rows, 12 columns and 33 nonzeros Variable types: 0 continuous, 12 integer (12 binary) Coefficient statistics: Matrix range [1e+00, 2e+03] Objective range [5e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 270 Presolve removed 13 rows and 12 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 332.5 Pool objective bound 332.5 Optimal solution found (tolerance 1.00e-04) Best objective 3.325000000000e+02, best bound 3.325000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Gurobi 7.0.1 (mac64, Python) logging started Tue Jan 3 19:20:39 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 22 rows, 12 columns and 129 nonzeros Variable types: 0 continuous, 12 integer (12 binary) Coefficient statistics: Matrix range [5e-01, 2e+03] Objective range [5e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 4 rows and 4 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 22 rows, 12 columns and 129 nonzeros Variable types: 0 continuous, 12 integer (12 binary) Coefficient statistics: Matrix range [5e-01, 2e+03] Objective range [5e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 4 rows and 4 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 0 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 22 rows, 12 columns and 129 nonzeros Variable types: 0 continuous, 12 integer (12 binary) Coefficient statistics: Matrix range [5e-01, 2e+03] Objective range [5e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 4 rows and 4 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 0 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 22 rows, 12 columns and 129 nonzeros Variable types: 0 continuous, 12 integer (12 binary) Coefficient statistics: Matrix range [5e-01, 2e+02] Objective range [5e+00, 2e+01] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 27 Presolve removed 22 rows and 12 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 35 Pool objective bound 35 Optimal solution found (tolerance 1.00e-04) Best objective 3.500000000000e+01, best bound 3.500000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 22 rows, 12 columns and 129 nonzeros Variable types: 0 continuous, 12 integer (12 binary) Coefficient statistics: Matrix range [5e-01, 2e+02] Objective range [5e+00, 2e+01] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 27 Presolve removed 22 rows and 12 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 35 Pool objective bound 35 Optimal solution found (tolerance 1.00e-04) Best objective 3.500000000000e+01, best bound 3.500000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 22 rows, 12 columns and 129 nonzeros Variable types: 0 continuous, 12 integer (12 binary) Coefficient statistics: Matrix range [5e-01, 2e+02] Objective range [5e+00, 2e+01] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 27 Presolve removed 22 rows and 12 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 35 Pool objective bound 35 Optimal solution found (tolerance 1.00e-04) Best objective 3.500000000000e+01, best bound 3.500000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 22 rows, 12 columns and 129 nonzeros Variable types: 0 continuous, 12 integer (12 binary) Coefficient statistics: Matrix range [5e-01, 2e+02] Objective range [5e+00, 2e+01] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 27 Presolve removed 22 rows and 12 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 35 Pool objective bound 35 Optimal solution found (tolerance 1.00e-04) Best objective 3.500000000000e+01, best bound 3.500000000000e+01, gap 0.0000% Warning: variable name "DrugA included" has a space Warning: default variable names used to write solution file Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 22 rows, 12 columns and 129 nonzeros Variable types: 0 continuous, 12 integer (12 binary) Coefficient statistics: Matrix range [5e-01, 2e+02] Objective range [5e+00, 2e+01] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 27 Presolve removed 22 rows and 12 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 35 Pool objective bound 35 Optimal solution found (tolerance 1.00e-04) Best objective 3.500000000000e+01, best bound 3.500000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 22 rows, 12 columns and 129 nonzeros Variable types: 0 continuous, 12 integer (12 binary) Coefficient statistics: Matrix range [5e-01, 2e+02] Objective range [5e+00, 2e+01] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 27 Presolve removed 22 rows and 12 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 35 Pool objective bound 35 Optimal solution found (tolerance 1.00e-04) Best objective 3.500000000000e+01, best bound 3.500000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 22 rows, 12 columns and 129 nonzeros Variable types: 0 continuous, 12 integer (12 binary) Coefficient statistics: Matrix range [5e-01, 2e+02] Objective range [5e+00, 2e+01] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 27 Presolve removed 22 rows and 12 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 35 Pool objective bound 35 Optimal solution found (tolerance 1.00e-04) Best objective 3.500000000000e+01, best bound 3.500000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 22 rows, 12 columns and 129 nonzeros Variable types: 0 continuous, 12 integer (12 binary) Coefficient statistics: Matrix range [5e-01, 2e+02] Objective range [5e+00, 2e+01] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 27 Presolve removed 22 rows and 12 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 35 Pool objective bound 35 Optimal solution found (tolerance 1.00e-04) Best objective 3.500000000000e+01, best bound 3.500000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 22 rows, 12 columns and 129 nonzeros Variable types: 0 continuous, 12 integer (12 binary) Coefficient statistics: Matrix range [5e-01, 2e+02] Objective range [5e+00, 2e+01] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 27 Presolve removed 22 rows and 12 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 35 Pool objective bound 35 Optimal solution found (tolerance 1.00e-04) Best objective 3.500000000000e+01, best bound 3.500000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 16 columns and 32 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2500 Presolve removed 11 rows and 16 columns Presolve time: 0.05s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.06 seconds Thread count was 1 (of 4 available processors) Solution count 1: 2500 Pool objective bound 2500 Optimal solution found (tolerance 1.00e-04) Best objective 2.500000000000e+03, best bound 2.500000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 16 columns and 32 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2200 Presolve removed 11 rows and 16 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 2200 Pool objective bound 2200 Optimal solution found (tolerance 1.00e-04) Best objective 2.200000000000e+03, best bound 2.200000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 16 columns and 32 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+02] Bounds range [0e+00, 0e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 2900 Presolve removed 11 rows and 16 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 2900 Pool objective bound 2900 Optimal solution found (tolerance 1.00e-04) Best objective 2.900000000000e+03, best bound 2.900000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 16 columns and 32 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 9e+00] Found heuristic solution: objective 1000 Presolve removed 11 rows and 16 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1000 Pool objective bound 1000 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+03, best bound 1.000000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 16 columns and 32 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 200 Presolve removed 11 rows and 16 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 200 Pool objective bound 200 Optimal solution found (tolerance 1.00e-04) Best objective 2.000000000000e+02, best bound 2.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 16 columns and 32 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 1000 Presolve removed 11 rows and 16 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1000 Pool objective bound 1000 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+03, best bound 1.000000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 16 columns and 32 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [2e+00, 8e+00] Found heuristic solution: objective 1200 Presolve removed 11 rows and 16 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1450 Pool objective bound 1450 Optimal solution found (tolerance 1.00e-04) Best objective 1.450000000000e+03, best bound 1.450000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 16 columns and 32 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1700 Presolve removed 11 rows and 16 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 2450 Pool objective bound 2450 Optimal solution found (tolerance 1.00e-04) Best objective 2.450000000000e+03, best bound 2.450000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 16 columns and 32 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2000 Presolve removed 11 rows and 16 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 2375 Pool objective bound 2375 Optimal solution found (tolerance 1.00e-04) Best objective 2.375000000000e+03, best bound 2.375000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 16 columns and 32 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Presolve removed 0 rows and 13 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 16 columns and 32 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [4e+00, 2e+01] Found heuristic solution: objective 2500 Presolve removed 11 rows and 16 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 2900 Pool objective bound 2900 Optimal solution found (tolerance 1.00e-04) Best objective 2.900000000000e+03, best bound 2.900000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 16 columns and 32 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 800 Presolve removed 11 rows and 16 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1075 Pool objective bound 1075 Optimal solution found (tolerance 1.00e-04) Best objective 1.075000000000e+03, best bound 1.075000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 16 columns and 30 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [3e+00, 8e+00] Found heuristic solution: objective 700 Presolve removed 9 rows and 16 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 925 Pool objective bound 925 Optimal solution found (tolerance 1.00e-04) Best objective 9.250000000000e+02, best bound 9.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 16 columns and 30 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [3e+00, 2e+01] Found heuristic solution: objective 3900 Presolve removed 9 rows and 16 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 4800 Pool objective bound 4800 Optimal solution found (tolerance 1.00e-04) Best objective 4.800000000000e+03, best bound 4.800000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 16 columns and 30 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1500 Presolve removed 9 rows and 16 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1775 Pool objective bound 1775 Optimal solution found (tolerance 1.00e-04) Best objective 1.775000000000e+03, best bound 1.775000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 16 columns and 30 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1100 Presolve removed 9 rows and 16 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1175 Pool objective bound 1175 Optimal solution found (tolerance 1.00e-04) Best objective 1.175000000000e+03, best bound 1.175000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 12 rows, 16 columns and 33 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 3000 Presolve removed 12 rows and 16 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 3800 Pool objective bound 3800 Optimal solution found (tolerance 1.00e-04) Best objective 3.800000000000e+03, best bound 3.800000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 10 rows, 16 columns and 31 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2800 Presolve removed 5 rows and 4 columns Presolve time: 0.16s Presolved: 5 rows, 12 columns, 18 nonzeros Variable types: 0 continuous, 12 integer (1 binary) Root relaxation: objective 9.500000e+02, 8 iterations, 0.06 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 950.0000000 950.00000 0.00% - 0s Explored 0 nodes (8 simplex iterations) in 0.43 seconds Thread count was 4 (of 4 available processors) Solution count 2: 950 2800 Pool objective bound 950 Optimal solution found (tolerance 1.00e-04) Best objective 9.500000000000e+02, best bound 9.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 10 rows, 16 columns and 31 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2300 Presolve removed 9 rows and 8 columns Presolve time: 0.01s Presolved: 1 rows, 8 columns, 8 nonzeros Variable types: 0 continuous, 8 integer (1 binary) Root relaxation: objective 5.200000e+02, 1 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 520.0000000 520.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 2: 520 2300 Pool objective bound 520 Optimal solution found (tolerance 1.00e-04) Best objective 5.200000000000e+02, best bound 5.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 16 columns and 32 nonzeros Variable types: 0 continuous, 16 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 9e+00] Found heuristic solution: objective 900 Presolve removed 10 rows and 9 columns Presolve time: 0.01s Presolved: 1 rows, 7 columns, 7 nonzeros Variable types: 0 continuous, 7 integer (1 binary) Root relaxation: objective 1.400000e+02, 1 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 140.0000000 140.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 140 900 Pool objective bound 140 Optimal solution found (tolerance 1.00e-04) Best objective 1.400000000000e+02, best bound 1.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 30 columns and 48 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2800 Presolve removed 18 rows and 26 columns Presolve time: 0.02s Presolved: 1 rows, 4 columns, 4 nonzeros Found heuristic solution: objective 1710.0000000 Variable types: 0 continuous, 4 integer (1 binary) Root relaxation: objective 1.620000e+03, 1 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1620.0000000 1620.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1620 1710 1880 Pool objective bound 1620 Optimal solution found (tolerance 1.00e-04) Best objective 1.620000000000e+03, best bound 1.620000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 30 columns and 48 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 800 Presolve removed 14 rows and 22 columns Presolve time: 0.02s Presolved: 5 rows, 8 columns, 14 nonzeros Found heuristic solution: objective 165.0000000 Variable types: 0 continuous, 8 integer (3 binary) Root relaxation: cutoff, 2 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 165.00000 160.00017 3.03% - 0s Explored 0 nodes (2 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 165 680 Pool objective bound 165 Optimal solution found (tolerance 1.00e-04) Best objective 1.650000000000e+02, best bound 1.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 22 rows, 12 columns and 129 nonzeros Variable types: 0 continuous, 12 integer (12 binary) Coefficient statistics: Matrix range [5e-01, 2e+02] Objective range [5e+00, 2e+01] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 27 Presolve removed 22 rows and 12 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 35 Pool objective bound 35 Optimal solution found (tolerance 1.00e-04) Best objective 3.500000000000e+01, best bound 3.500000000000e+01, gap 0.0000% Gurobi 7.0.1 (mac64, Python) logging started Mon Jan 9 21:10:24 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 30 columns and 48 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 3600 Presolve removed 18 rows and 24 columns Presolve time: 0.01s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 2600.0000000 Variable types: 0 continuous, 6 integer (1 binary) Root relaxation: objective 2.365000e+03, 1 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 2365.0000000 2365.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 3: 2365 2600 3050 Pool objective bound 2365 Optimal solution found (tolerance 1.00e-04) Best objective 2.365000000000e+03, best bound 2.365000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2100 Presolve removed 30 rows and 21 columns Presolve time: 0.02s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (2 binary) Root relaxation: objective 1.000000e+03, 5 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1000.0000000 1000.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1000 2100 Pool objective bound 1000 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+03, best bound 1.000000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2500 Presolve removed 30 rows and 20 columns Presolve time: 0.02s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (2 binary) Root relaxation: objective 9.650000e+02, 6 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 965.0000000 965.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 965 2500 Pool objective bound 965 Optimal solution found (tolerance 1.00e-04) Best objective 9.650000000000e+02, best bound 9.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 3e+01] Found heuristic solution: objective 1600 Presolve removed 35 rows and 30 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 930 Pool objective bound 930 Optimal solution found (tolerance 1.00e-04) Best objective 9.300000000000e+02, best bound 9.300000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2300 Presolve removed 35 rows and 30 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1450 Pool objective bound 1450 Optimal solution found (tolerance 1.00e-04) Best objective 1.450000000000e+03, best bound 1.450000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 3000 Presolve removed 30 rows and 20 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (2 binary) Root relaxation: objective 1.555000e+03, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1555.0000000 1555.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1555 3000 Pool objective bound 1555 Optimal solution found (tolerance 1.00e-04) Best objective 1.555000000000e+03, best bound 1.555000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2400 Presolve removed 35 rows and 30 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1490 Pool objective bound 1490 Optimal solution found (tolerance 1.00e-04) Best objective 1.490000000000e+03, best bound 1.490000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2400 Presolve removed 30 rows and 20 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (2 binary) Root relaxation: objective 1.165000e+03, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1165.0000000 1165.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1165 2400 Pool objective bound 1165 Optimal solution found (tolerance 1.00e-04) Best objective 1.165000000000e+03, best bound 1.165000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2900 Presolve removed 30 rows and 20 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (2 binary) Root relaxation: objective 1.425000e+03, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1425.0000000 1425.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1425 2900 Pool objective bound 1425 Optimal solution found (tolerance 1.00e-04) Best objective 1.425000000000e+03, best bound 1.425000000000e+03, gap 0.0000% Gurobi 7.0.1 (mac64, Python) logging started Tue Jan 10 15:05:48 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 22 rows, 12 columns and 129 nonzeros Variable types: 0 continuous, 12 integer (12 binary) Coefficient statistics: Matrix range [5e-01, 2e+02] Objective range [5e+00, 2e+01] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 27 Presolve removed 22 rows and 12 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 35 Pool objective bound 35 Optimal solution found (tolerance 1.00e-04) Best objective 3.500000000000e+01, best bound 3.500000000000e+01, gap 0.0000% Gurobi 7.0.1 (mac64, Python) logging started Thu Jan 12 15:12:56 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2300 Presolve removed 30 rows and 22 columns Presolve time: 0.01s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 9.900000e+02, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 990.0000000 990.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 990 2300 Pool objective bound 990 Optimal solution found (tolerance 1.00e-04) Best objective 9.900000000000e+02, best bound 9.900000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1900 Presolve removed 30 rows and 20 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (0 binary) Root relaxation: objective 5.800000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 580.0000000 580.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 580 1900 Pool objective bound 580 Optimal solution found (tolerance 1.00e-04) Best objective 5.800000000000e+02, best bound 5.800000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2200 Presolve removed 34 rows and 24 columns Presolve time: 0.00s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 1270.0000000 Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: objective 1.150000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1150.0000000 1150.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1150 1270 1750 Pool objective bound 1150 Optimal solution found (tolerance 1.00e-04) Best objective 1.150000000000e+03, best bound 1.150000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2000 Presolve removed 30 rows and 20 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (0 binary) Root relaxation: objective 4.400000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 440.0000000 440.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 440 2000 Pool objective bound 440 Optimal solution found (tolerance 1.00e-04) Best objective 4.400000000000e+02, best bound 4.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 3700 Presolve removed 34 rows and 26 columns Presolve time: 0.00s Presolved: 1 rows, 4 columns, 4 nonzeros Found heuristic solution: objective 2595.0000000 Variable types: 0 continuous, 4 integer (0 binary) Root relaxation: objective 2.515000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 2515.0000000 2515.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 2515 2595 3115 Pool objective bound 2515 Optimal solution found (tolerance 1.00e-04) Best objective 2.515000000000e+03, best bound 2.515000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1200 Presolve removed 30 rows and 24 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Variable types: 0 continuous, 6 integer (3 binary) Root relaxation: objective 4.550000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 455.0000000 455.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 455 1200 Pool objective bound 455 Optimal solution found (tolerance 1.00e-04) Best objective 4.550000000000e+02, best bound 4.550000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 3800 Presolve removed 34 rows and 24 columns Presolve time: 0.00s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 2720.0000000 Variable types: 0 continuous, 6 integer (2 binary) Root relaxation: objective 2.595000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 2595.0000000 2595.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 2595 2720 3350 Pool objective bound 2595 Optimal solution found (tolerance 1.00e-04) Best objective 2.595000000000e+03, best bound 2.595000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 700 Presolve removed 35 rows and 30 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 500 Pool objective bound 500 Optimal solution found (tolerance 1.00e-04) Best objective 5.000000000000e+02, best bound 5.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1600 Presolve removed 30 rows and 22 columns Presolve time: 0.01s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (2 binary) Root relaxation: objective 4.100000e+02, 5 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 410.0000000 410.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 410 1600 Pool objective bound 410 Optimal solution found (tolerance 1.00e-04) Best objective 4.100000000000e+02, best bound 4.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2200 Presolve removed 34 rows and 23 columns Presolve time: 0.00s Presolved: 1 rows, 7 columns, 7 nonzeros Variable types: 0 continuous, 7 integer (1 binary) Root relaxation: objective 7.400000e+02, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 740.0000000 740.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 740 2200 Pool objective bound 740 Optimal solution found (tolerance 1.00e-04) Best objective 7.400000000000e+02, best bound 7.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2300 Presolve removed 30 rows and 21 columns Presolve time: 0.01s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (0 binary) Root relaxation: objective 9.100000e+02, 6 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 910.0000000 910.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 910 2300 Pool objective bound 910 Optimal solution found (tolerance 1.00e-04) Best objective 9.100000000000e+02, best bound 9.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2800 Presolve removed 30 rows and 23 columns Presolve time: 0.00s Presolved: 5 rows, 7 columns, 13 nonzeros Found heuristic solution: objective 1605.0000000 Variable types: 0 continuous, 7 integer (2 binary) Root relaxation: objective 1.575000e+03, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1575.0000000 1575.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1575 1605 2270 Pool objective bound 1575 Optimal solution found (tolerance 1.00e-04) Best objective 1.575000000000e+03, best bound 1.575000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 400 Presolve removed 35 rows and 30 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 70 Pool objective bound 70 Optimal solution found (tolerance 1.00e-04) Best objective 7.000000000000e+01, best bound 7.000000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 1900 Presolve removed 30 rows and 20 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (0 binary) Root relaxation: objective 5.050000e+02, 4 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 505.0000000 505.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 505 1900 Pool objective bound 505 Optimal solution found (tolerance 1.00e-04) Best objective 5.050000000000e+02, best bound 5.050000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 30 columns and 64 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2500 Presolve removed 30 rows and 21 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (2 binary) Root relaxation: objective 1.135000e+03, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1135.0000000 1135.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1135 2500 Pool objective bound 1135 Optimal solution found (tolerance 1.00e-04) Best objective 1.135000000000e+03, best bound 1.135000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 30 columns and 56 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1800 Presolve removed 24 rows and 21 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (3 binary) Root relaxation: objective 4.050000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 405.0000000 405.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 405 1800 Pool objective bound 405 Optimal solution found (tolerance 1.00e-04) Best objective 4.050000000000e+02, best bound 4.050000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 30 columns and 56 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1500 Presolve removed 24 rows and 24 columns Presolve time: 0.01s Presolved: 5 rows, 6 columns, 12 nonzeros Variable types: 0 continuous, 6 integer (4 binary) Root relaxation: objective 8.800000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 880.0000000 880.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 880 1500 Pool objective bound 880 Optimal solution found (tolerance 1.00e-04) Best objective 8.800000000000e+02, best bound 8.800000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 30 columns and 56 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 3e+01] Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 30 columns and 56 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1100 Presolve removed 24 rows and 22 columns Presolve time: 0.01s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (3 binary) Root relaxation: objective 2.350000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 235.0000000 235.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 235 1100 Pool objective bound 235 Optimal solution found (tolerance 1.00e-04) Best objective 2.350000000000e+02, best bound 2.350000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 30 columns and 56 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1400 Presolve removed 24 rows and 21 columns Presolve time: 0.01s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (0 binary) Root relaxation: objective 2.400000e+02, 4 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 240.0000000 240.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 240 1400 Pool objective bound 240 Optimal solution found (tolerance 1.00e-04) Best objective 2.400000000000e+02, best bound 2.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 30 columns and 56 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2200 Presolve removed 24 rows and 20 columns Presolve time: 0.02s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (2 binary) Root relaxation: objective 7.050000e+02, 6 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 705.0000000 705.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 705 2200 Pool objective bound 705 Optimal solution found (tolerance 1.00e-04) Best objective 7.050000000000e+02, best bound 7.050000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 30 columns and 56 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [2e+00, 1e+01] Found heuristic solution: objective 2100 Presolve removed 24 rows and 20 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (0 binary) Root relaxation: objective 6.250000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 625.0000000 625.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 625 2100 Pool objective bound 625 Optimal solution found (tolerance 1.00e-04) Best objective 6.250000000000e+02, best bound 6.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 30 columns and 56 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1100 Presolve removed 24 rows and 22 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 2.000000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 200.0000000 200.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 200 1100 Pool objective bound 200 Optimal solution found (tolerance 1.00e-04) Best objective 2.000000000000e+02, best bound 2.000000000000e+02, gap 0.0000% Gurobi 7.0.1 (mac64, Python) logging started Thu Jan 19 14:49:16 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 30 columns and 56 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1400 Presolve removed 24 rows and 22 columns Presolve time: 0.01s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (3 binary) Root relaxation: objective 2.950000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 295.0000000 295.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 295 1400 Pool objective bound 295 Optimal solution found (tolerance 1.00e-04) Best objective 2.950000000000e+02, best bound 2.950000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 30 columns and 56 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1800 Presolve removed 24 rows and 20 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (1 binary) Root relaxation: objective 8.300000e+02, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 830.0000000 830.00000 0.00% - 0s Explored 0 nodes (7 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 830 1800 Pool objective bound 830 Optimal solution found (tolerance 1.00e-04) Best objective 8.300000000000e+02, best bound 8.300000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 30 columns and 56 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2600 Presolve removed 28 rows and 24 columns Presolve time: 0.00s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 1570.0000000 Variable types: 0 continuous, 6 integer (1 binary) Root relaxation: objective 1.355000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1355.0000000 1355.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1355 1570 1975 Pool objective bound 1355 Optimal solution found (tolerance 1.00e-04) Best objective 1.355000000000e+03, best bound 1.355000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 30 columns and 56 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [0e+00, 0e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1600 Presolve removed 29 rows and 30 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 820 Pool objective bound 820 Optimal solution found (tolerance 1.00e-04) Best objective 8.200000000000e+02, best bound 8.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 72 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 2300 Presolve removed 37 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1360 Pool objective bound 1360 Optimal solution found (tolerance 1.00e-04) Best objective 1.360000000000e+03, best bound 1.360000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 72 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 2300 Presolve removed 37 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1275 Pool objective bound 1275 Optimal solution found (tolerance 1.00e-04) Best objective 1.275000000000e+03, best bound 1.275000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 72 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1600 Presolve removed 37 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 845 Pool objective bound 845 Optimal solution found (tolerance 1.00e-04) Best objective 8.450000000000e+02, best bound 8.450000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 72 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2200 Presolve removed 37 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1290 Pool objective bound 1290 Optimal solution found (tolerance 1.00e-04) Best objective 1.290000000000e+03, best bound 1.290000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 72 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2200 Presolve removed 37 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1230 Pool objective bound 1230 Optimal solution found (tolerance 1.00e-04) Best objective 1.230000000000e+03, best bound 1.230000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 72 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [4e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 34 rows and 38 columns Presolve time: 0.01s Presolved: 3 rows, 6 columns, 8 nonzeros Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: objective 6.250000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 625.0000000 625.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 625 1700 Pool objective bound 625 Optimal solution found (tolerance 1.00e-04) Best objective 6.250000000000e+02, best bound 6.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 72 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 1e+02] Found heuristic solution: objective 1000 Presolve removed 35 rows and 40 columns Presolve time: 0.00s Presolved: 2 rows, 4 columns, 5 nonzeros Found heuristic solution: objective 270.0000000 Variable types: 0 continuous, 4 integer (0 binary) Root relaxation: objective 2.200000e+02, 2 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 220.0000000 220.00000 0.00% - 0s Explored 0 nodes (2 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 220 270 850 Pool objective bound 220 Optimal solution found (tolerance 1.00e-04) Best objective 2.200000000000e+02, best bound 2.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 72 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 9e+01] Found heuristic solution: objective 1000 Presolve removed 35 rows and 40 columns Presolve time: 0.00s Presolved: 2 rows, 4 columns, 5 nonzeros Found heuristic solution: objective 385.0000000 Variable types: 0 continuous, 4 integer (1 binary) Root relaxation: objective 3.600000e+02, 2 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 360.0000000 360.00000 0.00% - 0s Explored 0 nodes (2 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 360 385 960 Pool objective bound 360 Optimal solution found (tolerance 1.00e-04) Best objective 3.600000000000e+02, best bound 3.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 72 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 9e+01] Found heuristic solution: objective 1100 Presolve removed 37 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 585 Pool objective bound 585 Optimal solution found (tolerance 1.00e-04) Best objective 5.850000000000e+02, best bound 5.850000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 72 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 9e+01] Found heuristic solution: objective 700 Presolve removed 37 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 100 Pool objective bound 100 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+02, best bound 1.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 72 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1300 Presolve removed 36 rows and 41 columns Presolve time: 0.00s Presolved: 1 rows, 3 columns, 3 nonzeros Found heuristic solution: objective 470.0000000 Variable types: 0 continuous, 3 integer (0 binary) Root relaxation: cutoff, 0 iterations, 0.00 seconds Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 470 875 Pool objective bound 470 Optimal solution found (tolerance 1.00e-04) Best objective 4.700000000000e+02, best bound 4.700000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 72 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2100 Presolve removed 34 rows and 39 columns Presolve time: 0.00s Presolved: 3 rows, 5 columns, 7 nonzeros Variable types: 0 continuous, 5 integer (0 binary) Root relaxation: objective 9.050000e+02, 2 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 905.0000000 905.00000 0.00% - 0s Explored 0 nodes (2 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 905 2100 Pool objective bound 905 Optimal solution found (tolerance 1.00e-04) Best objective 9.050000000000e+02, best bound 9.050000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 72 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 37 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 695 Pool objective bound 695 Optimal solution found (tolerance 1.00e-04) Best objective 6.950000000000e+02, best bound 6.950000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 68 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 32 rows and 35 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (1 binary) Root relaxation: objective 4.700000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 470.0000000 470.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 470 1500 Pool objective bound 470 Optimal solution found (tolerance 1.00e-04) Best objective 4.700000000000e+02, best bound 4.700000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 68 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 32 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (3 binary) Root relaxation: objective 7.600000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 760.0000000 760.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 760 1700 Pool objective bound 760 Optimal solution found (tolerance 1.00e-04) Best objective 7.600000000000e+02, best bound 7.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 33 rows, 44 columns and 76 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 2200 Presolve removed 33 rows and 44 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1175 Pool objective bound 1175 Optimal solution found (tolerance 1.00e-04) Best objective 1.175000000000e+03, best bound 1.175000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 33 rows, 44 columns and 76 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 9e+01] Found heuristic solution: objective 1600 Presolve removed 33 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 885 Pool objective bound 885 Optimal solution found (tolerance 1.00e-04) Best objective 8.850000000000e+02, best bound 8.850000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 80 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 1e+02] Found heuristic solution: objective 1300 Presolve removed 35 rows and 40 columns Presolve time: 0.00s Presolved: 2 rows, 4 columns, 5 nonzeros Found heuristic solution: objective 400.0000000 Variable types: 0 continuous, 4 integer (0 binary) Root relaxation: objective 3.500000e+02, 2 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 350.0000000 350.00000 0.00% - 0s Explored 0 nodes (2 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 350 400 1150 Pool objective bound 350 Optimal solution found (tolerance 1.00e-04) Best objective 3.500000000000e+02, best bound 3.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 80 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 9e+01] Found heuristic solution: objective 1100 Presolve removed 34 rows and 39 columns Presolve time: 0.00s Presolved: 3 rows, 5 columns, 7 nonzeros Found heuristic solution: objective 575.0000000 Variable types: 0 continuous, 5 integer (1 binary) Root relaxation: objective 5.300000e+02, 2 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 530.0000000 530.00000 0.00% - 0s Explored 0 nodes (2 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 530 575 1025 Pool objective bound 530 Optimal solution found (tolerance 1.00e-04) Best objective 5.300000000000e+02, best bound 5.300000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2700 Presolve removed 28 rows and 38 columns Presolve time: 0.00s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 1615.0000000 Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: objective 1.435000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1435.0000000 1435.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1435 1615 2125 Pool objective bound 1435 Optimal solution found (tolerance 1.00e-04) Best objective 1.435000000000e+03, best bound 1.435000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 400 Presolve removed 29 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 70 Pool objective bound 70 Optimal solution found (tolerance 1.00e-04) Best objective 7.000000000000e+01, best bound 7.000000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 3e+01] Found heuristic solution: objective 1700 Presolve removed 24 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Found heuristic solution: objective 550.0000000 Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: cutoff, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 550.00000 545.00055 0.91% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 550 1460 Pool objective bound 550 Optimal solution found (tolerance 1.00e-04) Best objective 5.500000000000e+02, best bound 5.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 600 Presolve removed 25 rows and 40 columns Presolve time: 0.01s Presolved: 4 rows, 4 columns, 8 nonzeros Variable types: 0 continuous, 4 integer (2 binary) Root relaxation: objective 2.150000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 215.0000000 215.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 215 600 Pool objective bound 215 Optimal solution found (tolerance 1.00e-04) Best objective 2.150000000000e+02, best bound 2.150000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 2e+01] Found heuristic solution: objective 300 Presolve removed 29 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 30 Pool objective bound 30 Optimal solution found (tolerance 1.00e-04) Best objective 3.000000000000e+01, best bound 3.000000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 600 Presolve removed 29 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 300 Pool objective bound 300 Optimal solution found (tolerance 1.00e-04) Best objective 3.000000000000e+02, best bound 3.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1200 Presolve removed 24 rows and 35 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (1 binary) Root relaxation: objective 2.100000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 210.0000000 210.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 210 1200 Pool objective bound 210 Optimal solution found (tolerance 1.00e-04) Best objective 2.100000000000e+02, best bound 2.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1900 Presolve removed 28 rows and 38 columns Presolve time: 0.00s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 1005.0000000 Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: objective 8.850000e+02, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 885.0000000 885.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 885 1005 1275 Pool objective bound 885 Optimal solution found (tolerance 1.00e-04) Best objective 8.850000000000e+02, best bound 8.850000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1200 Presolve removed 24 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Found heuristic solution: objective 250.0000000 Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: cutoff, 2 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 250.00000 245.00025 2.00% - 0s Explored 0 nodes (2 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 250 960 Pool objective bound 250 Optimal solution found (tolerance 1.00e-04) Best objective 2.500000000000e+02, best bound 2.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1600 Presolve removed 24 rows and 35 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (0 binary) Root relaxation: objective 3.650000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 365.0000000 365.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 365 1600 Pool objective bound 365 Optimal solution found (tolerance 1.00e-04) Best objective 3.650000000000e+02, best bound 3.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2100 Presolve removed 28 rows and 38 columns Presolve time: 0.00s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 1550.0000000 Variable types: 0 continuous, 6 integer (1 binary) Root relaxation: objective 1.415000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1415.0000000 1415.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1415 1550 1925 Pool objective bound 1415 Optimal solution found (tolerance 1.00e-04) Best objective 1.415000000000e+03, best bound 1.415000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1400 Presolve removed 24 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 3.800000e+02, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 380.0000000 380.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 380 1400 Pool objective bound 380 Optimal solution found (tolerance 1.00e-04) Best objective 3.800000000000e+02, best bound 3.800000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2100 Presolve removed 24 rows and 35 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (2 binary) Root relaxation: objective 1.190000e+03, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1190.0000000 1190.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1190 2100 Pool objective bound 1190 Optimal solution found (tolerance 1.00e-04) Best objective 1.190000000000e+03, best bound 1.190000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2400 Presolve removed 29 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1380 Pool objective bound 1380 Optimal solution found (tolerance 1.00e-04) Best objective 1.380000000000e+03, best bound 1.380000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1900 Presolve removed 24 rows and 37 columns Presolve time: 0.00s Presolved: 5 rows, 7 columns, 13 nonzeros Variable types: 0 continuous, 7 integer (2 binary) Root relaxation: objective 9.350000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 935.0000000 935.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 935 1900 Pool objective bound 935 Optimal solution found (tolerance 1.00e-04) Best objective 9.350000000000e+02, best bound 9.350000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1500 Presolve removed 24 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: objective 5.150000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 515.0000000 515.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 515 1500 Pool objective bound 515 Optimal solution found (tolerance 1.00e-04) Best objective 5.150000000000e+02, best bound 5.150000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1900 Presolve removed 24 rows and 35 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (0 binary) Root relaxation: objective 5.750000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 575.0000000 575.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 575 1900 Pool objective bound 575 Optimal solution found (tolerance 1.00e-04) Best objective 5.750000000000e+02, best bound 5.750000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2300 Presolve removed 24 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (1 binary) Root relaxation: objective 9.550000e+02, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 955.0000000 955.00000 0.00% - 0s Explored 0 nodes (7 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 955 2300 Pool objective bound 955 Optimal solution found (tolerance 1.00e-04) Best objective 9.550000000000e+02, best bound 9.550000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2600 Presolve removed 28 rows and 40 columns Presolve time: 0.00s Presolved: 1 rows, 4 columns, 4 nonzeros Found heuristic solution: objective 1195.0000000 Variable types: 0 continuous, 4 integer (0 binary) Root relaxation: objective 1.180000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1180.0000000 1180.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1180 1195 1470 Pool objective bound 1180 Optimal solution found (tolerance 1.00e-04) Best objective 1.180000000000e+03, best bound 1.180000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1800 Presolve removed 24 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (2 binary) Root relaxation: objective 6.700000e+02, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 670.0000000 670.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 670 1800 Pool objective bound 670 Optimal solution found (tolerance 1.00e-04) Best objective 6.700000000000e+02, best bound 6.700000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 600 Presolve removed 29 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 100 Pool objective bound 100 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+02, best bound 1.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 800 Presolve removed 24 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Variable types: 0 continuous, 6 integer (4 binary) Root relaxation: objective 1.650000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 165.0000000 165.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 165 800 Pool objective bound 165 Optimal solution found (tolerance 1.00e-04) Best objective 1.650000000000e+02, best bound 1.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1300 Presolve removed 24 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (1 binary) Root relaxation: objective 3.050000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 305.0000000 305.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 305 1300 Pool objective bound 305 Optimal solution found (tolerance 1.00e-04) Best objective 3.050000000000e+02, best bound 3.050000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 1700 Presolve removed 24 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 5.200000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 520.0000000 520.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 520 1700 Pool objective bound 520 Optimal solution found (tolerance 1.00e-04) Best objective 5.200000000000e+02, best bound 5.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+01] Found heuristic solution: objective 700 Presolve removed 29 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 240 Pool objective bound 240 Optimal solution found (tolerance 1.00e-04) Best objective 2.400000000000e+02, best bound 2.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 1100 Presolve removed 28 rows and 37 columns Presolve time: 0.00s Presolved: 1 rows, 7 columns, 7 nonzeros Variable types: 0 continuous, 7 integer (0 binary) Root relaxation: objective 1.700000e+02, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 170.0000000 170.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 170 1100 Pool objective bound 170 Optimal solution found (tolerance 1.00e-04) Best objective 1.700000000000e+02, best bound 1.700000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 29 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2500 Presolve removed 29 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1420 Pool objective bound 1420 Optimal solution found (tolerance 1.00e-04) Best objective 1.420000000000e+03, best bound 1.420000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 64 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 3e+01] Found heuristic solution: objective 1800 Presolve removed 37 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1270 Pool objective bound 1270 Optimal solution found (tolerance 1.00e-04) Best objective 1.270000000000e+03, best bound 1.270000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 64 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 100 Presolve removed 37 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 20 Pool objective bound 20 Optimal solution found (tolerance 1.00e-04) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 64 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 600 Presolve removed 37 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 240 Pool objective bound 240 Optimal solution found (tolerance 1.00e-04) Best objective 2.400000000000e+02, best bound 2.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 64 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 300 Presolve removed 37 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 80 Pool objective bound 80 Optimal solution found (tolerance 1.00e-04) Best objective 8.000000000000e+01, best bound 8.000000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 64 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 2600 Presolve removed 36 rows and 40 columns Presolve time: 0.00s Presolved: 1 rows, 4 columns, 4 nonzeros Found heuristic solution: objective 1700.0000000 Variable types: 0 continuous, 4 integer (0 binary) Root relaxation: objective 1.605000e+03, 1 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1605.0000000 1605.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1605 1700 2275 Pool objective bound 1605 Optimal solution found (tolerance 1.00e-04) Best objective 1.605000000000e+03, best bound 1.605000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 37 rows, 44 columns and 64 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2100 Presolve removed 37 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1305 Pool objective bound 1305 Optimal solution found (tolerance 1.00e-04) Best objective 1.305000000000e+03, best bound 1.305000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1400 Presolve removed 50 rows and 40 columns Presolve time: 0.01s Presolved: 1 rows, 4 columns, 4 nonzeros Found heuristic solution: objective 300.0000000 Variable types: 0 continuous, 4 integer (1 binary) Root relaxation: cutoff, 0 iterations, 0.00 seconds Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 300 1130 Pool objective bound 300 Optimal solution found (tolerance 1.00e-04) Best objective 3.000000000000e+02, best bound 3.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2100 Presolve removed 46 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 5.350000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 535.0000000 535.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 535 2100 Pool objective bound 535 Optimal solution found (tolerance 1.00e-04) Best objective 5.350000000000e+02, best bound 5.350000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 3e+01] Found heuristic solution: objective 900 Presolve removed 46 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Found heuristic solution: objective 245.0000000 Variable types: 0 continuous, 6 integer (3 binary) Root relaxation: cutoff, 2 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 245.00000 240.00025 2.04% - 0s Explored 0 nodes (2 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 245 840 Pool objective bound 245 Optimal solution found (tolerance 1.00e-04) Best objective 2.450000000000e+02, best bound 2.450000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2400 Presolve removed 50 rows and 39 columns Presolve time: 0.00s Presolved: 1 rows, 5 columns, 5 nonzeros Found heuristic solution: objective 1490.0000000 Variable types: 0 continuous, 5 integer (1 binary) Root relaxation: objective 1.400000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1400.0000000 1400.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1400 1490 2050 Pool objective bound 1400 Optimal solution found (tolerance 1.00e-04) Best objective 1.400000000000e+03, best bound 1.400000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1600 Presolve removed 51 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1065 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1800 Presolve removed 46 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (1 binary) Root relaxation: objective 5.400000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 540.0000000 540.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 540 1800 Pool objective bound 540 Optimal solution found (tolerance 1.00e-04) Best objective 5.400000000000e+02, best bound 5.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 3e+01] Found heuristic solution: objective 700 Presolve removed 51 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 120 Pool objective bound 120 Optimal solution found (tolerance 1.00e-04) Best objective 1.200000000000e+02, best bound 1.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1100 Presolve removed 46 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (5 binary) Root relaxation: objective 2.950000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 295.0000000 295.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 295 1100 Pool objective bound 295 Optimal solution found (tolerance 1.00e-04) Best objective 2.950000000000e+02, best bound 2.950000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 3e+01] Found heuristic solution: objective 900 Presolve removed 46 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Variable types: 0 continuous, 6 integer (3 binary) Root relaxation: objective 3.700000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 370.0000000 370.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 370 900 Pool objective bound 370 Optimal solution found (tolerance 1.00e-04) Best objective 3.700000000000e+02, best bound 3.700000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1600 Presolve removed 46 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (1 binary) Root relaxation: objective 3.400000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 340.0000000 340.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 340 1600 Pool objective bound 340 Optimal solution found (tolerance 1.00e-04) Best objective 3.400000000000e+02, best bound 3.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2000 Presolve removed 46 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 7.650000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 765.0000000 765.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 765 2000 Pool objective bound 765 Optimal solution found (tolerance 1.00e-04) Best objective 7.650000000000e+02, best bound 7.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 4e+01] Found heuristic solution: objective 900 Presolve removed 46 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (3 binary) Root relaxation: objective 1.650000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 165.0000000 165.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 165 900 Pool objective bound 165 Optimal solution found (tolerance 1.00e-04) Best objective 1.650000000000e+02, best bound 1.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1100 Presolve removed 46 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (2 binary) Root relaxation: objective 2.400000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 240.0000000 240.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 240 1100 Pool objective bound 240 Optimal solution found (tolerance 1.00e-04) Best objective 2.400000000000e+02, best bound 2.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2000 Presolve removed 46 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (2 binary) Root relaxation: objective 8.750000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 875.0000000 875.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 875 2000 Pool objective bound 875 Optimal solution found (tolerance 1.00e-04) Best objective 8.750000000000e+02, best bound 8.750000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 600 Presolve removed 46 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Variable types: 0 continuous, 6 integer (2 binary) Root relaxation: objective 1.600000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 160.0000000 160.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 160 600 Pool objective bound 160 Optimal solution found (tolerance 1.00e-04) Best objective 1.600000000000e+02, best bound 1.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2800 Presolve removed 51 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1685 Pool objective bound 1685 Optimal solution found (tolerance 1.00e-04) Best objective 1.685000000000e+03, best bound 1.685000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2300 Presolve removed 46 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 8.300000e+02, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 830.0000000 830.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 830 2300 Pool objective bound 830 Optimal solution found (tolerance 1.00e-04) Best objective 8.300000000000e+02, best bound 8.300000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 2200 Presolve removed 51 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1175 Pool objective bound 1175 Optimal solution found (tolerance 1.00e-04) Best objective 1.175000000000e+03, best bound 1.175000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 3e+01] Found heuristic solution: objective 1600 Presolve removed 46 rows and 37 columns Presolve time: 0.00s Presolved: 5 rows, 7 columns, 13 nonzeros Found heuristic solution: objective 600.0000000 Variable types: 0 continuous, 7 integer (0 binary) Root relaxation: cutoff, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 600.00000 595.00060 0.83% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 600 1250 Pool objective bound 600 Optimal solution found (tolerance 1.00e-04) Best objective 6.000000000000e+02, best bound 6.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1600 Presolve removed 51 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1040 Pool objective bound 1040 Optimal solution found (tolerance 1.00e-04) Best objective 1.040000000000e+03, best bound 1.040000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1300 Presolve removed 46 rows and 37 columns Presolve time: 0.00s Presolved: 5 rows, 7 columns, 13 nonzeros Found heuristic solution: objective 525.0000000 Variable types: 0 continuous, 7 integer (0 binary) Root relaxation: cutoff, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 525.00000 520.00053 0.95% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 525 950 Pool objective bound 525 Optimal solution found (tolerance 1.00e-04) Best objective 5.250000000000e+02, best bound 5.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 900 Presolve removed 46 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: objective 3.400000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 340.0000000 340.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 340 900 Pool objective bound 340 Optimal solution found (tolerance 1.00e-04) Best objective 3.400000000000e+02, best bound 3.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 2000 Presolve removed 46 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 9.000000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 900.0000000 900.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 900 2000 Pool objective bound 900 Optimal solution found (tolerance 1.00e-04) Best objective 9.000000000000e+02, best bound 9.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 3e+01] Found heuristic solution: objective 1100 Presolve removed 46 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Found heuristic solution: objective 290.0000000 Variable types: 0 continuous, 6 integer (2 binary) Root relaxation: cutoff, 2 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 290.00000 285.00029 1.72% - 0s Explored 0 nodes (2 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 290 980 Pool objective bound 290 Optimal solution found (tolerance 1.00e-04) Best objective 2.900000000000e+02, best bound 2.900000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1700 Presolve removed 51 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1105 Pool objective bound 1105 Optimal solution found (tolerance 1.00e-04) Best objective 1.105000000000e+03, best bound 1.105000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 3e+01] Found heuristic solution: objective 1200 Presolve removed 46 rows and 37 columns Presolve time: 0.00s Presolved: 5 rows, 7 columns, 13 nonzeros Found heuristic solution: objective 365.0000000 Variable types: 0 continuous, 7 integer (0 binary) Root relaxation: cutoff, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 365.00000 360.00037 1.37% - 0s Explored 0 nodes (3 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 365 1000 Pool objective bound 365 Optimal solution found (tolerance 1.00e-04) Best objective 3.650000000000e+02, best bound 3.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 3e+01] Found heuristic solution: objective 1400 Presolve removed 46 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 3.100000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 310.0000000 310.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 310 1400 Pool objective bound 310 Optimal solution found (tolerance 1.00e-04) Best objective 3.100000000000e+02, best bound 3.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1900 Presolve removed 46 rows and 37 columns Presolve time: 0.00s Presolved: 5 rows, 7 columns, 13 nonzeros Found heuristic solution: objective 795.0000000 Variable types: 0 continuous, 7 integer (0 binary) Root relaxation: cutoff, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 795.00000 790.00080 0.63% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 795 1550 Pool objective bound 795 Optimal solution found (tolerance 1.00e-04) Best objective 7.950000000000e+02, best bound 7.950000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 400 Presolve removed 51 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 40 Pool objective bound 40 Optimal solution found (tolerance 1.00e-04) Best objective 4.000000000000e+01, best bound 4.000000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 1000 Presolve removed 46 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 1.900000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 190.0000000 190.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 190 1000 Pool objective bound 190 Optimal solution found (tolerance 1.00e-04) Best objective 1.900000000000e+02, best bound 1.900000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1700 Presolve removed 46 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (2 binary) Root relaxation: objective 3.450000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 345.0000000 345.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 345 1700 Pool objective bound 345 Optimal solution found (tolerance 1.00e-04) Best objective 3.450000000000e+02, best bound 3.450000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1800 Presolve removed 46 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (1 binary) Root relaxation: objective 8.100000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 810.0000000 810.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 810 1800 Pool objective bound 810 Optimal solution found (tolerance 1.00e-04) Best objective 8.100000000000e+02, best bound 8.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1800 Presolve removed 46 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 4.900000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 490.0000000 490.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 490 1800 Pool objective bound 490 Optimal solution found (tolerance 1.00e-04) Best objective 4.900000000000e+02, best bound 4.900000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 51 rows, 44 columns and 78 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 300 Presolve removed 51 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 60 Pool objective bound 60 Optimal solution found (tolerance 1.00e-04) Best objective 6.000000000000e+01, best bound 6.000000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 65 rows, 44 columns and 106 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2300 Presolve removed 65 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1495 Pool objective bound 1495 Optimal solution found (tolerance 1.00e-04) Best objective 1.495000000000e+03, best bound 1.495000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 65 rows, 44 columns and 106 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 65 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1210 Pool objective bound 1210 Optimal solution found (tolerance 1.00e-04) Best objective 1.210000000000e+03, best bound 1.210000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 58 rows, 44 columns and 99 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1800 Presolve removed 58 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1460 Pool objective bound 1460 Optimal solution found (tolerance 1.00e-04) Best objective 1.460000000000e+03, best bound 1.460000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 58 rows, 44 columns and 99 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2600 Presolve removed 58 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1590 Pool objective bound 1590 Optimal solution found (tolerance 1.00e-04) Best objective 1.590000000000e+03, best bound 1.590000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 79 rows, 44 columns and 134 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1900 Presolve removed 79 rows and 44 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1195 Pool objective bound 1195 Optimal solution found (tolerance 1.00e-04) Best objective 1.195000000000e+03, best bound 1.195000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 47 rows, 44 columns and 86 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 47 rows and 44 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 775 Pool objective bound 775 Optimal solution found (tolerance 1.00e-04) Best objective 7.750000000000e+02, best bound 7.750000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 45 rows, 44 columns and 84 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1600 Presolve removed 45 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 920 Pool objective bound 920 Optimal solution found (tolerance 1.00e-04) Best objective 9.200000000000e+02, best bound 9.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+01] Found heuristic solution: objective 1500 Presolve removed 18 rows and 35 columns Presolve time: 0.02s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (0 binary) Root relaxation: objective 2.800000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 280.0000000 280.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 280 1500 Pool objective bound 280 Optimal solution found (tolerance 1.00e-04) Best objective 2.800000000000e+02, best bound 2.800000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1600 Presolve removed 23 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 965 Pool objective bound 965 Optimal solution found (tolerance 1.00e-04) Best objective 9.650000000000e+02, best bound 9.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 1e+01] Found heuristic solution: objective 2300 Presolve removed 18 rows and 35 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (0 binary) Root relaxation: objective 8.700000e+02, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 870.0000000 870.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 870 2300 Pool objective bound 870 Optimal solution found (tolerance 1.00e-04) Best objective 8.700000000000e+02, best bound 8.700000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 1100 Presolve removed 18 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Found heuristic solution: objective 280.0000000 Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: cutoff, 2 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 280.00000 275.00028 1.79% - 0s Explored 0 nodes (2 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 280 860 Pool objective bound 280 Optimal solution found (tolerance 1.00e-04) Best objective 2.800000000000e+02, best bound 2.800000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 7e+00] Found heuristic solution: objective 700 Presolve removed 23 rows and 44 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 225 Pool objective bound 225 Optimal solution found (tolerance 1.00e-04) Best objective 2.250000000000e+02, best bound 2.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1200 Presolve removed 18 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Variable types: 0 continuous, 6 integer (4 binary) Root relaxation: objective 6.800000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 680.0000000 680.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 680 1200 Pool objective bound 680 Optimal solution found (tolerance 1.00e-04) Best objective 6.800000000000e+02, best bound 6.800000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 7e+00] Found heuristic solution: objective 400 Presolve removed 23 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 50 Pool objective bound 50 Optimal solution found (tolerance 1.00e-04) Best objective 5.000000000000e+01, best bound 5.000000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 8e+00] Found heuristic solution: objective 1100 Presolve removed 18 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Found heuristic solution: objective 355.0000000 Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: cutoff, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 355.00000 350.00036 1.41% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 355 860 Pool objective bound 355 Optimal solution found (tolerance 1.00e-04) Best objective 3.550000000000e+02, best bound 3.550000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 1e+01] Found heuristic solution: objective 1900 Presolve removed 18 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Found heuristic solution: objective 765.0000000 Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: cutoff, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 765.00000 760.00077 0.65% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 765 1420 Pool objective bound 765 Optimal solution found (tolerance 1.00e-04) Best objective 7.650000000000e+02, best bound 7.650000000000e+02, gap 0.0000% Gurobi 7.0.1 (mac64, Python) logging started Fri Jan 20 10:49:12 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1400 Presolve removed 18 rows and 37 columns Presolve time: 0.02s Presolved: 5 rows, 7 columns, 13 nonzeros Variable types: 0 continuous, 7 integer (0 binary) Root relaxation: objective 5.450000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 545.0000000 545.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 545 1400 Pool objective bound 545 Optimal solution found (tolerance 1.00e-04) Best objective 5.450000000000e+02, best bound 5.450000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 1900 Presolve removed 18 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: objective 7.250000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 725.0000000 725.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 725 1900 Pool objective bound 725 Optimal solution found (tolerance 1.00e-04) Best objective 7.250000000000e+02, best bound 7.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 7e+00] Found heuristic solution: objective 400 Presolve removed 23 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 55 Pool objective bound 55 Optimal solution found (tolerance 1.00e-04) Best objective 5.500000000000e+01, best bound 5.500000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 8e+00] Found heuristic solution: objective 1000 Presolve removed 18 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Found heuristic solution: objective 255.0000000 Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: cutoff, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 255.00000 250.00026 1.96% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 255 800 Pool objective bound 255 Optimal solution found (tolerance 1.00e-04) Best objective 2.550000000000e+02, best bound 2.550000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 1000 Presolve removed 18 rows and 38 columns Presolve time: 0.02s Presolved: 5 rows, 6 columns, 12 nonzeros Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: objective 3.600000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 360.0000000 360.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 360 1000 Pool objective bound 360 Optimal solution found (tolerance 1.00e-04) Best objective 3.600000000000e+02, best bound 3.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 5e+00] Found heuristic solution: objective 500 Presolve removed 23 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 95 Pool objective bound 95 Optimal solution found (tolerance 1.00e-04) Best objective 9.500000000000e+01, best bound 9.500000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 7e+00] Found heuristic solution: objective 700 Presolve removed 23 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 325 Pool objective bound 325 Optimal solution found (tolerance 1.00e-04) Best objective 3.250000000000e+02, best bound 3.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 9e+00] Found heuristic solution: objective 1600 Presolve removed 18 rows and 35 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (1 binary) Root relaxation: objective 6.500000e+02, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 650.0000000 650.00000 0.00% - 0s Explored 0 nodes (7 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 650 1600 Pool objective bound 650 Optimal solution found (tolerance 1.00e-04) Best objective 6.500000000000e+02, best bound 6.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 23 rows, 44 columns and 56 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 6e+00] Found heuristic solution: objective 800 Presolve removed 18 rows and 36 columns Presolve time: 0.01s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 1.500000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 150.0000000 150.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 150 800 Pool objective bound 150 Optimal solution found (tolerance 1.00e-04) Best objective 1.500000000000e+02, best bound 1.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 800 Presolve removed 19 rows and 44 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 300 Pool objective bound 300 Optimal solution found (tolerance 1.00e-04) Best objective 3.000000000000e+02, best bound 3.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 9e+00] Found heuristic solution: objective 1200 Presolve removed 14 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: objective 4.850000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 485.0000000 485.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 485 1200 Pool objective bound 485 Optimal solution found (tolerance 1.00e-04) Best objective 4.850000000000e+02, best bound 4.850000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 17 rows, 44 columns and 44 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 8e+00] Found heuristic solution: objective 1200 Presolve removed 12 rows and 38 columns Presolve time: 0.12s Presolved: 5 rows, 6 columns, 12 nonzeros Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: objective 4.450000e+02, 4 iterations, 0.05 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 445.0000000 445.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.27 seconds Thread count was 4 (of 4 available processors) Solution count 2: 445 1200 Pool objective bound 445 Optimal solution found (tolerance 1.00e-04) Best objective 4.450000000000e+02, best bound 4.450000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 17 rows, 44 columns and 44 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 6e+00] Found heuristic solution: objective 600 Presolve removed 16 rows and 37 columns Presolve time: 0.03s Presolved: 1 rows, 7 columns, 7 nonzeros Variable types: 0 continuous, 7 integer (1 binary) Root relaxation: objective 7.000000e+01, 1 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 70.0000000 70.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.26 seconds Thread count was 4 (of 4 available processors) Solution count 2: 70 600 Pool objective bound 70 Optimal solution found (tolerance 1.00e-04) Best objective 7.000000000000e+01, best bound 7.000000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 17 rows, 44 columns and 44 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 9e+00] Found heuristic solution: objective 1000 Presolve removed 17 rows and 44 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 740 Pool objective bound 740 Optimal solution found (tolerance 1.00e-04) Best objective 7.400000000000e+02, best bound 7.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 17 rows, 44 columns and 44 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 9e+00] Found heuristic solution: objective 1500 Presolve removed 12 rows and 36 columns Presolve time: 0.01s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 3.300000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 330.0000000 330.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 330 1500 Pool objective bound 330 Optimal solution found (tolerance 1.00e-04) Best objective 3.300000000000e+02, best bound 3.300000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 17 rows, 44 columns and 44 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2000 Presolve removed 16 rows and 38 columns Presolve time: 0.04s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 1110.0000000 Variable types: 0 continuous, 6 integer (1 binary) Root relaxation: objective 9.150000e+02, 1 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 915.0000000 915.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.15 seconds Thread count was 4 (of 4 available processors) Solution count 3: 915 1110 1425 Pool objective bound 915 Optimal solution found (tolerance 1.00e-04) Best objective 9.150000000000e+02, best bound 9.150000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 17 rows, 44 columns and 44 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 2e+01] Found heuristic solution: objective 2400 Presolve removed 8 rows and 30 columns Presolve time: 0.01s Presolved: 9 rows, 14 columns, 28 nonzeros Variable types: 0 continuous, 14 integer (0 binary) Root relaxation: objective 2.000000e+01, 6 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 20.0000000 20.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 2: 20 2400 Pool objective bound 20 Optimal solution found (tolerance 1.00e-04) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 17 rows, 44 columns and 44 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1100 Presolve removed 8 rows and 30 columns Presolve time: 0.00s Presolved: 9 rows, 14 columns, 28 nonzeros Variable types: 0 continuous, 14 integer (7 binary) Root relaxation: objective 0.000000e+00, 2 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 0.0000000 0.00000 - - 0s Explored 0 nodes (2 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 0 1100 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 7e+00] Found heuristic solution: objective 800 Presolve removed 10 rows and 30 columns Presolve time: 0.01s Presolved: 9 rows, 14 columns, 28 nonzeros Variable types: 0 continuous, 14 integer (2 binary) Root relaxation: objective 0.000000e+00, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 0.0000000 0.00000 - - 0s Explored 0 nodes (3 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 0 800 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1200 Presolve removed 10 rows and 30 columns Presolve time: 0.02s Presolved: 9 rows, 14 columns, 28 nonzeros Variable types: 0 continuous, 14 integer (8 binary) Root relaxation: objective 0.000000e+00, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 0.0000000 0.00000 - - 0s Explored 0 nodes (3 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 0 1200 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 30 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 700 Presolve removed 9 rows and 44 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 85 Pool objective bound 85 Optimal solution found (tolerance 1.00e-04) Best objective 8.500000000000e+01, best bound 8.500000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 30 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 9e+00] Found heuristic solution: objective 1400 Presolve removed 4 rows and 35 columns Presolve time: 0.01s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (0 binary) Root relaxation: objective 3.950000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 395.0000000 395.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 395 1400 Pool objective bound 395 Optimal solution found (tolerance 1.00e-04) Best objective 3.950000000000e+02, best bound 3.950000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 30 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1600 Presolve removed 4 rows and 35 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (2 binary) Root relaxation: objective 5.400000e+02, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 540.0000000 540.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 540 1600 Pool objective bound 540 Optimal solution found (tolerance 1.00e-04) Best objective 5.400000000000e+02, best bound 5.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 44 columns and 32 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1400 Presolve removed 11 rows and 44 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 750 Pool objective bound 750 Optimal solution found (tolerance 1.00e-04) Best objective 7.500000000000e+02, best bound 7.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 44 columns and 32 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1600 Presolve removed 6 rows and 38 columns Presolve time: 0.01s Presolved: 5 rows, 6 columns, 12 nonzeros Variable types: 0 continuous, 6 integer (2 binary) Root relaxation: objective 9.000000e+02, 5 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 900.0000000 900.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 900 1600 Pool objective bound 900 Optimal solution found (tolerance 1.00e-04) Best objective 9.000000000000e+02, best bound 9.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 100 Presolve removed 19 rows and 44 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 10 Pool objective bound 10 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+01, best bound 1.000000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1900 Presolve removed 19 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 920 Pool objective bound 920 Optimal solution found (tolerance 1.00e-04) Best objective 9.200000000000e+02, best bound 9.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1100 Presolve removed 19 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 500 Pool objective bound 500 Optimal solution found (tolerance 1.00e-04) Best objective 5.000000000000e+02, best bound 5.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 1000 Presolve removed 14 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Found heuristic solution: objective 245.0000000 Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: cutoff, 3 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 245.00000 240.00025 2.04% - 0s Explored 0 nodes (3 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 245 820 Pool objective bound 245 Optimal solution found (tolerance 1.00e-04) Best objective 2.450000000000e+02, best bound 2.450000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 8e+00] Found heuristic solution: objective 800 Presolve removed 19 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 155 Pool objective bound 155 Optimal solution found (tolerance 1.00e-04) Best objective 1.550000000000e+02, best bound 1.550000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+01] Found heuristic solution: objective 2700 Presolve removed 18 rows and 38 columns Presolve time: 0.00s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 1580.0000000 Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: objective 1.335000e+03, 1 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1335.0000000 1335.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1335 1580 2075 Pool objective bound 1335 Optimal solution found (tolerance 1.00e-04) Best objective 1.335000000000e+03, best bound 1.335000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 700 Presolve removed 14 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Found heuristic solution: objective 140.0000000 Variable types: 0 continuous, 6 integer (2 binary) Root relaxation: cutoff, 2 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 140.00000 135.00014 3.57% - 0s Explored 0 nodes (2 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 140 520 Pool objective bound 140 Optimal solution found (tolerance 1.00e-04) Best objective 1.400000000000e+02, best bound 1.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1900 Presolve removed 14 rows and 35 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (2 binary) Root relaxation: objective 6.150000e+02, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 615.0000000 615.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 615 1900 Pool objective bound 615 Optimal solution found (tolerance 1.00e-04) Best objective 6.150000000000e+02, best bound 6.150000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 7e+00] Found heuristic solution: objective 1300 Presolve removed 14 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 3.000000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 300.0000000 300.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 300 1300 Pool objective bound 300 Optimal solution found (tolerance 1.00e-04) Best objective 3.000000000000e+02, best bound 3.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 1000 Presolve removed 14 rows and 37 columns Presolve time: 0.00s Presolved: 5 rows, 7 columns, 13 nonzeros Found heuristic solution: objective 190.0000000 Variable types: 0 continuous, 7 integer (2 binary) Root relaxation: cutoff, 2 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 190.00000 185.00019 2.63% - 0s Explored 0 nodes (2 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 190 700 Pool objective bound 190 Optimal solution found (tolerance 1.00e-04) Best objective 1.900000000000e+02, best bound 1.900000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+01] Found heuristic solution: objective 2100 Presolve removed 19 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1130 Pool objective bound 1130 Optimal solution found (tolerance 1.00e-04) Best objective 1.130000000000e+03, best bound 1.130000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 1400 Presolve removed 14 rows and 37 columns Presolve time: 0.00s Presolved: 5 rows, 7 columns, 13 nonzeros Variable types: 0 continuous, 7 integer (2 binary) Root relaxation: objective 3.500000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 350.0000000 350.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 350 1400 Pool objective bound 350 Optimal solution found (tolerance 1.00e-04) Best objective 3.500000000000e+02, best bound 3.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 1800 Presolve removed 14 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (1 binary) Root relaxation: objective 4.450000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 445.0000000 445.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 445 1800 Pool objective bound 445 Optimal solution found (tolerance 1.00e-04) Best objective 4.450000000000e+02, best bound 4.450000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 19 rows, 44 columns and 48 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 8e+00] Found heuristic solution: objective 600 Presolve removed 19 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 175 Pool objective bound 175 Optimal solution found (tolerance 1.00e-04) Best objective 1.750000000000e+02, best bound 1.750000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 44 columns and 32 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 1e+01] Found heuristic solution: objective 2000 Presolve removed 6 rows and 36 columns Presolve time: 0.01s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 6.850000e+02, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 685.0000000 685.00000 0.00% - 0s Explored 0 nodes (7 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 685 2000 Pool objective bound 685 Optimal solution found (tolerance 1.00e-04) Best objective 6.850000000000e+02, best bound 6.850000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 17 rows, 44 columns and 38 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 9e+00] Found heuristic solution: objective 1300 Presolve removed 12 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Found heuristic solution: objective 470.0000000 Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: cutoff, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 470.00000 465.00047 1.06% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 470 1060 Pool objective bound 470 Optimal solution found (tolerance 1.00e-04) Best objective 4.700000000000e+02, best bound 4.700000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 17 rows, 44 columns and 38 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2000 Presolve removed 16 rows and 38 columns Presolve time: 0.00s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 1290.0000000 Variable types: 0 continuous, 6 integer (1 binary) Root relaxation: objective 1.140000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1140.0000000 1140.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1140 1290 1800 Pool objective bound 1140 Optimal solution found (tolerance 1.00e-04) Best objective 1.140000000000e+03, best bound 1.140000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 30 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2600 Presolve removed 4 rows and 33 columns Presolve time: 0.02s Presolved: 5 rows, 11 columns, 17 nonzeros Variable types: 0 continuous, 11 integer (1 binary) Root relaxation: objective 9.450000e+02, 6 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 945.0000000 945.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 945 2600 Pool objective bound 945 Optimal solution found (tolerance 1.00e-04) Best objective 9.450000000000e+02, best bound 9.450000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 30 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2300 Presolve removed 8 rows and 39 columns Presolve time: 0.00s Presolved: 1 rows, 5 columns, 5 nonzeros Variable types: 0 continuous, 5 integer (1 binary) Root relaxation: objective 1.030000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1030.0000000 1030.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1030 2300 Pool objective bound 1030 Optimal solution found (tolerance 1.00e-04) Best objective 1.030000000000e+03, best bound 1.030000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 30 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 8e+00] Found heuristic solution: objective 1400 Presolve removed 4 rows and 35 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (0 binary) Root relaxation: objective 3.750000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 375.0000000 375.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 375 1400 Pool objective bound 375 Optimal solution found (tolerance 1.00e-04) Best objective 3.750000000000e+02, best bound 3.750000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 30 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 600 Presolve removed 9 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 120 Pool objective bound 120 Optimal solution found (tolerance 1.00e-04) Best objective 1.200000000000e+02, best bound 1.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 30 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 7e+00] Found heuristic solution: objective 500 Presolve removed 9 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 110 Pool objective bound 110 Optimal solution found (tolerance 1.00e-04) Best objective 1.100000000000e+02, best bound 1.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 30 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 7e+00] Found heuristic solution: objective 700 Presolve removed 8 rows and 40 columns Presolve time: 0.00s Presolved: 1 rows, 4 columns, 4 nonzeros Variable types: 0 continuous, 4 integer (0 binary) Root relaxation: objective 2.250000e+02, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 225.0000000 225.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 225 700 Pool objective bound 225 Optimal solution found (tolerance 1.00e-04) Best objective 2.250000000000e+02, best bound 2.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 30 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1900 Presolve removed 4 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (1 binary) Root relaxation: objective 9.100000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 910.0000000 910.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 910 1900 Pool objective bound 910 Optimal solution found (tolerance 1.00e-04) Best objective 9.100000000000e+02, best bound 9.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 30 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+01] Found heuristic solution: objective 1800 Presolve removed 4 rows and 35 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (0 binary) Root relaxation: objective 4.300000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 430.0000000 430.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 430 1800 Pool objective bound 430 Optimal solution found (tolerance 1.00e-04) Best objective 4.300000000000e+02, best bound 4.300000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 30 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 9e+00] Found heuristic solution: objective 1200 Presolve removed 4 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 3.100000e+02, 2 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 310.0000000 310.00000 0.00% - 0s Explored 0 nodes (2 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 310 1200 Pool objective bound 310 Optimal solution found (tolerance 1.00e-04) Best objective 3.100000000000e+02, best bound 3.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 30 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+01] Found heuristic solution: objective 2000 Presolve removed 4 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (0 binary) Root relaxation: objective 6.500000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 650.0000000 650.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 650 2000 Pool objective bound 650 Optimal solution found (tolerance 1.00e-04) Best objective 6.500000000000e+02, best bound 6.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 30 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+01] Found heuristic solution: objective 2100 Presolve removed 8 rows and 40 columns Presolve time: 0.00s Presolved: 1 rows, 4 columns, 4 nonzeros Variable types: 0 continuous, 4 integer (0 binary) Root relaxation: objective 1.130000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1130.0000000 1130.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1130 2100 Pool objective bound 1130 Optimal solution found (tolerance 1.00e-04) Best objective 1.130000000000e+03, best bound 1.130000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 17 rows, 44 columns and 38 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2300 Presolve removed 17 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1495 Pool objective bound 1495 Optimal solution found (tolerance 1.00e-04) Best objective 1.495000000000e+03, best bound 1.495000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 17 rows, 44 columns and 38 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 200 Presolve removed 17 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 35 Pool objective bound 35 Optimal solution found (tolerance 1.00e-04) Best objective 3.500000000000e+01, best bound 3.500000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 17 rows, 44 columns and 38 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1900 Presolve removed 17 rows and 44 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1240 Pool objective bound 1240 Optimal solution found (tolerance 1.00e-04) Best objective 1.240000000000e+03, best bound 1.240000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 17 rows, 44 columns and 38 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 9e+00] Found heuristic solution: objective 1800 Presolve removed 16 rows and 40 columns Presolve time: 0.00s Presolved: 1 rows, 4 columns, 4 nonzeros Found heuristic solution: objective 1005.0000000 Variable types: 0 continuous, 4 integer (0 binary) Root relaxation: objective 9.450000e+02, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 945.0000000 945.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 945 1005 1205 Pool objective bound 945 Optimal solution found (tolerance 1.00e-04) Best objective 9.450000000000e+02, best bound 9.450000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 44 columns and 32 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1700 Presolve removed 6 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Found heuristic solution: objective 520.0000000 Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: cutoff, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 520.00000 515.00052 0.96% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 520 1280 Pool objective bound 520 Optimal solution found (tolerance 1.00e-04) Best objective 5.200000000000e+02, best bound 5.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 44 columns and 32 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 8e+00] Found heuristic solution: objective 1200 Presolve removed 6 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 2.500000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 250.0000000 250.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 250 1200 Pool objective bound 250 Optimal solution found (tolerance 1.00e-04) Best objective 2.500000000000e+02, best bound 2.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 44 columns and 32 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 8e+00] Found heuristic solution: objective 800 Presolve removed 6 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Found heuristic solution: objective 160.0000000 Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: cutoff, 2 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 160.00000 155.00016 3.12% - 0s Explored 0 nodes (2 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 160 560 Pool objective bound 160 Optimal solution found (tolerance 1.00e-04) Best objective 1.600000000000e+02, best bound 1.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 44 columns and 26 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2900 Presolve removed 11 rows and 44 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1545 Pool objective bound 1545 Optimal solution found (tolerance 1.00e-04) Best objective 1.545000000000e+03, best bound 1.545000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 44 columns and 26 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+01] Found heuristic solution: objective 1600 Presolve removed 6 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 5.100000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 510.0000000 510.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 510 1600 Pool objective bound 510 Optimal solution found (tolerance 1.00e-04) Best objective 5.100000000000e+02, best bound 5.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 44 columns and 26 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+01] Found heuristic solution: objective 1700 Presolve removed 11 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 945 Pool objective bound 945 Optimal solution found (tolerance 1.00e-04) Best objective 9.450000000000e+02, best bound 9.450000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 44 columns and 26 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+01] Found heuristic solution: objective 1300 Presolve removed 6 rows and 38 columns Presolve time: 0.00s Presolved: 5 rows, 6 columns, 12 nonzeros Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: objective 5.850000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 585.0000000 585.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 585 1300 Pool objective bound 585 Optimal solution found (tolerance 1.00e-04) Best objective 5.850000000000e+02, best bound 5.850000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 44 columns and 26 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1700 Presolve removed 11 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 810 Pool objective bound 810 Optimal solution found (tolerance 1.00e-04) Best objective 8.100000000000e+02, best bound 8.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 1700 Presolve removed 4 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 7.100000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 710.0000000 710.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 710 1700 Pool objective bound 710 Optimal solution found (tolerance 1.00e-04) Best objective 7.100000000000e+02, best bound 7.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 400 Presolve removed 9 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 95 Pool objective bound 95 Optimal solution found (tolerance 1.00e-04) Best objective 9.500000000000e+01, best bound 9.500000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 9e+00] Found heuristic solution: objective 1700 Presolve removed 4 rows and 35 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (0 binary) Root relaxation: objective 6.050000e+02, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 605.0000000 605.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 605 1700 Pool objective bound 605 Optimal solution found (tolerance 1.00e-04) Best objective 6.050000000000e+02, best bound 6.050000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 700 Presolve removed 9 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 325 Pool objective bound 325 Optimal solution found (tolerance 1.00e-04) Best objective 3.250000000000e+02, best bound 3.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+01] Found heuristic solution: objective 2200 Presolve removed 4 rows and 35 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (0 binary) Root relaxation: objective 1.175000e+03, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1175.0000000 1175.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1175 2200 Pool objective bound 1175 Optimal solution found (tolerance 1.00e-04) Best objective 1.175000000000e+03, best bound 1.175000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 9e+00] Found heuristic solution: objective 1800 Presolve removed 4 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (2 binary) Root relaxation: objective 6.600000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 660.0000000 660.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 660 1800 Pool objective bound 660 Optimal solution found (tolerance 1.00e-04) Best objective 6.600000000000e+02, best bound 6.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2000 Presolve removed 4 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (1 binary) Root relaxation: objective 5.350000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 535.0000000 535.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 535 2000 Pool objective bound 535 Optimal solution found (tolerance 1.00e-04) Best objective 5.350000000000e+02, best bound 5.350000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 1e+01] Found heuristic solution: objective 1100 Presolve removed 8 rows and 40 columns Presolve time: 0.00s Presolved: 1 rows, 4 columns, 4 nonzeros Variable types: 0 continuous, 4 integer (0 binary) Root relaxation: objective 4.250000e+02, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 425.0000000 425.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 425 1100 Pool objective bound 425 Optimal solution found (tolerance 1.00e-04) Best objective 4.250000000000e+02, best bound 4.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2500 Presolve removed 8 rows and 38 columns Presolve time: 0.00s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 2065.0000000 Variable types: 0 continuous, 6 integer (2 binary) Root relaxation: objective 1.620000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1620.0000000 1620.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1620 2065 2125 Pool objective bound 1620 Optimal solution found (tolerance 1.00e-04) Best objective 1.620000000000e+03, best bound 1.620000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+01] Found heuristic solution: objective 2500 Presolve removed 4 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (0 binary) Root relaxation: objective 1.135000e+03, 8 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1135.0000000 1135.00000 0.00% - 0s Explored 0 nodes (8 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1135 2500 Pool objective bound 1135 Optimal solution found (tolerance 1.00e-04) Best objective 1.135000000000e+03, best bound 1.135000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2500 Presolve removed 4 rows and 34 columns Presolve time: 0.01s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (0 binary) Root relaxation: objective 1.080000e+03, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1080.0000000 1080.00000 0.00% - 0s Explored 0 nodes (7 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1080 2500 Pool objective bound 1080 Optimal solution found (tolerance 1.00e-04) Best objective 1.080000000000e+03, best bound 1.080000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 1e+01] Found heuristic solution: objective 1800 Presolve removed 9 rows and 44 columns Presolve time: 0.12s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.22 seconds Thread count was 1 (of 4 available processors) Solution count 1: 390 Pool objective bound 390 Optimal solution found (tolerance 1.00e-04) Best objective 3.900000000000e+02, best bound 3.900000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1300 Presolve removed 4 rows and 35 columns Presolve time: 0.04s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (0 binary) Root relaxation: objective 1.600000e+02, 2 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 160.0000000 160.00000 0.00% - 0s Explored 0 nodes (2 simplex iterations) in 0.16 seconds Thread count was 4 (of 4 available processors) Solution count 2: 160 1300 Pool objective bound 160 Optimal solution found (tolerance 1.00e-04) Best objective 1.600000000000e+02, best bound 1.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 8e+00] Found heuristic solution: objective 600 Presolve removed 9 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 105 Pool objective bound 105 Optimal solution found (tolerance 1.00e-04) Best objective 1.050000000000e+02, best bound 1.050000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1400 Presolve removed 9 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 305 Pool objective bound 305 Optimal solution found (tolerance 1.00e-04) Best objective 3.050000000000e+02, best bound 3.050000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 7e+00] Found heuristic solution: objective 300 Presolve removed 9 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 30 Pool objective bound 30 Optimal solution found (tolerance 1.00e-04) Best objective 3.000000000000e+01, best bound 3.000000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1300 Presolve removed 9 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 175 Pool objective bound 175 Optimal solution found (tolerance 1.00e-04) Best objective 1.750000000000e+02, best bound 1.750000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 3400 Presolve removed 9 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1780 Pool objective bound 1780 Optimal solution found (tolerance 1.00e-04) Best objective 1.780000000000e+03, best bound 1.780000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2200 Presolve removed 8 rows and 38 columns Presolve time: 0.02s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 1365.0000000 Variable types: 0 continuous, 6 integer (2 binary) Root relaxation: objective 1.020000e+03, 1 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1020.0000000 1020.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.12 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1020 1365 1425 Pool objective bound 1020 Optimal solution found (tolerance 1.00e-04) Best objective 1.020000000000e+03, best bound 1.020000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 3300 Presolve removed 8 rows and 38 columns Presolve time: 0.09s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 2640.0000000 Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: objective 1.860000e+03, 1 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1860.0000000 1860.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.16 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1860 2640 2700 Pool objective bound 1860 Optimal solution found (tolerance 1.00e-04) Best objective 1.860000000000e+03, best bound 1.860000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [2e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1600 Presolve removed 4 rows and 36 columns Presolve time: 0.10s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (0 binary) Root relaxation: objective 9.500000e+02, 6 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 950.0000000 950.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.25 seconds Thread count was 4 (of 4 available processors) Solution count 2: 950 1600 Pool objective bound 950 Optimal solution found (tolerance 1.00e-04) Best objective 9.500000000000e+02, best bound 9.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [5e+01, 4e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2400 Presolve removed 9 rows and 44 columns Presolve time: 0.07s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.09 seconds Thread count was 1 (of 4 available processors) Solution count 1: 500 Pool objective bound 500 Optimal solution found (tolerance 1.00e-04) Best objective 5.000000000000e+02, best bound 5.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 2e+01] Found heuristic solution: objective 3100 Presolve removed 8 rows and 38 columns Presolve time: 0.00s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 1965.0000000 Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: objective 1.530000e+03, 1 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1530.0000000 1530.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1530 1965 2025 Pool objective bound 1530 Optimal solution found (tolerance 1.00e-04) Best objective 1.530000000000e+03, best bound 1.530000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 2000 Presolve removed 4 rows and 35 columns Presolve time: 0.02s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (0 binary) Root relaxation: objective 8.100000e+02, 4 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 810.0000000 810.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 810 2000 Pool objective bound 810 Optimal solution found (tolerance 1.00e-04) Best objective 8.100000000000e+02, best bound 8.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 9e+00] Found heuristic solution: objective 900 Presolve removed 8 rows and 38 columns Presolve time: 0.00s Presolved: 1 rows, 6 columns, 6 nonzeros Variable types: 0 continuous, 6 integer (1 binary) Root relaxation: objective 2.700000e+02, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 270.0000000 270.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 270 900 Pool objective bound 270 Optimal solution found (tolerance 1.00e-04) Best objective 2.700000000000e+02, best bound 2.700000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2400 Presolve removed 8 rows and 39 columns Presolve time: 0.00s Presolved: 1 rows, 5 columns, 5 nonzeros Variable types: 0 continuous, 5 integer (1 binary) Root relaxation: objective 1.385000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1385.0000000 1385.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1385 2400 Pool objective bound 1385 Optimal solution found (tolerance 1.00e-04) Best objective 1.385000000000e+03, best bound 1.385000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 2e+01] Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 2e+01] Found heuristic solution: objective 3600 Presolve removed 8 rows and 38 columns Presolve time: 0.00s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 2715.0000000 Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: objective 1.975000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1975.0000000 1975.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1975 2715 2775 Pool objective bound 1975 Optimal solution found (tolerance 1.00e-04) Best objective 1.975000000000e+03, best bound 1.975000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 3500 Presolve removed 8 rows and 38 columns Presolve time: 0.00s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 2540.0000000 Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: objective 1.950000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1950.0000000 1950.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1950 2540 2600 Pool objective bound 1950 Optimal solution found (tolerance 1.00e-04) Best objective 1.950000000000e+03, best bound 1.950000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+03] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 25000 Presolve removed 9 rows and 44 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 11575 Pool objective bound 11575 Optimal solution found (tolerance 1.00e-04) Best objective 1.157500000000e+04, best bound 1.157500000000e+04, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+03] Bounds range [1e+00, 1e+00] RHS range [4e+00, 2e+01] Found heuristic solution: objective 29000 Presolve removed 4 rows and 35 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (0 binary) Root relaxation: objective 2.870000e+03, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 2870.0000000 2870.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 2870 29000 Pool objective bound 2870 Optimal solution found (tolerance 1.00e-04) Best objective 2.870000000000e+03, best bound 2.870000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+03] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 17000 Presolve removed 9 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 2830 Pool objective bound 2830 Optimal solution found (tolerance 1.00e-04) Best objective 2.830000000000e+03, best bound 2.830000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+04] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 210000 Presolve removed 8 rows and 38 columns Presolve time: 0.00s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 120515.00000 Variable types: 0 continuous, 6 integer (1 binary) Root relaxation: objective 8.069500e+04, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 80695.000000 80695.0000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 80695 120515 130475 Pool objective bound 80695 Optimal solution found (tolerance 1.00e-04) Best objective 8.069500000000e+04, best bound 8.069500000000e+04, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+04] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 350000 Presolve removed 8 rows and 38 columns Presolve time: 0.00s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 200640.00000 Variable types: 0 continuous, 6 integer (0 binary) Root relaxation: objective 8.118000e+04, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 81180.000000 81180.0000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 81180 200640 210600 Pool objective bound 81180 Optimal solution found (tolerance 1.00e-04) Best objective 8.118000000000e+04, best bound 8.118000000000e+04, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+04] Bounds range [1e+00, 1e+00] RHS range [1e+00, 9e+00] Found heuristic solution: objective 150000 Presolve removed 4 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (1 binary) Root relaxation: objective 3.600000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 360.0000000 360.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 360 150000 Pool objective bound 360 Optimal solution found (tolerance 1.00e-04) Best objective 3.600000000000e+02, best bound 3.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+04] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 250000 Presolve removed 4 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (1 binary) Root relaxation: objective 8.650000e+02, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 250000 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+04] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 270000 Presolve removed 8 rows and 38 columns Presolve time: 0.00s Presolved: 1 rows, 6 columns, 6 nonzeros Found heuristic solution: objective 200390.00000 Variable types: 0 continuous, 6 integer (1 binary) Root relaxation: objective 1.307100e+05, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 130710.00000 130710.000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 130710 200390 210350 Pool objective bound 130710 Optimal solution found (tolerance 1.00e-04) Best objective 1.307100000000e+05, best bound 1.307100000000e+05, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+04] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 220000 Presolve removed 4 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (2 binary) Root relaxation: objective 1.083000e+04, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 10830.000000 10830.0000 0.00% - 0s Explored 0 nodes (7 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 10830 220000 Pool objective bound 10830 Optimal solution found (tolerance 1.00e-04) Best objective 1.083000000000e+04, best bound 1.083000000000e+04, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+05] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2.3e+06 Presolve removed 9 rows and 44 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1.20032e+06 Pool objective bound 1.20032e+06 Optimal solution found (tolerance 1.00e-04) Best objective 1.200320000000e+06, best bound 1.200320000000e+06, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 44 columns and 26 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+05] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2.3e+06 Presolve removed 6 rows and 37 columns Presolve time: 0.00s Presolved: 5 rows, 7 columns, 13 nonzeros Variable types: 0 continuous, 7 integer (3 binary) Root relaxation: objective 6.350000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 635.0000000 635.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 635 2.3e+06 Pool objective bound 635 Optimal solution found (tolerance 1.00e-04) Best objective 6.350000000000e+02, best bound 6.350000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 44 columns and 26 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+05] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2.1e+06 Presolve removed 10 rows and 39 columns Presolve time: 0.00s Presolved: 1 rows, 5 columns, 5 nonzeros Variable types: 0 continuous, 5 integer (0 binary) Root relaxation: objective 4.200000e+02, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 420.0000000 420.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 420 2.1e+06 Pool objective bound 420 Optimal solution found (tolerance 1.00e-04) Best objective 4.200000000000e+02, best bound 4.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 44 columns and 26 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 1e+05] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2.8e+06 Presolve removed 10 rows and 40 columns Presolve time: 0.00s Presolved: 1 rows, 4 columns, 4 nonzeros Found heuristic solution: objective 1000555.0000 Variable types: 0 continuous, 4 integer (0 binary) Root relaxation: objective 5.009100e+05, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 500910.00000 500910.000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 500910 1.00056e+06 1.20068e+06 Pool objective bound 500910 Optimal solution found (tolerance 1.00e-04) Best objective 5.009100000000e+05, best bound 5.009100000000e+05, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 44 columns and 26 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 2400 Presolve removed 11 rows and 44 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1235 Pool objective bound 1235 Optimal solution found (tolerance 1.00e-04) Best objective 1.235000000000e+03, best bound 1.235000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2400 Presolve removed 9 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1460 Pool objective bound 1460 Optimal solution found (tolerance 1.00e-04) Best objective 1.460000000000e+03, best bound 1.460000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1800 Presolve removed 4 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (4 binary) Root relaxation: objective 6.000000e+02, 6 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 600.0000000 600.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 600 1800 Pool objective bound 600 Optimal solution found (tolerance 1.00e-04) Best objective 6.000000000000e+02, best bound 6.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+01] Found heuristic solution: objective 1600 Presolve removed 4 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (0 binary) Root relaxation: objective 3.550000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 355.0000000 355.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 355 1600 Pool objective bound 355 Optimal solution found (tolerance 1.00e-04) Best objective 3.550000000000e+02, best bound 3.550000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2800 Presolve removed 4 rows and 35 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (2 binary) Root relaxation: objective 1.330000e+03, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1330.0000000 1330.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1330 2800 Pool objective bound 1330 Optimal solution found (tolerance 1.00e-04) Best objective 1.330000000000e+03, best bound 1.330000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 700 Presolve removed 9 rows and 44 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 175 Pool objective bound 175 Optimal solution found (tolerance 1.00e-04) Best objective 1.750000000000e+02, best bound 1.750000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2800 Presolve removed 9 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1530 Pool objective bound 1530 Optimal solution found (tolerance 1.00e-04) Best objective 1.530000000000e+03, best bound 1.530000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 3400 Presolve removed 4 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (0 binary) Root relaxation: objective 1.590000e+03, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1590.0000000 1590.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1590 3400 Pool objective bound 1590 Optimal solution found (tolerance 1.00e-04) Best objective 1.590000000000e+03, best bound 1.590000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2600 Presolve removed 9 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1535 Pool objective bound 1535 Optimal solution found (tolerance 1.00e-04) Best objective 1.535000000000e+03, best bound 1.535000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 1e+01] Found heuristic solution: objective 2700 Presolve removed 4 rows and 35 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 15 nonzeros Variable types: 0 continuous, 9 integer (0 binary) Root relaxation: objective 1.040000e+03, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1040.0000000 1040.00000 0.00% - 0s Explored 0 nodes (7 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1040 2700 Pool objective bound 1040 Optimal solution found (tolerance 1.00e-04) Best objective 1.040000000000e+03, best bound 1.040000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+01] Found heuristic solution: objective 1300 Presolve removed 4 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (0 binary) Root relaxation: objective 2.200000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 220.0000000 220.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 220 1300 Pool objective bound 220 Optimal solution found (tolerance 1.00e-04) Best objective 2.200000000000e+02, best bound 2.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 2400 Presolve removed 4 rows and 34 columns Presolve time: 0.00s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (0 binary) Root relaxation: objective 1.135000e+03, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1135.0000000 1135.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1135 2400 Pool objective bound 1135 Optimal solution found (tolerance 1.00e-04) Best objective 1.135000000000e+03, best bound 1.135000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 22 columns and 12 nonzeros Variable types: 0 continuous, 22 integer (7 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [2e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1400 Presolve removed 9 rows and 22 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 800 Pool objective bound 800 Optimal solution found (tolerance 1.00e-04) Best objective 8.000000000000e+02, best bound 8.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 22 columns and 12 nonzeros Variable types: 0 continuous, 22 integer (7 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [2e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 7e+00] Found heuristic solution: objective 400 Presolve removed 9 rows and 22 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 100 Pool objective bound 100 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+02, best bound 1.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 22 columns and 12 nonzeros Variable types: 0 continuous, 22 integer (7 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [2e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 8e+00] Found heuristic solution: objective 700 Presolve removed 9 rows and 22 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 175 Pool objective bound 175 Optimal solution found (tolerance 1.00e-04) Best objective 1.750000000000e+02, best bound 1.750000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 22 columns and 12 nonzeros Variable types: 0 continuous, 22 integer (7 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [2e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 2e+01] Found heuristic solution: objective 2300 Presolve removed 9 rows and 22 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 2050 Pool objective bound 2050 Optimal solution found (tolerance 1.00e-04) Best objective 2.050000000000e+03, best bound 2.050000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 22 columns and 12 nonzeros Variable types: 0 continuous, 22 integer (7 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [2e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+01] Found heuristic solution: objective 1400 Presolve removed 9 rows and 22 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 650 Pool objective bound 650 Optimal solution found (tolerance 1.00e-04) Best objective 6.500000000000e+02, best bound 6.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 22 columns and 12 nonzeros Variable types: 0 continuous, 22 integer (7 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [2e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 2e+01] Found heuristic solution: objective 1700 Presolve removed 9 rows and 22 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 925 Pool objective bound 925 Optimal solution found (tolerance 1.00e-04) Best objective 9.250000000000e+02, best bound 9.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 36 rows, 22 columns and 59 nonzeros Variable types: 0 continuous, 22 integer (7 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [2e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2300 Presolve removed 36 rows and 22 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1400 Pool objective bound 1400 Optimal solution found (tolerance 1.00e-04) Best objective 1.400000000000e+03, best bound 1.400000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 36 rows, 22 columns and 59 nonzeros Variable types: 0 continuous, 22 integer (7 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [2e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1200 Presolve removed 36 rows and 22 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 400 Pool objective bound 400 Optimal solution found (tolerance 1.00e-04) Best objective 4.000000000000e+02, best bound 4.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 36 rows, 22 columns and 59 nonzeros Variable types: 0 continuous, 22 integer (7 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [2e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 300 Presolve removed 36 rows and 22 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 75 Pool objective bound 75 Optimal solution found (tolerance 1.00e-04) Best objective 7.500000000000e+01, best bound 7.500000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 36 rows, 22 columns and 59 nonzeros Variable types: 0 continuous, 22 integer (7 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [2e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 500 Presolve removed 36 rows and 22 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 125 Pool objective bound 125 Optimal solution found (tolerance 1.00e-04) Best objective 1.250000000000e+02, best bound 1.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 36 rows, 22 columns and 59 nonzeros Variable types: 0 continuous, 22 integer (7 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [2e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 1e+02] Found heuristic solution: objective 400 Presolve removed 36 rows and 22 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 100 Pool objective bound 100 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+02, best bound 1.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 36 rows, 22 columns and 59 nonzeros Variable types: 0 continuous, 22 integer (7 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [2e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1100 Presolve removed 36 rows and 22 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 400 Pool objective bound 400 Optimal solution found (tolerance 1.00e-04) Best objective 4.000000000000e+02, best bound 4.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 36 rows, 22 columns and 59 nonzeros Variable types: 0 continuous, 22 integer (7 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [2e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 700 Presolve removed 36 rows and 22 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 375 Pool objective bound 375 Optimal solution found (tolerance 1.00e-04) Best objective 3.750000000000e+02, best bound 3.750000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 65 rows, 44 columns and 134 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 65 rows and 44 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1190 Pool objective bound 1190 Optimal solution found (tolerance 1.00e-04) Best objective 1.190000000000e+03, best bound 1.190000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 65 rows, 44 columns and 134 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 65 rows and 44 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1190 Pool objective bound 1190 Optimal solution found (tolerance 1.00e-04) Best objective 1.190000000000e+03, best bound 1.190000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 36 rows, 22 columns and 59 nonzeros Variable types: 0 continuous, 22 integer (7 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [2e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 700 Presolve removed 36 rows and 22 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 250 Pool objective bound 250 Optimal solution found (tolerance 1.00e-04) Best objective 2.500000000000e+02, best bound 2.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 65 rows, 44 columns and 134 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 65 rows and 44 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1190 Pool objective bound 1190 Optimal solution found (tolerance 1.00e-04) Best objective 1.190000000000e+03, best bound 1.190000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 65 rows, 44 columns and 134 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 65 rows and 44 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1190 Pool objective bound 1190 Optimal solution found (tolerance 1.00e-04) Best objective 1.190000000000e+03, best bound 1.190000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 9 rows, 44 columns and 24 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1700 Presolve removed 4 rows and 34 columns Presolve time: 0.02s Presolved: 5 rows, 10 columns, 16 nonzeros Variable types: 0 continuous, 10 integer (1 binary) Root relaxation: objective 5.300000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 530.0000000 530.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 2: 530 1700 Pool objective bound 530 Optimal solution found (tolerance 1.00e-04) Best objective 5.300000000000e+02, best bound 5.300000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 11 rows, 44 columns and 26 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+00] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+01] Found heuristic solution: objective 1700 Presolve removed 6 rows and 36 columns Presolve time: 0.00s Presolved: 5 rows, 8 columns, 14 nonzeros Variable types: 0 continuous, 8 integer (1 binary) Root relaxation: objective 5.300000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 530.0000000 530.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.20 seconds Thread count was 4 (of 4 available processors) Solution count 2: 530 1700 Pool objective bound 530 Optimal solution found (tolerance 1.00e-04) Best objective 5.300000000000e+02, best bound 5.300000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 44 rows, 44 columns and 85 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 42 rows and 38 columns Presolve time: 0.00s Presolved: 2 rows, 6 columns, 7 nonzeros Found heuristic solution: objective 570.0000000 Variable types: 0 continuous, 6 integer (1 binary) Root relaxation: objective 5.300000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 530.0000000 530.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 530 570 1400 Pool objective bound 530 Optimal solution found (tolerance 1.00e-04) Best objective 5.300000000000e+02, best bound 5.300000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 65 rows, 44 columns and 134 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 65 rows and 44 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1190 Pool objective bound 1190 Optimal solution found (tolerance 1.00e-04) Best objective 1.190000000000e+03, best bound 1.190000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 47 rows, 44 columns and 100 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 47 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1190 Pool objective bound 1190 Optimal solution found (tolerance 1.00e-04) Best objective 1.190000000000e+03, best bound 1.190000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 47 rows, 44 columns and 100 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 47 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1190 Pool objective bound 1190 Optimal solution found (tolerance 1.00e-04) Best objective 1.190000000000e+03, best bound 1.190000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 44 columns and 88 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 41 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1190 Pool objective bound 1190 Optimal solution found (tolerance 1.00e-04) Best objective 1.190000000000e+03, best bound 1.190000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 44 columns and 88 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 41 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1190 Pool objective bound 1190 Optimal solution found (tolerance 1.00e-04) Best objective 1.190000000000e+03, best bound 1.190000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 35 rows, 44 columns and 76 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 35 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1190 Pool objective bound 1190 Optimal solution found (tolerance 1.00e-04) Best objective 1.190000000000e+03, best bound 1.190000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 44 columns and 80 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 41 rows and 44 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 820 Pool objective bound 820 Optimal solution found (tolerance 1.00e-04) Best objective 8.200000000000e+02, best bound 8.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 44 columns and 80 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 41 rows and 44 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 820 Pool objective bound 820 Optimal solution found (tolerance 1.00e-04) Best objective 8.200000000000e+02, best bound 8.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 88 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2050 Presolve removed 41 rows and 58 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 820 Pool objective bound 820 Optimal solution found (tolerance 1.00e-04) Best objective 8.200000000000e+02, best bound 8.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 88 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2050 Presolve removed 41 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 820 Pool objective bound 820 Optimal solution found (tolerance 1.00e-04) Best objective 8.200000000000e+02, best bound 8.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 88 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 41 rows and 58 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 820 Pool objective bound 820 Optimal solution found (tolerance 1.00e-04) Best objective 8.200000000000e+02, best bound 8.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 88 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 41 rows and 58 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 820 Pool objective bound 820 Optimal solution found (tolerance 1.00e-04) Best objective 8.200000000000e+02, best bound 8.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 88 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3400 Presolve removed 41 rows and 58 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1840 Pool objective bound 1840 Optimal solution found (tolerance 1.00e-04) Best objective 1.840000000000e+03, best bound 1.840000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 88 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 41 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 780 Pool objective bound 780 Optimal solution found (tolerance 1.00e-04) Best objective 7.800000000000e+02, best bound 7.800000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 88 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 1600 Presolve removed 41 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 880 Pool objective bound 880 Optimal solution found (tolerance 1.00e-04) Best objective 8.800000000000e+02, best bound 8.800000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 88 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1300 Presolve removed 41 rows and 58 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 830 Pool objective bound 830 Optimal solution found (tolerance 1.00e-04) Best objective 8.300000000000e+02, best bound 8.300000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 96 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1900 Presolve removed 40 rows and 53 columns Presolve time: 0.00s Presolved: 1 rows, 5 columns, 5 nonzeros Found heuristic solution: objective 1135.0000000 Variable types: 0 continuous, 5 integer (1 binary) Root relaxation: objective 1.085000e+03, 1 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1085.0000000 1085.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1085 1135 1425 Pool objective bound 1085 Optimal solution found (tolerance 1.00e-04) Best objective 1.085000000000e+03, best bound 1.085000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 96 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 41 rows and 58 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 585 Pool objective bound 585 Optimal solution found (tolerance 1.00e-04) Best objective 5.850000000000e+02, best bound 5.850000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 96 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1100 Presolve removed 41 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 460 Pool objective bound 460 Optimal solution found (tolerance 1.00e-04) Best objective 4.600000000000e+02, best bound 4.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 100 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2300 Presolve removed 40 rows and 53 columns Presolve time: 0.01s Presolved: 1 rows, 5 columns, 5 nonzeros Found heuristic solution: objective 1425.0000000 Variable types: 0 continuous, 5 integer (2 binary) Root relaxation: objective 1.325000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1325.0000000 1325.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1325 1425 1775 Pool objective bound 1325 Optimal solution found (tolerance 1.00e-04) Best objective 1.325000000000e+03, best bound 1.325000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 100 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 500 Presolve removed 41 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 125 Pool objective bound 125 Optimal solution found (tolerance 1.00e-04) Best objective 1.250000000000e+02, best bound 1.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 100 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1900 Presolve removed 40 rows and 53 columns Presolve time: 0.00s Presolved: 1 rows, 5 columns, 5 nonzeros Found heuristic solution: objective 745.0000000 Variable types: 0 continuous, 5 integer (1 binary) Root relaxation: objective 5.250000e+02, 1 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 525.0000000 525.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 525 745 1375 Pool objective bound 525 Optimal solution found (tolerance 1.00e-04) Best objective 5.250000000000e+02, best bound 5.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 100 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2500 Presolve removed 40 rows and 53 columns Presolve time: 0.00s Presolved: 1 rows, 5 columns, 5 nonzeros Found heuristic solution: objective 1555.0000000 Variable types: 0 continuous, 5 integer (1 binary) Root relaxation: objective 1.375000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1375.0000000 1375.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1375 1555 1950 Pool objective bound 1375 Optimal solution found (tolerance 1.00e-04) Best objective 1.375000000000e+03, best bound 1.375000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 100 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 2500 Presolve removed 40 rows and 53 columns Presolve time: 0.00s Presolved: 1 rows, 5 columns, 5 nonzeros Found heuristic solution: objective 1425.0000000 Variable types: 0 continuous, 5 integer (0 binary) Root relaxation: objective 1.335000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1335.0000000 1335.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1335 1425 1925 Pool objective bound 1335 Optimal solution found (tolerance 1.00e-04) Best objective 1.335000000000e+03, best bound 1.335000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 100 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2400 Presolve removed 40 rows and 53 columns Presolve time: 0.00s Presolved: 1 rows, 5 columns, 5 nonzeros Found heuristic solution: objective 1330.0000000 Variable types: 0 continuous, 5 integer (1 binary) Root relaxation: objective 1.185000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1185.0000000 1185.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1185 1330 1650 Pool objective bound 1185 Optimal solution found (tolerance 1.00e-04) Best objective 1.185000000000e+03, best bound 1.185000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 100 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2100 Presolve removed 40 rows and 53 columns Presolve time: 0.00s Presolved: 1 rows, 5 columns, 5 nonzeros Found heuristic solution: objective 1215.0000000 Variable types: 0 continuous, 5 integer (0 binary) Root relaxation: objective 1.020000e+03, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1020.0000000 1020.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1020 1215 1550 Pool objective bound 1020 Optimal solution found (tolerance 1.00e-04) Best objective 1.020000000000e+03, best bound 1.020000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 100 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1300 Presolve removed 22 rows and 41 columns Presolve time: 0.00s Presolved: 19 rows, 17 columns, 55 nonzeros Variable types: 0 continuous, 17 integer (5 binary) Root relaxation: objective 3.800000e+02, 11 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 380.0000000 380.00000 0.00% - 0s Explored 0 nodes (21 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 380 1300 Pool objective bound 380 Optimal solution found (tolerance 1.00e-04) Best objective 3.800000000000e+02, best bound 3.800000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 100 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1300 Presolve removed 29 rows and 45 columns Presolve time: 0.00s Presolved: 12 rows, 13 columns, 38 nonzeros Variable types: 0 continuous, 13 integer (3 binary) Root relaxation: objective 2.400000e+02, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 240.00000 0 1 1300.00000 240.00000 81.5% - 0s H 0 0 350.0000000 240.00000 31.4% - 0s * 0 0 0 240.0000000 240.00000 0.00% - 0s Cutting planes: MIR: 1 StrongCG: 1 Flow cover: 1 Explored 0 nodes (13 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 3: 240 350 1300 Pool objective bound 240 Optimal solution found (tolerance 1.00e-04) Best objective 2.400000000000e+02, best bound 2.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 90 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1000 Presolve removed 38 rows and 54 columns Presolve time: 0.01s Presolved: 3 rows, 4 columns, 7 nonzeros Variable types: 0 continuous, 4 integer (1 binary) Root relaxation: objective 3.500000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 350.0000000 350.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 350 1000 Pool objective bound 350 Optimal solution found (tolerance 1.00e-04) Best objective 3.500000000000e+02, best bound 3.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 90 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2500 Presolve removed 34 rows and 52 columns Presolve time: 0.00s Presolved: 7 rows, 6 columns, 16 nonzeros Variable types: 0 continuous, 6 integer (1 binary) Root relaxation: objective 1.015000e+03, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1015.0000000 1015.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1015 2500 Pool objective bound 1015 Optimal solution found (tolerance 1.00e-04) Best objective 1.015000000000e+03, best bound 1.015000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 90 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1100 Presolve removed 41 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 460 Pool objective bound 460 Optimal solution found (tolerance 1.00e-04) Best objective 4.600000000000e+02, best bound 4.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 90 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 1e+02] Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 90 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 41 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 615 Pool objective bound 615 Optimal solution found (tolerance 1.00e-04) Best objective 6.150000000000e+02, best bound 6.150000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 90 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1300 Presolve removed 41 rows and 58 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 525 Pool objective bound 525 Optimal solution found (tolerance 1.00e-04) Best objective 5.250000000000e+02, best bound 5.250000000000e+02, gap 0.0000% Gurobi 7.0.1 (mac64, Python) logging started Wed Feb 8 09:36:05 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 90 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 2600 Presolve removed 41 rows and 58 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1220 Pool objective bound 1220 Optimal solution found (tolerance 1.00e-04) Best objective 1.220000000000e+03, best bound 1.220000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 41 rows, 58 columns and 90 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 800 Presolve removed 41 rows and 58 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 350 Pool objective bound 350 Optimal solution found (tolerance 1.00e-04) Best objective 3.500000000000e+02, best bound 3.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 47 rows, 58 columns and 96 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1800 Presolve removed 47 rows and 58 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 935 Pool objective bound 935 Optimal solution found (tolerance 1.00e-04) Best objective 9.350000000000e+02, best bound 9.350000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 47 rows, 58 columns and 96 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 500 Presolve removed 47 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 150 Pool objective bound 150 Optimal solution found (tolerance 1.00e-04) Best objective 1.500000000000e+02, best bound 1.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 47 rows, 58 columns and 96 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 41 rows and 53 columns Presolve time: 0.00s Presolved: 6 rows, 5 columns, 13 nonzeros Variable types: 0 continuous, 5 integer (2 binary) Root relaxation: objective 6.400000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 640.0000000 640.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 640 1500 Pool objective bound 640 Optimal solution found (tolerance 1.00e-04) Best objective 6.400000000000e+02, best bound 6.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1600 Presolve removed 48 rows and 52 columns Presolve time: 0.01s Presolved: 7 rows, 6 columns, 16 nonzeros Found heuristic solution: objective 895.0000000 Variable types: 0 continuous, 6 integer (1 binary) Root relaxation: objective 8.050000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 805.0000000 805.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 805 895 1300 Pool objective bound 805 Optimal solution found (tolerance 1.00e-04) Best objective 8.050000000000e+02, best bound 8.050000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2100 Presolve removed 42 rows and 47 columns Presolve time: 0.00s Presolved: 13 rows, 11 columns, 35 nonzeros Variable types: 0 continuous, 11 integer (5 binary) Root relaxation: objective 1.105000e+03, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1105.0000000 1105.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1105 2100 Pool objective bound 1105 Optimal solution found (tolerance 1.00e-04) Best objective 1.105000000000e+03, best bound 1.105000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1600 Presolve removed 49 rows and 53 columns Presolve time: 0.00s Presolved: 6 rows, 5 columns, 13 nonzeros Variable types: 0 continuous, 5 integer (2 binary) Root relaxation: objective 6.900000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 690.0000000 690.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 690 1600 Pool objective bound 690 Optimal solution found (tolerance 1.00e-04) Best objective 6.900000000000e+02, best bound 6.900000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 900 Presolve removed 52 rows and 55 columns Presolve time: 0.00s Presolved: 3 rows, 3 columns, 6 nonzeros Variable types: 0 continuous, 3 integer (1 binary) Root relaxation: objective 1.900000e+02, 2 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 190.0000000 190.00000 0.00% - 0s Explored 0 nodes (2 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 190 900 Pool objective bound 190 Optimal solution found (tolerance 1.00e-04) Best objective 1.900000000000e+02, best bound 1.900000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 400 Presolve removed 55 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 70 Pool objective bound 70 Optimal solution found (tolerance 1.00e-04) Best objective 7.000000000000e+01, best bound 7.000000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 500 Presolve removed 55 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 110 Pool objective bound 110 Optimal solution found (tolerance 1.00e-04) Best objective 1.100000000000e+02, best bound 1.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 1800 Presolve removed 48 rows and 52 columns Presolve time: 0.00s Presolved: 7 rows, 6 columns, 16 nonzeros Found heuristic solution: objective 915.0000000 Variable types: 0 continuous, 6 integer (1 binary) Root relaxation: objective 7.350000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 735.0000000 735.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 3: 735 915 1650 Pool objective bound 735 Optimal solution found (tolerance 1.00e-04) Best objective 7.350000000000e+02, best bound 7.350000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 900 Presolve removed 55 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 425 Pool objective bound 425 Optimal solution found (tolerance 1.00e-04) Best objective 4.250000000000e+02, best bound 4.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1000 Presolve removed 55 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 250 Pool objective bound 250 Optimal solution found (tolerance 1.00e-04) Best objective 2.500000000000e+02, best bound 2.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1200 Presolve removed 55 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 500 Pool objective bound 500 Optimal solution found (tolerance 1.00e-04) Best objective 5.000000000000e+02, best bound 5.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2000 Presolve removed 55 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 585 Pool objective bound 585 Optimal solution found (tolerance 1.00e-04) Best objective 5.850000000000e+02, best bound 5.850000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1300 Presolve removed 55 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 400 Pool objective bound 400 Optimal solution found (tolerance 1.00e-04) Best objective 4.000000000000e+02, best bound 4.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 1400 Presolve removed 49 rows and 53 columns Presolve time: 0.00s Presolved: 6 rows, 5 columns, 13 nonzeros Variable types: 0 continuous, 5 integer (2 binary) Root relaxation: objective 4.550000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 455.0000000 455.00000 0.00% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 455 1400 Pool objective bound 455 Optimal solution found (tolerance 1.00e-04) Best objective 4.550000000000e+02, best bound 4.550000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2000 Presolve removed 55 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 625 Pool objective bound 625 Optimal solution found (tolerance 1.00e-04) Best objective 6.250000000000e+02, best bound 6.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 55 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1050 Pool objective bound 1050 Optimal solution found (tolerance 1.00e-04) Best objective 1.050000000000e+03, best bound 1.050000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 49 rows and 53 columns Presolve time: 0.00s Presolved: 6 rows, 5 columns, 13 nonzeros Variable types: 0 continuous, 5 integer (2 binary) Root relaxation: objective 5.900000e+02, 4 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 590.0000000 590.00000 0.00% - 0s Explored 0 nodes (4 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 590 1500 Pool objective bound 590 Optimal solution found (tolerance 1.00e-04) Best objective 5.900000000000e+02, best bound 5.900000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2200 Presolve removed 55 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1025 Pool objective bound 1025 Optimal solution found (tolerance 1.00e-04) Best objective 1.025000000000e+03, best bound 1.025000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2100 Presolve removed 55 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 900 Pool objective bound 900 Optimal solution found (tolerance 1.00e-04) Best objective 9.000000000000e+02, best bound 9.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2100 Presolve removed 48 rows and 51 columns Presolve time: 0.00s Presolved: 7 rows, 7 columns, 18 nonzeros Found heuristic solution: objective 1075.0000000 Variable types: 0 continuous, 7 integer (1 binary) Root relaxation: cutoff, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 1075.00000 1070.00108 0.47% - 0s Explored 0 nodes (3 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1075 1910 Pool objective bound 1075 Optimal solution found (tolerance 1.00e-04) Best objective 1.075000000000e+03, best bound 1.075000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 47 rows, 58 columns and 96 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 900 Presolve removed 47 rows and 58 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 235 Pool objective bound 235 Optimal solution found (tolerance 1.00e-04) Best objective 2.350000000000e+02, best bound 2.350000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 47 rows, 58 columns and 96 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1400 Presolve removed 44 rows and 55 columns Presolve time: 0.00s Presolved: 3 rows, 3 columns, 6 nonzeros Variable types: 0 continuous, 3 integer (1 binary) Root relaxation: objective 3.950000e+02, 2 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 395.0000000 395.00000 0.00% - 0s Explored 0 nodes (2 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 395 1400 Pool objective bound 395 Optimal solution found (tolerance 1.00e-04) Best objective 3.950000000000e+02, best bound 3.950000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 47 rows, 58 columns and 96 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2300 Presolve removed 39 rows and 50 columns Presolve time: 0.00s Presolved: 8 rows, 8 columns, 19 nonzeros Found heuristic solution: objective 1115.0000000 Variable types: 0 continuous, 8 integer (1 binary) Root relaxation: objective 1.005000e+03, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1005.0000000 1005.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1005 1115 2240 Pool objective bound 1005 Optimal solution found (tolerance 1.00e-04) Best objective 1.005000000000e+03, best bound 1.005000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 47 rows, 58 columns and 96 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2100 Presolve removed 37 rows and 49 columns Presolve time: 0.01s Presolved: 10 rows, 9 columns, 25 nonzeros Variable types: 0 continuous, 9 integer (4 binary) Root relaxation: objective 1.105000e+03, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1105.0000000 1105.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1105 2100 Pool objective bound 1105 Optimal solution found (tolerance 1.00e-04) Best objective 1.105000000000e+03, best bound 1.105000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 47 rows, 58 columns and 96 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2100 Presolve removed 37 rows and 49 columns Presolve time: 0.00s Presolved: 10 rows, 9 columns, 25 nonzeros Variable types: 0 continuous, 9 integer (4 binary) Root relaxation: objective 1.105000e+03, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1105.0000000 1105.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1105 2100 Pool objective bound 1105 Optimal solution found (tolerance 1.00e-04) Best objective 1.105000000000e+03, best bound 1.105000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 47 rows, 58 columns and 96 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2100 Presolve removed 37 rows and 49 columns Presolve time: 0.00s Presolved: 10 rows, 9 columns, 25 nonzeros Variable types: 0 continuous, 9 integer (4 binary) Root relaxation: objective 1.105000e+03, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1105.0000000 1105.00000 0.00% - 0s Explored 0 nodes (5 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1105 2100 Pool objective bound 1105 Optimal solution found (tolerance 1.00e-04) Best objective 1.105000000000e+03, best bound 1.105000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 114 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2100 Presolve removed 42 rows and 47 columns Presolve time: 0.01s Presolved: 13 rows, 11 columns, 35 nonzeros Variable types: 0 continuous, 11 integer (5 binary) Root relaxation: objective 1.105000e+03, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1105.0000000 1105.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1105 2100 Pool objective bound 1105 Optimal solution found (tolerance 1.00e-04) Best objective 1.105000000000e+03, best bound 1.105000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 79 rows, 58 columns and 154 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2100 Presolve removed 66 rows and 47 columns Presolve time: 0.01s Presolved: 13 rows, 11 columns, 35 nonzeros Variable types: 0 continuous, 11 integer (5 binary) Root relaxation: objective 1.105000e+03, 6 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1105.0000000 1105.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1105 2100 Pool objective bound 1105 Optimal solution found (tolerance 1.00e-04) Best objective 1.105000000000e+03, best bound 1.105000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 79 rows, 58 columns and 168 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2100 Presolve removed 62 rows and 43 columns Presolve time: 0.02s Presolved: 17 rows, 15 columns, 52 nonzeros Variable types: 0 continuous, 15 integer (4 binary) Root relaxation: objective 1.105000e+03, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1105.0000000 1105.00000 0.00% - 0s Explored 0 nodes (7 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1105 2100 Pool objective bound 1105 Optimal solution found (tolerance 1.00e-04) Best objective 1.105000000000e+03, best bound 1.105000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 128 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2100 Presolve removed 37 rows and 42 columns Presolve time: 0.00s Presolved: 18 rows, 16 columns, 61 nonzeros Variable types: 0 continuous, 16 integer (3 binary) Root relaxation: objective 1.105000e+03, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1105.0000000 1105.00000 0.00% - 0s Explored 0 nodes (7 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1105 2100 Pool objective bound 1105 Optimal solution found (tolerance 1.00e-04) Best objective 1.105000000000e+03, best bound 1.105000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 55 rows, 58 columns and 128 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2100 Presolve removed 46 rows and 48 columns Presolve time: 0.00s Presolved: 9 rows, 10 columns, 29 nonzeros Found heuristic solution: objective 1075.0000000 Variable types: 0 continuous, 10 integer (1 binary) Root relaxation: cutoff, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 1075.00000 1070.00108 0.47% - 0s Explored 0 nodes (3 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1075 2030 Pool objective bound 1075 Optimal solution found (tolerance 1.00e-04) Best objective 1.075000000000e+03, best bound 1.075000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 79 rows, 58 columns and 168 nonzeros Variable types: 0 continuous, 58 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2100 Presolve removed 72 rows and 51 columns Presolve time: 0.00s Presolved: 7 rows, 7 columns, 18 nonzeros Found heuristic solution: objective 1075.0000000 Variable types: 0 continuous, 7 integer (1 binary) Root relaxation: cutoff, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 1075.00000 1070.00108 0.47% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1075 1910 Pool objective bound 1075 Optimal solution found (tolerance 1.00e-04) Best objective 1.075000000000e+03, best bound 1.075000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 79 rows, 44 columns and 168 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2100 Presolve removed 72 rows and 37 columns Presolve time: 0.00s Presolved: 7 rows, 7 columns, 18 nonzeros Found heuristic solution: objective 1075.0000000 Variable types: 0 continuous, 7 integer (1 binary) Root relaxation: cutoff, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 1075.00000 1070.00108 0.47% - 0s Explored 0 nodes (3 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1075 1910 Pool objective bound 1075 Optimal solution found (tolerance 1.00e-04) Best objective 1.075000000000e+03, best bound 1.075000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 79 rows, 44 columns and 168 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2300 Presolve removed 68 rows and 34 columns Presolve time: 0.00s Presolved: 11 rows, 10 columns, 28 nonzeros Variable types: 0 continuous, 10 integer (2 binary) Root relaxation: objective 1.005000e+03, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1005.0000000 1005.00000 0.00% - 0s Explored 0 nodes (7 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1005 2300 Pool objective bound 1005 Optimal solution found (tolerance 1.00e-04) Best objective 1.005000000000e+03, best bound 1.005000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 163 rows, 93 columns and 449 nonzeros Variable types: 0 continuous, 93 integer (30 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2800 Presolve removed 121 rows and 60 columns Presolve time: 0.01s Presolved: 42 rows, 33 columns, 161 nonzeros Variable types: 0 continuous, 33 integer (10 binary) Root relaxation: objective 1.170000e+03, 14 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1170.00000 0 1 2800.00000 1170.00000 58.2% - 0s H 0 0 1180.0000000 1170.00000 0.85% - 0s 0 0 infeasible 0 1180.00000 1175.00118 0.42% - 0s Cutting planes: Network: 1 Explored 0 nodes (20 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1180 2800 Pool objective bound 1180 Optimal solution found (tolerance 1.00e-04) Best objective 1.180000000000e+03, best bound 1.180000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 79 rows, 44 columns and 168 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2300 Presolve removed 68 rows and 34 columns Presolve time: 0.02s Presolved: 11 rows, 10 columns, 28 nonzeros Variable types: 0 continuous, 10 integer (2 binary) Root relaxation: objective 1.005000e+03, 7 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1005.0000000 1005.00000 0.00% - 0s Explored 0 nodes (7 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1005 2300 Pool objective bound 1005 Optimal solution found (tolerance 1.00e-04) Best objective 1.005000000000e+03, best bound 1.005000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 79 rows, 44 columns and 168 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2300 Presolve removed 68 rows and 34 columns Presolve time: 0.02s Presolved: 11 rows, 10 columns, 28 nonzeros Variable types: 0 continuous, 10 integer (2 binary) Root relaxation: objective 1.005000e+03, 7 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1005.0000000 1005.00000 0.00% - 0s Explored 0 nodes (7 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1005 2300 Pool objective bound 1005 Optimal solution found (tolerance 1.00e-04) Best objective 1.005000000000e+03, best bound 1.005000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 79 rows, 44 columns and 168 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2300 Presolve removed 68 rows and 34 columns Presolve time: 0.00s Presolved: 11 rows, 10 columns, 28 nonzeros Variable types: 0 continuous, 10 integer (2 binary) Root relaxation: objective 1.005000e+03, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1005.0000000 1005.00000 0.00% - 0s Explored 0 nodes (7 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1005 2300 Pool objective bound 1005 Optimal solution found (tolerance 1.00e-04) Best objective 1.005000000000e+03, best bound 1.005000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 79 rows, 44 columns and 168 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2300 Presolve removed 68 rows and 34 columns Presolve time: 0.02s Presolved: 11 rows, 10 columns, 28 nonzeros Variable types: 0 continuous, 10 integer (2 binary) Root relaxation: objective 1.005000e+03, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1005.0000000 1005.00000 0.00% - 0s Explored 0 nodes (7 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1005 2300 Pool objective bound 1005 Optimal solution found (tolerance 1.00e-04) Best objective 1.005000000000e+03, best bound 1.005000000000e+03, gap 0.0000% Gurobi 7.0.1 (mac64, Python) logging started Fri Feb 17 10:59:33 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 79 rows, 44 columns and 168 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2300 Presolve removed 68 rows and 34 columns Presolve time: 0.02s Presolved: 11 rows, 10 columns, 28 nonzeros Variable types: 0 continuous, 10 integer (2 binary) Root relaxation: objective 1.005000e+03, 7 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1005.0000000 1005.00000 0.00% - 0s Explored 0 nodes (7 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1005 2300 Pool objective bound 1005 Optimal solution found (tolerance 1.00e-04) Best objective 1.005000000000e+03, best bound 1.005000000000e+03, gap 0.0000% Gurobi 7.0.1 (mac64, Python) logging started Sun Feb 19 17:27:27 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 68 rows, 48 columns and 156 nonzeros Variable types: 0 continuous, 48 integer (12 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 1e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 1900 Presolve removed 68 rows and 48 columns Presolve time: 1.07s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 1.70 seconds Thread count was 1 (of 4 available processors) Solution count 1: 800 Pool objective bound 800 Optimal solution found (tolerance 1.00e-04) Best objective 8.000000000000e+02, best bound 8.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 313 rows, 240 columns and 880 nonzeros Variable types: 0 continuous, 240 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 313 rows and 240 columns Presolve time: 0.03s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.05 seconds Thread count was 1 (of 4 available processors) Solution count 1: 800 Pool objective bound 800 Optimal solution found (tolerance 1.00e-04) Best objective 8.000000000000e+02, best bound 8.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 79 rows, 44 columns and 168 nonzeros Variable types: 0 continuous, 44 integer (14 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [1e+01, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2300 Presolve removed 68 rows and 34 columns Presolve time: 0.03s Presolved: 11 rows, 10 columns, 28 nonzeros Variable types: 0 continuous, 10 integer (2 binary) Root relaxation: objective 1.005000e+03, 7 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1005.0000000 1005.00000 0.00% - 0s Explored 0 nodes (7 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1005 2300 Pool objective bound 1005 Optimal solution found (tolerance 1.00e-04) Best objective 1.005000000000e+03, best bound 1.005000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 163 rows, 93 columns and 449 nonzeros Variable types: 0 continuous, 93 integer (30 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2800 Presolve removed 121 rows and 60 columns Presolve time: 0.14s Presolved: 42 rows, 33 columns, 161 nonzeros Variable types: 0 continuous, 33 integer (10 binary) Root relaxation: objective 1.170000e+03, 14 iterations, 0.06 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1170.00000 0 1 2800.00000 1170.00000 58.2% - 0s H 0 0 1180.0000000 1170.00000 0.85% - 0s 0 0 infeasible 0 1180.00000 1175.00118 0.42% - 0s Cutting planes: Network: 1 Explored 0 nodes (20 simplex iterations) in 0.52 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1180 2800 Pool objective bound 1180 Optimal solution found (tolerance 1.00e-04) Best objective 1.180000000000e+03, best bound 1.180000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 163 rows, 93 columns and 449 nonzeros Variable types: 0 continuous, 93 integer (30 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3200 Presolve removed 122 rows and 61 columns Presolve time: 0.01s Presolved: 41 rows, 32 columns, 159 nonzeros Variable types: 0 continuous, 32 integer (10 binary) Root relaxation: objective 1.335000e+03, 21 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1335.0000000 1335.00000 0.00% - 0s Explored 0 nodes (23 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1335 3200 Pool objective bound 1335 Optimal solution found (tolerance 1.00e-04) Best objective 1.335000000000e+03, best bound 1.335000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 313 rows, 240 columns and 880 nonzeros Variable types: 0 continuous, 240 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 313 rows and 240 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 800 Pool objective bound 800 Optimal solution found (tolerance 1.00e-04) Best objective 8.000000000000e+02, best bound 8.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 313 rows, 240 columns and 886 nonzeros Variable types: 0 continuous, 240 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 1450 Presolve removed 313 rows and 240 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 750 Pool objective bound 750 Optimal solution found (tolerance 1.00e-04) Best objective 7.500000000000e+02, best bound 7.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 307 rows, 240 columns and 874 nonzeros Variable types: 0 continuous, 240 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective -5e+30 Presolve removed 0 rows and 56 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: -5e+30 Pool objective bound 0 Model is unbounded Warning: some integer variables take values larger than the maximum supported value (2000000000) Best objective -5.000000000000e+30, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 307 rows, 240 columns and 874 nonzeros Variable types: 0 continuous, 240 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective -5e+30 Presolve removed 0 rows and 56 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: -5e+30 Pool objective bound 0 Model is unbounded Warning: some integer variables take values larger than the maximum supported value (2000000000) Best objective -5.000000000000e+30, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 313 rows, 240 columns and 880 nonzeros Variable types: 0 continuous, 240 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 313 rows and 240 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 800 Pool objective bound 800 Optimal solution found (tolerance 1.00e-04) Best objective 8.000000000000e+02, best bound 8.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 313 rows, 240 columns and 880 nonzeros Variable types: 0 continuous, 240 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 313 rows and 240 columns Presolve time: 0.29s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.40 seconds Thread count was 1 (of 4 available processors) Solution count 1: 800 Pool objective bound 800 Optimal solution found (tolerance 1.00e-04) Best objective 8.000000000000e+02, best bound 8.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 313 rows, 240 columns and 880 nonzeros Variable types: 0 continuous, 240 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 313 rows and 240 columns Presolve time: 0.04s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.08 seconds Thread count was 1 (of 4 available processors) Solution count 1: 800 Pool objective bound 800 Optimal solution found (tolerance 1.00e-04) Best objective 8.000000000000e+02, best bound 8.000000000000e+02, gap 0.0000% Variable X ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 7 Priority2 patients arrived on day Day1 booked overtime on day Day1 : 1 Priority2 patients arrived on day Day1 booked on Day1: 4 Priority3 patients arrived on day Day1 booked on Day1: 3 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 2 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 313 rows, 240 columns and 880 nonzeros Variable types: 0 continuous, 240 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 313 rows and 240 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 800 Pool objective bound 800 Optimal solution found (tolerance 1.00e-04) Best objective 8.000000000000e+02, best bound 8.000000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 7 Priority2 patients arrived on day Day1 booked overtime on day Day1 : 1 Priority2 patients arrived on day Day1 booked on Day1: 4 Priority3 patients arrived on day Day1 booked on Day1: 3 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 2 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 313 rows, 234 columns and 880 nonzeros Variable types: 0 continuous, 234 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 313 rows and 234 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 800 Pool objective bound 800 Optimal solution found (tolerance 1.00e-04) Best objective 8.000000000000e+02, best bound 8.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 310 rows, 186 columns and 850 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 0 Presolve removed 310 rows and 186 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 310 rows, 186 columns and 850 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 0 Presolve removed 310 rows and 186 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 280 rows, 168 columns and 764 nonzeros Variable types: 0 continuous, 168 integer (54 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Gurobi 7.0.1 (mac64, Python) logging started Mon Feb 20 21:34:53 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 316 rows, 186 columns and 886 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1900 Presolve removed 310 rows and 181 columns Presolve time: 0.02s Presolved: 6 rows, 5 columns, 16 nonzeros Found heuristic solution: objective 1000.0000000 Variable types: 0 continuous, 5 integer (1 binary) Root relaxation: cutoff, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 1000.00000 995.00100 0.50% - 0s Explored 0 nodes (3 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1000 Pool objective bound 1000 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+03, best bound 1.000000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 316 rows, 186 columns and 886 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1900 Presolve removed 310 rows and 181 columns Presolve time: 0.00s Presolved: 6 rows, 5 columns, 16 nonzeros Found heuristic solution: objective 1000.0000000 Variable types: 0 continuous, 5 integer (1 binary) Root relaxation: cutoff, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 1000.00000 995.00100 0.50% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1000 Pool objective bound 1000 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+03, best bound 1.000000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 2 Priority2 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority3 patients arrived on day Day1 booked overtime on day Day1 : 3 Priority1 patients arrived on day Day1 booked on Day1: 5 Priority1 patients arrived on day Day2 booked on Day2: 2 Priority3 patients arrived on day Day2 booked on Day2: 2 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 2 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 2 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 316 rows, 186 columns and 886 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3000 Presolve removed 310 rows and 181 columns Presolve time: 0.00s Presolved: 6 rows, 5 columns, 16 nonzeros Found heuristic solution: objective 2000.0000000 Variable types: 0 continuous, 5 integer (1 binary) Root relaxation: cutoff, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 cutoff 0 2000.00000 1995.00200 0.25% - 0s Explored 0 nodes (3 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 1: 2000 Pool objective bound 2000 Optimal solution found (tolerance 1.00e-04) Best objective 2.000000000000e+03, best bound 2.000000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 2 Priority2 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority2 patients arrived on day Day2 booked overtime on day Day2 : 5 Priority3 patients arrived on day Day1 booked overtime on day Day1 : 3 Priority3 patients arrived on day Day2 booked overtime on day Day2 : 5 Priority1 patients arrived on day Day1 booked on Day1: 5 Priority1 patients arrived on day Day2 booked on Day2: 5 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 2 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 5 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 163 rows, 93 columns and 449 nonzeros Variable types: 0 continuous, 93 integer (30 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3200 Presolve removed 122 rows and 61 columns Presolve time: 0.00s Presolved: 41 rows, 32 columns, 159 nonzeros Variable types: 0 continuous, 32 integer (10 binary) Root relaxation: objective 1.335000e+03, 21 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1335.0000000 1335.00000 0.00% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1335 3200 Pool objective bound 1335 Optimal solution found (tolerance 1.00e-04) Best objective 1.335000000000e+03, best bound 1.335000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 316 rows, 186 columns and 886 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3000 Presolve removed 311 rows and 182 columns Presolve time: 0.01s Presolved: 5 rows, 4 columns, 13 nonzeros Found heuristic solution: objective 2000.0000000 Variable types: 0 continuous, 4 integer (1 binary) Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 1: 2000 Pool objective bound 2000 Optimal solution found (tolerance 1.00e-04) Best objective 2.000000000000e+03, best bound 2.000000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 2 Priority2 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority2 patients arrived on day Day2 booked overtime on day Day2 : 5 Priority3 patients arrived on day Day1 booked overtime on day Day1 : 3 Priority3 patients arrived on day Day2 booked overtime on day Day2 : 5 Priority1 patients arrived on day Day1 booked on Day1: 5 Priority1 patients arrived on day Day2 booked on Day2: 5 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 2 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 5 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 316 rows, 186 columns and 886 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3000 Presolve removed 311 rows and 182 columns Presolve time: 0.03s Presolved: 5 rows, 4 columns, 13 nonzeros Found heuristic solution: objective 2000.0000000 Variable types: 0 continuous, 4 integer (1 binary) Explored 0 nodes (0 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 1: 2000 Pool objective bound 2000 Optimal solution found (tolerance 1.00e-04) Best objective 2.000000000000e+03, best bound 2.000000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 2 Priority2 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority2 patients arrived on day Day2 booked overtime on day Day2 : 5 Priority3 patients arrived on day Day1 booked overtime on day Day1 : 3 Priority3 patients arrived on day Day2 booked overtime on day Day2 : 5 Priority1 patients arrived on day Day1 booked on Day1: 5 Priority1 patients arrived on day Day2 booked on Day2: 5 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 2 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 5 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Gurobi 7.0.1 (mac64, Python) logging started Tue Feb 21 15:49:47 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 316 rows, 186 columns and 886 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3000 Presolve removed 311 rows and 182 columns Presolve time: 0.01s Presolved: 5 rows, 4 columns, 13 nonzeros Found heuristic solution: objective 2000.0000000 Variable types: 0 continuous, 4 integer (1 binary) Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 1: 2000 Pool objective bound 2000 Optimal solution found (tolerance 1.00e-04) Best objective 2.000000000000e+03, best bound 2.000000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 2 Priority2 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority2 patients arrived on day Day2 booked overtime on day Day2 : 5 Priority3 patients arrived on day Day1 booked overtime on day Day1 : 3 Priority3 patients arrived on day Day2 booked overtime on day Day2 : 5 Priority1 patients arrived on day Day1 booked on Day1: 5 Priority1 patients arrived on day Day2 booked on Day2: 5 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 2 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 5 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 316 rows, 186 columns and 886 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 311 rows and 182 columns Presolve time: 0.01s Presolved: 5 rows, 4 columns, 13 nonzeros Found heuristic solution: objective 1000.0000000 Variable types: 0 continuous, 4 integer (1 binary) Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1000 Pool objective bound 1000 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+03, best bound 1.000000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 2 Priority2 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority3 patients arrived on day Day1 booked overtime on day Day1 : 3 Priority1 patients arrived on day Day1 booked on Day1: 5 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 2 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 316 rows, 186 columns and 886 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Presolve removed 85 rows and 12 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 316 rows, 186 columns and 886 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 311 rows and 182 columns Presolve time: 0.00s Presolved: 5 rows, 4 columns, 13 nonzeros Found heuristic solution: objective 1000.0000000 Variable types: 0 continuous, 4 integer (1 binary) Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1000 Pool objective bound 1000 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+03, best bound 1.000000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 2 Priority2 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority3 patients arrived on day Day1 booked overtime on day Day1 : 3 Priority1 patients arrived on day Day1 booked on Day1: 5 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 2 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 316 rows, 186 columns and 886 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Presolve removed 85 rows and 12 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 316 rows, 186 columns and 886 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 316 rows and 186 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 800 Pool objective bound 800 Optimal solution found (tolerance 1.00e-04) Best objective 8.000000000000e+02, best bound 8.000000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 7 Priority2 patients arrived on day Day1 booked overtime on day Day1 : 1 Priority2 patients arrived on day Day1 booked on Day1: 4 Priority3 patients arrived on day Day1 booked on Day1: 3 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 316 rows, 186 columns and 886 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [3e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 316 rows and 186 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 300 Pool objective bound 300 Optimal solution found (tolerance 1.00e-04) Best objective 3.000000000000e+02, best bound 3.000000000000e+02, gap 0.0000% Variable x ------------------------- Priority3 patients arrived on day Day1 booked overtime on day Day1 : 3 Priority1 patients arrived on day Day1 booked on Day1: 7 Priority2 patients arrived on day Day1 booked on Day1: 5 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 316 rows, 186 columns and 944 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 316 rows and 186 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1200 Pool objective bound 1200 Optimal solution found (tolerance 1.00e-04) Best objective 1.200000000000e+03, best bound 1.200000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 4 Priority2 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority3 patients arrived on day Day1 booked overtime on day Day1 : 3 Priority1 patients arrived on day Day1 booked on Day1: 3 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Gurobi 7.0.1 (mac64, Python) logging started Sat Feb 25 16:52:21 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1223 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 325 rows and 186 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 800 Pool objective bound 800 Optimal solution found (tolerance 1.00e-04) Best objective 8.000000000000e+02, best bound 8.000000000000e+02, gap 0.0000% Variable x ------------------------- Priority2 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority3 patients arrived on day Day1 booked overtime on day Day1 : 3 Priority1 patients arrived on day Day1 booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1471 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [2e+00, 1e+02] Found heuristic solution: objective 1500 Presolve removed 277 rows and 151 columns Presolve time: 0.01s Presolved: 48 rows, 35 columns, 133 nonzeros Variable types: 0 continuous, 35 integer (13 binary) Root relaxation: objective 2.719474e+02, 26 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 271.94737 0 5 1500.00000 271.94737 81.9% - 0s H 0 0 290.0000000 271.94737 6.23% - 0s 0 0 cutoff 0 290.00000 285.00029 1.72% - 0s Explored 0 nodes (44 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 290 1500 Pool objective bound 290 Optimal solution found (tolerance 1.00e-04) Best objective 2.900000000000e+02, best bound 2.900000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked on Day1: 7 Priority2 patients arrived on day Day1 booked on Day5: 5 Priority3 patients arrived on day Day1 booked on Day7: 3 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 5 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 3 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1471 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1900 Presolve removed 274 rows and 149 columns Presolve time: 0.00s Presolved: 51 rows, 37 columns, 144 nonzeros Found heuristic solution: objective 1000.0000000 Variable types: 0 continuous, 37 integer (14 binary) Root relaxation: objective 2.719474e+02, 31 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 271.94737 0 5 1000.00000 271.94737 72.8% - 0s H 0 0 290.0000000 271.94737 6.23% - 0s 0 0 cutoff 0 290.00000 285.00029 1.72% - 0s Explored 0 nodes (46 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 290 1000 1500 Pool objective bound 290 Optimal solution found (tolerance 1.00e-04) Best objective 2.900000000000e+02, best bound 2.900000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked on Day1: 7 Priority1 patients arrived on day Day2 booked on Day2: 2 Priority2 patients arrived on day Day1 booked on Day5: 5 Priority2 patients arrived on day Day2 booked on Day2: 1 Priority3 patients arrived on day Day1 booked on Day7: 3 Priority3 patients arrived on day Day2 booked on Day2: 1 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 2 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 5 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 3 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Gurobi 7.0.1 (mac64, Python) logging started Thu Mar 2 20:30:05 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1471 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1900 Presolve removed 274 rows and 149 columns Presolve time: 0.02s Presolved: 51 rows, 37 columns, 144 nonzeros Found heuristic solution: objective 1000.0000000 Variable types: 0 continuous, 37 integer (14 binary) Root relaxation: objective 2.719474e+02, 31 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 271.94737 0 5 1000.00000 271.94737 72.8% - 0s H 0 0 290.0000000 271.94737 6.23% - 0s 0 0 cutoff 0 290.00000 285.00029 1.72% - 0s Explored 0 nodes (46 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 3: 290 1000 1500 Pool objective bound 290 Optimal solution found (tolerance 1.00e-04) Best objective 2.900000000000e+02, best bound 2.900000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked on Day1: 7 Priority1 patients arrived on day Day2 booked on Day2: 2 Priority2 patients arrived on day Day1 booked on Day5: 5 Priority2 patients arrived on day Day2 booked on Day2: 1 Priority3 patients arrived on day Day1 booked on Day7: 3 Priority3 patients arrived on day Day2 booked on Day2: 1 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 2 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 5 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 3 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1471 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1900 Presolve removed 274 rows and 149 columns Presolve time: 0.00s Presolved: 51 rows, 37 columns, 144 nonzeros Found heuristic solution: objective 1000.0000000 Variable types: 0 continuous, 37 integer (14 binary) Root relaxation: objective 2.719474e+02, 31 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 271.94737 0 5 1000.00000 271.94737 72.8% - 0s H 0 0 290.0000000 271.94737 6.23% - 0s 0 0 cutoff 0 290.00000 285.00029 1.72% - 0s Explored 0 nodes (46 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 290 1000 1500 Pool objective bound 290 Optimal solution found (tolerance 1.00e-04) Best objective 2.900000000000e+02, best bound 2.900000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked on Day1: 7 Priority1 patients arrived on day Day2 booked on Day2: 2 Priority2 patients arrived on day Day1 booked on Day5: 5 Priority2 patients arrived on day Day2 booked on Day2: 1 Priority3 patients arrived on day Day1 booked on Day7: 3 Priority3 patients arrived on day Day2 booked on Day2: 1 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 2 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 5 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 3 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1471 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1900 Presolve removed 283 rows and 154 columns Presolve time: 0.03s Presolved: 42 rows, 32 columns, 127 nonzeros Found heuristic solution: objective 1080.0000000 Variable types: 0 continuous, 32 integer (11 binary) Root relaxation: objective 4.766667e+02, 19 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 476.66667 0 5 1080.00000 476.66667 55.9% - 0s H 0 0 490.0000000 476.66667 2.72% - 0s 0 0 cutoff 0 490.00000 485.00049 1.02% - 0s Explored 0 nodes (28 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 3: 490 1080 1800 Pool objective bound 490 Optimal solution found (tolerance 1.00e-04) Best objective 4.900000000000e+02, best bound 4.900000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 2 Priority1 patients arrived on day Day1 booked on Day1: 5 Priority1 patients arrived on day Day2 booked on Day2: 2 Priority2 patients arrived on day Day1 booked on Day5: 5 Priority2 patients arrived on day Day2 booked on Day2: 1 Priority3 patients arrived on day Day1 booked on Day7: 3 Priority3 patients arrived on day Day2 booked on Day2: 1 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 2 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 2 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 5 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 3 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1471 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4700 Presolve removed 214 rows and 99 columns Presolve time: 0.02s Presolved: 111 rows, 87 columns, 801 nonzeros Variable types: 0 continuous, 87 integer (33 binary) Root relaxation: objective 2.585000e+03, 41 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 2585.0000000 2585.00000 0.00% - 0s Explored 0 nodes (45 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 2585 4700 Pool objective bound 2585 Optimal solution found (tolerance 1.00e-04) Best objective 2.585000000000e+03, best bound 2.585000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 7 Priority2 patients arrived on day Day1 booked overtime on day Day1 : 10 Priority2 patients arrived on day Day2 booked overtime on day Day2 : 5 Priority1 patients arrived on day Day1 booked on Day1: 1 Priority1 patients arrived on day Day2 booked on Day2: 7 Priority2 patients arrived on day Day2 booked on Day3: 1 Priority2 patients arrived on day Day2 booked on Day4: 2 Priority3 patients arrived on day Day1 booked on Day6: 6 Priority3 patients arrived on day Day1 booked on Day7: 4 Priority3 patients arrived on day Day2 booked on Day5: 3 Priority3 patients arrived on day Day2 booked on Day6: 1 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 8 Priority1 remaning patients arrived on day Day1 to be booked on Day2: 3 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 3 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived on day Day1 to be booked on Day2: 4 Priority2 remaning patients arrived on day Day1 to be booked on Day3: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 7 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 10 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 10 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 10 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 10 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 10 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 10 Priority2 remaning patients arrived on day Day2 to be booked on Day1: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day2: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day3: 3 Priority2 remaning patients arrived on day Day2 to be booked on Day4: 5 Priority2 remaning patients arrived on day Day2 to be booked on Day5: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 8 Priority3 remaning patients arrived on day Day1 to be booked on Day6: 6 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 10 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 10 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 10 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 10 Priority3 remaning patients arrived on day Day2 to be booked on Day5: 3 Priority3 remaning patients arrived on day Day2 to be booked on Day6: 4 Priority3 remaning patients arrived on day Day2 to be booked on Day7: 4 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 4 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 4 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 4 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day2: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1471 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2100 Presolve removed 270 rows and 144 columns Presolve time: 0.02s Presolved: 55 rows, 42 columns, 226 nonzeros Found heuristic solution: objective 955.0000000 Variable types: 0 continuous, 42 integer (14 binary) Root relaxation: objective 3.000000e+02, 29 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 300.00000 0 1 955.00000 300.00000 68.6% - 0s H 0 0 370.0000000 300.00000 18.9% - 0s 0 0 cutoff 0 370.00000 365.00037 1.35% - 0s Explored 0 nodes (63 simplex iterations) in 0.10 seconds Thread count was 4 (of 4 available processors) Solution count 3: 370 955 2000 Pool objective bound 370 Optimal solution found (tolerance 1.00e-04) Best objective 3.700000000000e+02, best bound 3.700000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day2 booked overtime on day Day2 : 1 Priority1 patients arrived on day Day1 booked on Day1: 1 Priority1 patients arrived on day Day2 booked on Day2: 7 Priority2 patients arrived on day Day1 booked on Day5: 2 Priority2 patients arrived on day Day2 booked on Day4: 2 Priority3 patients arrived on day Day1 booked on Day7: 1 Priority3 patients arrived on day Day2 booked on Day3: 2 Priority3 patients arrived on day Day2 booked on Day6: 3 Priority3 patients arrived on day Day2 booked on Day7: 2 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 1 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 8 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 3 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day4: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day5: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 2 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day3: 2 Priority3 remaning patients arrived on day Day2 to be booked on Day4: 2 Priority3 remaning patients arrived on day Day2 to be booked on Day5: 2 Priority3 remaning patients arrived on day Day2 to be booked on Day6: 5 Priority3 remaning patients arrived on day Day2 to be booked on Day7: 7 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 7 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 7 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 7 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1471 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3300 Presolve removed 230 rows and 109 columns Presolve time: 0.01s Presolved: 95 rows, 77 columns, 595 nonzeros Variable types: 0 continuous, 77 integer (33 binary) Root relaxation: objective 1.735000e+03, 42 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1735.0000000 1735.00000 0.00% - 0s Explored 0 nodes (46 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1735 3300 Pool objective bound 1735 Optimal solution found (tolerance 1.00e-04) Best objective 1.735000000000e+03, best bound 1.735000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day2 booked overtime on day Day2 : 3 Priority2 patients arrived on day Day1 booked overtime on day Day1 : 3 Priority2 patients arrived on day Day2 booked overtime on day Day2 : 6 Priority3 patients arrived on day Day1 booked overtime on day Day1 : 3 Priority1 patients arrived on day Day1 booked on Day1: 3 Priority1 patients arrived on day Day2 booked on Day2: 2 Priority2 patients arrived on day Day2 booked on Day3: 4 Priority3 patients arrived on day Day1 booked on Day4: 2 Priority3 patients arrived on day Day1 booked on Day5: 1 Priority3 patients arrived on day Day1 booked on Day6: 3 Priority3 patients arrived on day Day1 booked on Day7: 2 Priority3 patients arrived on day Day2 booked on Day4: 1 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 3 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 5 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 3 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 3 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 3 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 3 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 3 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 3 Priority2 remaning patients arrived on day Day2 to be booked on Day1: 5 Priority2 remaning patients arrived on day Day2 to be booked on Day2: 5 Priority2 remaning patients arrived on day Day2 to be booked on Day3: 9 Priority2 remaning patients arrived on day Day2 to be booked on Day4: 10 Priority2 remaning patients arrived on day Day2 to be booked on Day5: 10 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 10 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 10 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 10 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 10 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 10 Priority3 remaning patients arrived on day Day1 to be booked on Day3: 2 Priority3 remaning patients arrived on day Day1 to be booked on Day4: 5 Priority3 remaning patients arrived on day Day1 to be booked on Day5: 6 Priority3 remaning patients arrived on day Day1 to be booked on Day6: 9 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 11 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 11 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 11 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 11 Priority3 remaning patients arrived on day Day2 to be booked on Day4: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day5: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day6: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day7: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1581 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3700 Presolve removed 206 rows and 98 columns Presolve time: 0.03s Presolved: 119 rows, 88 columns, 733 nonzeros Variable types: 0 continuous, 88 integer (35 binary) Root relaxation: objective 1.615338e+03, 39 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1615.33784 0 15 3700.00000 1615.33784 56.3% - 0s H 0 0 2575.0000000 1615.33784 37.3% - 0s H 0 0 2175.0000000 1615.33784 25.7% - 0s 0 0 1950.34247 0 14 2175.00000 1950.34247 10.3% - 0s H 0 0 2130.0000000 1950.34247 8.43% - 0s 0 0 1950.34247 0 18 2130.00000 1950.34247 8.43% - 0s 0 0 2005.92377 0 27 2130.00000 2005.92377 5.83% - 0s 0 0 2014.88486 0 22 2130.00000 2014.88486 5.40% - 0s 0 0 2032.68642 0 31 2130.00000 2032.68642 4.57% - 0s H 0 0 2090.0000000 2032.68642 2.74% - 0s 0 0 2036.16960 0 21 2090.00000 2036.16960 2.58% - 0s 0 0 2039.01192 0 33 2090.00000 2039.01192 2.44% - 0s 0 0 2039.91696 0 27 2090.00000 2039.91696 2.40% - 0s 0 0 2048.14010 0 27 2090.00000 2048.14010 2.00% - 0s 0 0 2049.70911 0 35 2090.00000 2049.70911 1.93% - 0s 0 0 2055.41713 0 31 2090.00000 2055.41713 1.65% - 0s 0 0 2059.40000 0 20 2090.00000 2059.40000 1.46% - 0s 0 0 2063.31844 0 33 2090.00000 2063.31844 1.28% - 0s 0 0 2065.69898 0 34 2090.00000 2065.69898 1.16% - 0s 0 0 2073.31331 0 35 2090.00000 2073.31331 0.80% - 0s 0 0 2073.31331 0 15 2090.00000 2073.31331 0.80% - 0s 0 0 2084.21053 0 4 2090.00000 2084.21053 0.28% - 0s Cutting planes: Learned: 2 Implied bound: 4 MIR: 5 Flow cover: 3 Explored 0 nodes (242 simplex iterations) in 0.21 seconds Thread count was 4 (of 4 available processors) Solution count 5: 2090 2130 2175 ... 3700 Pool objective bound 2090 Optimal solution found (tolerance 1.00e-04) Best objective 2.090000000000e+03, best bound 2.090000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 7 Priority1 patients arrived on day Day2 booked overtime on day Day2 : 5 Priority2 patients arrived on day Day2 booked overtime on day Day2 : 1 Priority3 patients arrived on day Day2 booked overtime on day Day2 : 1 Priority1 patients arrived on day Day1 booked on Day1: 3 Priority1 patients arrived on day Day2 booked on Day2: 3 Priority2 patients arrived on day Day1 booked on Day4: 3 Priority2 patients arrived on day Day1 booked on Day5: 3 Priority2 patients arrived on day Day1 booked on Day6: 6 Priority2 patients arrived on day Day2 booked on Day3: 7 Priority2 patients arrived on day Day2 booked on Day4: 1 Priority3 patients arrived on day Day1 booked on Day7: 3 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 10 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 8 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 1 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 3 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 6 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 6 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 6 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 6 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 6 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 6 Priority2 remaning patients arrived on day Day2 to be booked on Day3: 7 Priority2 remaning patients arrived on day Day2 to be booked on Day4: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day5: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 9 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 9 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 9 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 9 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 9 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 3 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1581 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3600 Presolve removed 217 rows and 108 columns Presolve time: 0.00s Presolved: 108 rows, 78 columns, 479 nonzeros Variable types: 0 continuous, 78 integer (29 binary) Root relaxation: objective 7.700000e+02, 37 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 770.00000 0 2 3600.00000 770.00000 78.6% - 0s H 0 0 1280.0000000 770.00000 39.8% - 0s H 0 0 1130.0000000 770.00000 31.9% - 0s 0 0 818.57143 0 20 1130.00000 818.57143 27.6% - 0s H 0 0 1050.0000000 818.57143 22.0% - 0s 0 0 825.00000 0 14 1050.00000 825.00000 21.4% - 0s 0 0 936.49882 0 35 1050.00000 936.49882 10.8% - 0s 0 0 955.00000 0 11 1050.00000 955.00000 9.05% - 0s 0 0 966.66667 0 20 1050.00000 966.66667 7.94% - 0s 0 0 971.93878 0 20 1050.00000 971.93878 7.43% - 0s 0 0 971.93878 0 20 1050.00000 971.93878 7.43% - 0s 0 0 981.73913 0 20 1050.00000 981.73913 6.50% - 0s 0 0 987.08333 0 22 1050.00000 987.08333 5.99% - 0s 0 0 987.08333 0 22 1050.00000 987.08333 5.99% - 0s 0 0 991.25000 0 18 1050.00000 991.25000 5.60% - 0s 0 0 993.92857 0 20 1050.00000 993.92857 5.34% - 0s 0 0 995.37832 0 21 1050.00000 995.37832 5.20% - 0s 0 0 996.12335 0 21 1050.00000 996.12335 5.13% - 0s 0 0 999.38892 0 25 1050.00000 999.38892 4.82% - 0s 0 0 999.46932 0 25 1050.00000 999.46932 4.81% - 0s 0 0 999.49022 0 25 1050.00000 999.49022 4.81% - 0s 0 0 999.49022 0 25 1050.00000 999.49022 4.81% - 0s 0 0 999.49022 0 8 1050.00000 999.49022 4.81% - 0s 0 0 1036.66667 0 7 1050.00000 1036.66667 1.27% - 0s 0 0 cutoff 0 1050.00000 1050.00000 0.00% - 0s Cutting planes: MIR: 4 Flow cover: 1 Explored 0 nodes (204 simplex iterations) in 0.11 seconds Thread count was 4 (of 4 available processors) Solution count 4: 1050 1130 1280 3600 Pool objective bound 1050 Optimal solution found (tolerance 1.00e-04) Best objective 1.050000000000e+03, best bound 1.050000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 3 Priority1 patients arrived on day Day1 booked on Day1: 7 Priority1 patients arrived on day Day2 booked on Day2: 6 Priority2 patients arrived on day Day1 booked on Day4: 4 Priority2 patients arrived on day Day1 booked on Day5: 7 Priority2 patients arrived on day Day1 booked on Day6: 4 Priority2 patients arrived on day Day2 booked on Day2: 2 Priority2 patients arrived on day Day2 booked on Day3: 2 Priority2 patients arrived on day Day2 booked on Day4: 2 Priority3 patients arrived on day Day1 booked on Day7: 3 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 10 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 3 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 6 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 1 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 6 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 4 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 11 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 11 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 11 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 11 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 11 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 11 Priority2 remaning patients arrived on day Day2 to be booked on Day3: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day4: 4 Priority2 remaning patients arrived on day Day2 to be booked on Day5: 4 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 4 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 4 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 4 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 4 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 4 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 3 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1581 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4500 Presolve removed 197 rows and 91 columns Presolve time: 0.01s Presolved: 128 rows, 95 columns, 832 nonzeros Variable types: 0 continuous, 95 integer (34 binary) Root relaxation: objective 1.615000e+03, 45 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1615.00000 0 4 4500.00000 1615.00000 64.1% - 0s H 0 0 2095.0000000 1615.00000 22.9% - 0s H 0 0 2065.0000000 1615.00000 21.8% - 0s H 0 0 1935.0000000 1615.00000 16.5% - 0s 0 0 1622.77778 0 26 1935.00000 1622.77778 16.1% - 0s H 0 0 1865.0000000 1622.77778 13.0% - 0s 0 0 1645.00000 0 12 1865.00000 1645.00000 11.8% - 0s 0 0 1652.32846 0 25 1865.00000 1652.32846 11.4% - 0s 0 0 1672.16000 0 21 1865.00000 1672.16000 10.3% - 0s 0 0 1672.16000 0 4 1865.00000 1672.16000 10.3% - 0s 0 0 1672.16000 0 23 1865.00000 1672.16000 10.3% - 0s 0 0 1672.16000 0 22 1865.00000 1672.16000 10.3% - 0s 0 0 1697.98077 0 17 1865.00000 1697.98077 8.96% - 0s 0 0 1698.20755 0 17 1865.00000 1698.20755 8.94% - 0s 0 0 1701.96552 0 21 1865.00000 1701.96552 8.74% - 0s H 0 0 1775.0000000 1701.96552 4.11% - 0s 0 0 1721.86393 0 22 1775.00000 1721.86393 2.99% - 0s 0 0 1722.93615 0 22 1775.00000 1722.93615 2.93% - 0s 0 0 1752.27273 0 19 1775.00000 1752.27273 1.28% - 0s 0 0 1752.27273 0 19 1775.00000 1752.27273 1.28% - 0s 0 0 1752.50000 0 16 1775.00000 1752.50000 1.27% - 0s Cutting planes: Gomory: 2 Implied bound: 1 MIR: 9 StrongCG: 1 Flow cover: 1 Explored 0 nodes (251 simplex iterations) in 0.13 seconds Thread count was 4 (of 4 available processors) Solution count 6: 1775 1865 1935 ... 4500 Pool objective bound 1775 Optimal solution found (tolerance 1.00e-04) Best objective 1.775000000000e+03, best bound 1.775000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority2 patients arrived on day Day2 booked overtime on day Day2 : 1 Priority3 patients arrived on day Day2 booked overtime on day Day2 : 6 Priority1 patients arrived on day Day1 booked on Day1: 4 Priority1 patients arrived on day Day2 booked on Day2: 5 Priority2 patients arrived on day Day1 booked on Day4: 4 Priority2 patients arrived on day Day1 booked on Day5: 5 Priority2 patients arrived on day Day2 booked on Day2: 3 Priority2 patients arrived on day Day2 booked on Day3: 1 Priority2 patients arrived on day Day2 booked on Day4: 2 Priority3 patients arrived on day Day1 booked on Day6: 6 Priority3 patients arrived on day Day1 booked on Day7: 1 Priority3 patients arrived on day Day2 booked on Day3: 1 Priority3 patients arrived on day Day2 booked on Day6: 1 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 9 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 5 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 5 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 4 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived on day Day2 to be booked on Day3: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day4: 3 Priority2 remaning patients arrived on day Day2 to be booked on Day5: 3 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 4 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 4 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 4 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 4 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 4 Priority3 remaning patients arrived on day Day1 to be booked on Day6: 6 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 7 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 7 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 7 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 7 Priority3 remaning patients arrived on day Day2 to be booked on Day3: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day4: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day5: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day6: 2 Priority3 remaning patients arrived on day Day2 to be booked on Day7: 2 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 8 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 8 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 8 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1584 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4600 Presolve removed 200 rows and 93 columns Presolve time: 0.01s Presolved: 125 rows, 93 columns, 877 nonzeros Variable types: 0 continuous, 93 integer (28 binary) Root relaxation: objective 1.130000e+03, 32 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1130.00000 0 2 4600.00000 1130.00000 75.4% - 0s H 0 0 1490.0000000 1130.00000 24.2% - 0s H 0 0 1280.0000000 1130.00000 11.7% - 0s 0 0 1130.00000 0 2 1280.00000 1130.00000 11.7% - 0s 0 0 1160.00000 0 1 1280.00000 1160.00000 9.38% - 0s H 0 0 1185.0000000 1160.00000 2.11% - 0s Cutting planes: Gomory: 1 Implied bound: 1 MIR: 4 Flow cover: 2 Explored 0 nodes (74 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 4: 1185 1280 1490 4600 Pool objective bound 1185 Optimal solution found (tolerance 1.00e-04) Best objective 1.185000000000e+03, best bound 1.185000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 3 Priority1 patients arrived on day Day1 booked on Day1: 7 Priority1 patients arrived on day Day2 booked on Day2: 3 Priority2 patients arrived on day Day1 booked on Day3: 1 Priority2 patients arrived on day Day1 booked on Day4: 4 Priority2 patients arrived on day Day1 booked on Day5: 4 Priority2 patients arrived on day Day2 booked on Day2: 1 Priority2 patients arrived on day Day2 booked on Day3: 5 Priority2 patients arrived on day Day2 booked on Day6: 2 Priority3 patients arrived on day Day1 booked on Day7: 8 Priority3 patients arrived on day Day2 booked on Day3: 1 Priority3 patients arrived on day Day2 booked on Day8: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 10 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 3 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 3 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 3 Priority2 remaning patients arrived on day Day1 to be booked on Day3: 1 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived on day Day2 to be booked on Day3: 5 Priority2 remaning patients arrived on day Day2 to be booked on Day4: 5 Priority2 remaning patients arrived on day Day2 to be booked on Day5: 5 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 7 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 7 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 7 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 7 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 7 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 8 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 8 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 8 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 8 Priority3 remaning patients arrived on day Day2 to be booked on Day3: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day4: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day5: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day6: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day7: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 8 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 8 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 8 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1584 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2200 Presolve removed 281 rows and 152 columns Presolve time: 0.02s Presolved: 44 rows, 34 columns, 164 nonzeros Variable types: 0 continuous, 34 integer (16 binary) Root relaxation: objective 4.557143e+02, 19 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 455.71429 0 6 2200.00000 455.71429 79.3% - 0s H 0 0 540.0000000 455.71429 15.6% - 0s H 0 0 535.0000000 455.71429 14.8% - 0s 0 0 cutoff 0 535.00000 530.00054 0.93% - 0s Cutting planes: Implied bound: 2 GUB cover: 1 Zero half: 1 Explored 0 nodes (32 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 3: 535 540 2200 Pool objective bound 535 Optimal solution found (tolerance 1.00e-04) Best objective 5.350000000000e+02, best bound 5.350000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked on Day1: 2 Priority1 patients arrived on day Day2 booked on Day2: 1 Priority1 patients arrived on day Day2 booked on Day3: 3 Priority1 patients arrived on day Day2 booked on Day4: 4 Priority2 patients arrived on day Day2 booked on Day5: 2 Priority2 patients arrived on day Day2 booked on Day6: 1 Priority3 patients arrived on day Day1 booked on Day1: 5 Priority3 patients arrived on day Day1 booked on Day6: 1 Priority3 patients arrived on day Day1 booked on Day7: 1 Priority3 patients arrived on day Day1 booked on Day10: 1 Priority3 patients arrived on day Day2 booked on Day8: 2 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 2 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 8 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 8 Priority1 remaning patients arrived on day Day2 to be booked on Day3: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day4: 4 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day5: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 3 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 3 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 3 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 3 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day6: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 2 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 2 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 2 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 2 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 2 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 2 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 2 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1584 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4600 Presolve removed 218 rows and 105 columns Presolve time: 0.01s Presolved: 107 rows, 81 columns, 649 nonzeros Variable types: 0 continuous, 81 integer (28 binary) Root relaxation: objective 2.090000e+03, 35 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 2090.0000000 2090.00000 0.00% - 0s Explored 0 nodes (36 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 2090 4600 Pool objective bound 2090 Optimal solution found (tolerance 1.00e-04) Best objective 2.090000000000e+03, best bound 2.090000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 7 Priority1 patients arrived on day Day2 booked overtime on day Day2 : 5 Priority2 patients arrived on day Day1 booked overtime on day Day1 : 2 Priority1 patients arrived on day Day1 booked on Day1: 4 Priority1 patients arrived on day Day2 booked on Day2: 3 Priority2 patients arrived on day Day1 booked on Day5: 3 Priority2 patients arrived on day Day2 booked on Day3: 1 Priority2 patients arrived on day Day2 booked on Day4: 6 Priority2 patients arrived on day Day2 booked on Day5: 4 Priority3 patients arrived on day Day1 booked on Day6: 2 Priority3 patients arrived on day Day1 booked on Day7: 7 Priority3 patients arrived on day Day2 booked on Day8: 2 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 11 Priority1 remaning patients arrived on day Day1 to be booked on Day2: 2 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 8 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 3 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 5 Priority2 remaning patients arrived on day Day2 to be booked on Day3: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day4: 7 Priority2 remaning patients arrived on day Day2 to be booked on Day5: 11 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 11 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 11 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 11 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 11 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 11 Priority3 remaning patients arrived on day Day1 to be booked on Day6: 2 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 9 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 9 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 9 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 9 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 2 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 2 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 2 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1584 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3300 Presolve removed 234 rows and 115 columns Presolve time: 0.01s Presolved: 91 rows, 71 columns, 483 nonzeros Variable types: 0 continuous, 71 integer (21 binary) Root relaxation: objective 9.500000e+02, 46 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 950.00000 0 4 3300.00000 950.00000 71.2% - 0s H 0 0 1260.0000000 950.00000 24.6% - 0s H 0 0 1175.0000000 950.00000 19.1% - 0s 0 0 1003.92143 0 34 1175.00000 1003.92143 14.6% - 0s 0 0 1011.35000 0 34 1175.00000 1011.35000 13.9% - 0s 0 0 1084.49198 0 12 1175.00000 1084.49198 7.70% - 0s 0 0 1099.00000 0 16 1175.00000 1099.00000 6.47% - 0s H 0 0 1105.0000000 1099.00000 0.54% - 0s Cutting planes: Gomory: 3 Implied bound: 1 MIR: 6 StrongCG: 1 Flow cover: 1 Explored 0 nodes (158 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 4: 1105 1175 1260 3300 Pool objective bound 1105 Optimal solution found (tolerance 1.00e-04) Best objective 1.105000000000e+03, best bound 1.105000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 3 Priority1 patients arrived on day Day1 booked on Day1: 2 Priority1 patients arrived on day Day1 booked on Day2: 1 Priority1 patients arrived on day Day2 booked on Day2: 2 Priority2 patients arrived on day Day1 booked on Day4: 6 Priority2 patients arrived on day Day1 booked on Day5: 5 Priority2 patients arrived on day Day2 booked on Day6: 2 Priority3 patients arrived on day Day1 booked on Day7: 3 Priority3 patients arrived on day Day2 booked on Day4: 1 Priority3 patients arrived on day Day2 booked on Day6: 2 Priority3 patients arrived on day Day2 booked on Day8: 6 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 6 Priority1 remaning patients arrived on day Day1 to be booked on Day2: 1 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 4 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 2 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 6 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 11 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 11 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 11 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 11 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 11 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 11 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 2 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 3 Priority3 remaning patients arrived on day Day2 to be booked on Day4: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day5: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day6: 3 Priority3 remaning patients arrived on day Day2 to be booked on Day7: 3 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 9 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 9 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 9 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1584 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3800 Presolve removed 199 rows and 94 columns Presolve time: 0.01s Presolved: 126 rows, 92 columns, 605 nonzeros Variable types: 0 continuous, 92 integer (41 binary) Root relaxation: objective 7.800000e+02, 62 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 780.00000 0 1 3800.00000 780.00000 79.5% - 0s H 0 0 870.0000000 780.00000 10.3% - 0s 0 0 810.00000 0 1 870.00000 810.00000 6.90% - 0s 0 0 865.00000 0 1 870.00000 865.00000 0.57% - 0s Cutting planes: Gomory: 1 Implied bound: 1 MIR: 1 Flow cover: 1 Explored 0 nodes (101 simplex iterations) in 0.10 seconds Thread count was 4 (of 4 available processors) Solution count 2: 870 3800 Pool objective bound 870 Optimal solution found (tolerance 1.00e-04) Best objective 8.700000000000e+02, best bound 8.700000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 1 Priority1 patients arrived on day Day1 booked on Day1: 6 Priority1 patients arrived on day Day2 booked on Day2: 6 Priority1 patients arrived on day Day2 booked on Day3: 4 Priority2 patients arrived on day Day1 booked on Day5: 4 Priority2 patients arrived on day Day2 booked on Day3: 2 Priority2 patients arrived on day Day2 booked on Day4: 6 Priority2 patients arrived on day Day2 booked on Day5: 2 Priority2 patients arrived on day Day2 booked on Day6: 1 Priority3 patients arrived on day Day1 booked on Day7: 5 Priority3 patients arrived on day Day1 booked on Day10: 2 Priority3 patients arrived on day Day2 booked on Day8: 1 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 1 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 10 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 10 Priority1 remaning patients arrived on day Day2 to be booked on Day3: 4 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 10 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 4 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 4 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 4 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 4 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 4 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 4 Priority2 remaning patients arrived on day Day2 to be booked on Day3: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day4: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day5: 10 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 11 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 11 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 11 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 11 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 11 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 5 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 5 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 5 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 5 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1557 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4000 Presolve removed 293 rows and 161 columns Presolve time: 0.01s Presolved: 32 rows, 25 columns, 101 nonzeros Variable types: 0 continuous, 25 integer (9 binary) Root relaxation: objective 1.483500e+03, 23 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1483.50000 0 5 4000.00000 1483.50000 62.9% - 0s H 0 0 2025.0000000 1483.50000 26.7% - 0s 0 0 cutoff 0 2025.00000 2020.00203 0.25% - 0s Cutting planes: Gomory: 1 MIR: 2 StrongCG: 1 Flow cover: 3 Explored 0 nodes (28 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 2: 2025 4000 Pool objective bound 2025 Optimal solution found (tolerance 1.00e-04) Best objective 2.025000000000e+03, best bound 2.025000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on day Day2 booked overtime on day Day2 : 1 Priority2 patients arrived on day Day2 booked overtime on day Day2 : 3 Priority3 patients arrived on day Day2 booked overtime on day Day2 : 5 Priority1 patients arrived on day Day1 booked on Day1: 1 Priority1 patients arrived on day Day1 booked on Day2: 4 Priority1 patients arrived on day Day2 booked on Day2: 3 Priority1 patients arrived on day Day2 booked on Day3: 6 Priority2 patients arrived on day Day1 booked on Day5: 6 Priority2 patients arrived on day Day2 booked on Day4: 4 Priority2 patients arrived on day Day2 booked on Day5: 1 Priority3 patients arrived on day Day2 booked on Day7: 1 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 10 Priority1 remaning patients arrived on day Day1 to be booked on Day2: 8 Priority1 remaning patients arrived on day Day1 to be booked on Day3: 1 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 9 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 10 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 9 Priority1 remaning patients arrived on day Day2 to be booked on Day3: 6 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 10 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 6 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 6 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 6 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 6 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 6 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 6 Priority2 remaning patients arrived on day Day2 to be booked on Day4: 4 Priority2 remaning patients arrived on day Day2 to be booked on Day5: 5 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 8 Priority3 remaning patients arrived on day Day2 to be booked on Day7: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1557 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2600 Presolve removed 266 rows and 144 columns Presolve time: 0.01s Presolved: 59 rows, 42 columns, 160 nonzeros Variable types: 0 continuous, 42 integer (22 binary) Root relaxation: objective 8.572727e+02, 36 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 857.27273 0 2 2600.00000 857.27273 67.0% - 0s H 0 0 930.0000000 857.27273 7.82% - 0s H 0 0 860.0000000 857.27273 0.32% - 0s Explored 0 nodes (50 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 3: 860 930 2600 Pool objective bound 860 Optimal solution found (tolerance 1.00e-04) Best objective 8.600000000000e+02, best bound 8.600000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day2 booked overtime on day Day2 : 1 Priority2 patients arrived on day Day2 booked overtime on day Day2 : 1 Priority3 patients arrived on day Day2 booked overtime on day Day2 : 3 Priority1 patients arrived on day Day1 booked on Day1: 7 Priority1 patients arrived on day Day2 booked on Day2: 4 Priority2 patients arrived on day Day1 booked on Day4: 1 Priority2 patients arrived on day Day1 booked on Day5: 7 Priority2 patients arrived on day Day2 booked on Day4: 1 Priority3 patients arrived on day Day1 booked on Day7: 1 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 5 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 4 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 1 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day4: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day5: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 2 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 3 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 3 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 3 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1557 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3800 Presolve removed 284 rows and 156 columns Presolve time: 0.01s Presolved: 41 rows, 30 columns, 114 nonzeros Found heuristic solution: objective 2705.0000000 Variable types: 0 continuous, 30 integer (12 binary) Root relaxation: objective 1.665000e+03, 29 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1665.0000000 1665.00000 0.00% - 0s Explored 0 nodes (35 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1665 2705 3700 Pool objective bound 1665 Optimal solution found (tolerance 1.00e-04) Best objective 1.665000000000e+03, best bound 1.665000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 1 Priority1 patients arrived on day Day2 booked overtime on day Day2 : 2 Priority2 patients arrived on day Day2 booked overtime on day Day2 : 4 Priority3 patients arrived on day Day2 booked overtime on day Day2 : 5 Priority1 patients arrived on day Day1 booked on Day1: 8 Priority1 patients arrived on day Day2 booked on Day2: 1 Priority2 patients arrived on day Day1 booked on Day3: 1 Priority2 patients arrived on day Day1 booked on Day4: 3 Priority2 patients arrived on day Day1 booked on Day5: 4 Priority2 patients arrived on day Day2 booked on Day3: 3 Priority3 patients arrived on day Day1 booked on Day7: 3 Priority3 patients arrived on day Day2 booked on Day7: 3 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 9 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 1 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 3 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 3 Priority2 remaning patients arrived on day Day1 to be booked on Day3: 1 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 4 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day3: 3 Priority2 remaning patients arrived on day Day2 to be booked on Day4: 3 Priority2 remaning patients arrived on day Day2 to be booked on Day5: 3 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 7 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 7 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 7 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 7 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 7 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 3 Priority3 remaning patients arrived on day Day2 to be booked on Day7: 3 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 8 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 8 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 8 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1560 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 292 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on day Day1 booked on Day1: 1 Priority1 patients arrived on day Day1 booked on Day2: 1 Priority1 patients arrived on day Day2 booked on Day2: 7 Priority2 patients arrived on day Day1 booked on Day3: 2 Priority2 patients arrived on day Day1 booked on Day4: 3 Priority2 patients arrived on day Day1 booked on Day5: 4 Priority2 patients arrived on day Day2 booked on Day6: 1 Priority3 patients arrived on day Day1 booked on Day7: 1 Priority3 patients arrived on day Day2 booked on Day8: 6 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived on day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1560 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4100 Presolve removed 218 rows and 108 columns Presolve time: 0.01s Presolved: 107 rows, 78 columns, 552 nonzeros Variable types: 0 continuous, 78 integer (28 binary) Root relaxation: objective 1.595000e+03, 53 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1595.00000 0 1 4100.00000 1595.00000 61.1% - 0s H 0 0 1695.0000000 1595.00000 5.90% - 0s H 0 0 1645.0000000 1595.00000 3.04% - 0s 0 0 1595.67188 0 20 1645.00000 1595.67188 3.00% - 0s H 0 0 1635.0000000 1595.67188 2.41% - 0s H 0 0 1630.0000000 1595.67188 2.11% - 0s H 0 0 1615.0000000 1595.67188 1.20% - 0s 0 0 1600.00000 0 1 1615.00000 1600.00000 0.93% - 0s H 0 0 1605.0000000 1600.00000 0.31% - 0s 0 0 cutoff 0 1605.00000 1605.00000 0.00% - 0s Explored 0 nodes (119 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 8: 1605 1615 1615 ... 4100 Pool objective bound 1605 Optimal solution found (tolerance 1.00e-04) Best objective 1.605000000000e+03, best bound 1.605000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day2 booked overtime on day Day2 : 2 Priority2 patients arrived on day Day1 booked overtime on day Day1 : 8 Priority2 patients arrived on day Day2 booked overtime on day Day2 : 2 Priority1 patients arrived on day Day1 booked on Day1: 2 Priority1 patients arrived on day Day2 booked on Day2: 7 Priority2 patients arrived on day Day1 booked on Day1: 1 Priority2 patients arrived on day Day2 booked on Day4: 3 Priority3 patients arrived on day Day1 booked on Day5: 1 Priority3 patients arrived on day Day1 booked on Day6: 5 Priority3 patients arrived on day Day1 booked on Day7: 3 Priority3 patients arrived on day Day2 booked on Day3: 2 Priority3 patients arrived on day Day2 booked on Day4: 1 Priority3 patients arrived on day Day2 booked on Day5: 2 Priority3 patients arrived on day Day2 booked on Day8: 2 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 2 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 9 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 4 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day3: 1 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 8 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day4: 3 Priority2 remaning patients arrived on day Day2 to be booked on Day5: 5 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 5 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 5 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 5 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 5 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 5 Priority3 remaning patients arrived on day Day1 to be booked on Day5: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day6: 6 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 9 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 9 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 9 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 9 Priority3 remaning patients arrived on day Day2 to be booked on Day3: 2 Priority3 remaning patients arrived on day Day2 to be booked on Day4: 3 Priority3 remaning patients arrived on day Day2 to be booked on Day5: 5 Priority3 remaning patients arrived on day Day2 to be booked on Day6: 5 Priority3 remaning patients arrived on day Day2 to be booked on Day7: 5 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 7 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 7 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 7 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1560 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1700 Presolve removed 314 rows and 176 columns Presolve time: 0.00s Presolved: 11 rows, 10 columns, 30 nonzeros Variable types: 0 continuous, 10 integer (5 binary) Root relaxation: objective 4.400000e+02, 6 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 440.0000000 440.00000 0.00% - 0s Explored 0 nodes (6 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 440 1700 Pool objective bound 440 Optimal solution found (tolerance 1.00e-04) Best objective 4.400000000000e+02, best bound 4.400000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day2 booked on Day2: 2 Priority2 patients arrived on day Day1 booked on Day1: 2 Priority2 patients arrived on day Day1 booked on Day5: 7 Priority2 patients arrived on day Day2 booked on Day3: 1 Priority2 patients arrived on day Day2 booked on Day4: 1 Priority2 patients arrived on day Day2 booked on Day5: 1 Priority2 patients arrived on day Day2 booked on Day6: 1 Priority3 patients arrived on day Day1 booked on Day7: 2 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 2 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 7 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 7 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 7 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 7 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 7 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 7 Priority2 remaning patients arrived on day Day2 to be booked on Day3: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day4: 2 Priority2 remaning patients arrived on day Day2 to be booked on Day5: 3 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 4 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 4 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 4 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 4 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 4 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 2 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 2 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 2 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 2 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1560 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2300 Presolve removed 312 rows and 175 columns Presolve time: 0.01s Presolved: 13 rows, 11 columns, 33 nonzeros Found heuristic solution: objective 885.0000000 Variable types: 0 continuous, 11 integer (5 binary) Root relaxation: objective 1.800000e+02, 7 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 180.0000000 180.00000 0.00% - 0s Explored 0 nodes (12 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 3: 180 885 1600 Pool objective bound 180 Optimal solution found (tolerance 1.00e-04) Best objective 1.800000000000e+02, best bound 1.800000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked on Day1: 6 Priority1 patients arrived on day Day2 booked on Day2: 3 Priority2 patients arrived on day Day2 booked on Day2: 3 Priority3 patients arrived on day Day1 booked on Day1: 2 Priority3 patients arrived on day Day1 booked on Day4: 1 Priority3 patients arrived on day Day1 booked on Day5: 4 Priority3 patients arrived on day Day1 booked on Day6: 1 Priority3 patients arrived on day Day1 booked on Day7: 2 Priority3 patients arrived on day Day2 booked on Day2: 1 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 6 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 3 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day4: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day5: 5 Priority3 remaning patients arrived on day Day1 to be booked on Day6: 6 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 8 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 8 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 8 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 8 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1560 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3300 Presolve removed 262 rows and 142 columns Presolve time: 0.00s Presolved: 63 rows, 44 columns, 194 nonzeros Variable types: 0 continuous, 44 integer (16 binary) Root relaxation: objective 3.750000e+02, 36 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 375.00000 0 1 3300.00000 375.00000 88.6% - 0s H 0 0 475.0000000 375.00000 21.1% - 0s Cutting planes: Flow cover: 1 Explored 0 nodes (53 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 475 3300 Pool objective bound 475 Optimal solution found (tolerance 1.00e-04) Best objective 4.750000000000e+02, best bound 4.750000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked on Day1: 5 Priority1 patients arrived on day Day2 booked on Day2: 7 Priority2 patients arrived on day Day1 booked on Day1: 2 Priority2 patients arrived on day Day2 booked on Day3: 3 Priority2 patients arrived on day Day2 booked on Day4: 2 Priority2 patients arrived on day Day2 booked on Day5: 1 Priority2 patients arrived on day Day2 booked on Day6: 2 Priority3 patients arrived on day Day1 booked on Day7: 2 Priority3 patients arrived on day Day2 booked on Day3: 1 Priority3 patients arrived on day Day2 booked on Day7: 2 Priority3 patients arrived on day Day2 booked on Day8: 6 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 5 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 2 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived on day Day2 to be booked on Day3: 3 Priority2 remaning patients arrived on day Day2 to be booked on Day4: 5 Priority2 remaning patients arrived on day Day2 to be booked on Day5: 6 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 8 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 8 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 2 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 2 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 2 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 2 Priority3 remaning patients arrived on day Day2 to be booked on Day3: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day4: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day5: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day6: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day7: 3 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 9 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 9 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 9 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1560 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3000 Presolve removed 283 rows and 154 columns Presolve time: 0.00s Presolved: 42 rows, 32 columns, 132 nonzeros Variable types: 0 continuous, 32 integer (22 binary) Root relaxation: objective 8.400000e+02, 21 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 840.00000 0 1 3000.00000 840.00000 72.0% - 0s H 0 0 865.0000000 840.00000 2.89% - 0s Explored 0 nodes (51 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3000 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 2 Priority1 patients arrived on day Day2 booked overtime on day Day2 : 2 Priority1 patients arrived on day Day1 booked on Day1: 1 Priority1 patients arrived on day Day2 booked on Day2: 7 Priority2 patients arrived on day Day1 booked on Day3: 3 Priority2 patients arrived on day Day1 booked on Day4: 1 Priority2 patients arrived on day Day1 booked on Day5: 1 Priority3 patients arrived on day Day1 booked on Day3: 1 Priority3 patients arrived on day Day1 booked on Day6: 2 Priority3 patients arrived on day Day1 booked on Day7: 8 Priority3 patients arrived on day Day2 booked on Day3: 1 Priority3 patients arrived on day Day2 booked on Day8: 1 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 3 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 2 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 9 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 4 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day3: 3 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 4 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 5 Priority3 remaning patients arrived on day Day1 to be booked on Day3: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day4: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day5: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day6: 3 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 11 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 11 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 11 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 11 Priority3 remaning patients arrived on day Day2 to be booked on Day3: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day4: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day5: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day6: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day7: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 2 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 2 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 2 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day3: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day4: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day5: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1560 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 292 rows and 161 columns Presolve time: 0.03s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on day Day1 booked on Day1: 1 Priority1 patients arrived on day Day1 booked on Day2: 1 Priority1 patients arrived on day Day2 booked on Day2: 7 Priority2 patients arrived on day Day1 booked on Day3: 2 Priority2 patients arrived on day Day1 booked on Day4: 3 Priority2 patients arrived on day Day1 booked on Day5: 4 Priority2 patients arrived on day Day2 booked on Day6: 1 Priority3 patients arrived on day Day1 booked on Day7: 1 Priority3 patients arrived on day Day2 booked on Day8: 6 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived on day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1350 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 296 rows and 164 columns Presolve time: 0.03s Presolved: 29 rows, 22 columns, 90 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 22 integer (10 binary) Root relaxation: objective 1.065000e+03, 19 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1065.0000000 1065.00000 0.00% - 0s Explored 0 nodes (19 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2320 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on day Day1 booked on Day1: 1 Priority1 patients arrived on day Day1 booked on Day2: 1 Priority1 patients arrived on day Day2 booked on Day2: 7 Priority2 patients arrived on day Day1 booked on Day3: 2 Priority2 patients arrived on day Day1 booked on Day4: 3 Priority2 patients arrived on day Day1 booked on Day5: 4 Priority2 patients arrived on day Day2 booked on Day6: 1 Priority3 patients arrived on day Day1 booked on Day7: 1 Priority3 patients arrived on day Day2 booked on Day8: 6 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 6 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 3 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 6 Priority2 remaning patients arrived on day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1350 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 296 rows and 164 columns Presolve time: 0.03s Presolved: 29 rows, 22 columns, 90 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 22 integer (10 binary) Root relaxation: objective 1.065000e+03, 19 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1065.0000000 1065.00000 0.00% - 0s Explored 0 nodes (19 simplex iterations) in 0.10 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2320 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on day Day1 booked on Day1: 1 Priority1 patients arrived on day Day1 booked on Day2: 1 Priority1 patients arrived on day Day2 booked on Day2: 7 Priority2 patients arrived on day Day1 booked on Day3: 2 Priority2 patients arrived on day Day1 booked on Day4: 3 Priority2 patients arrived on day Day1 booked on Day5: 4 Priority2 patients arrived on day Day2 booked on Day6: 1 Priority3 patients arrived on day Day1 booked on Day7: 1 Priority3 patients arrived on day Day2 booked on Day8: 6 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 6 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 3 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 6 Priority2 remaning patients arrived on day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1290 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 296 rows and 164 columns Presolve time: 0.00s Presolved: 29 rows, 22 columns, 90 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 22 integer (10 binary) Root relaxation: objective 1.065000e+03, 19 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1065.0000000 1065.00000 0.00% - 0s Explored 0 nodes (19 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2320 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on day Day1 booked on Day1: 1 Priority1 patients arrived on day Day1 booked on Day2: 1 Priority1 patients arrived on day Day2 booked on Day2: 7 Priority2 patients arrived on day Day1 booked on Day3: 2 Priority2 patients arrived on day Day1 booked on Day4: 3 Priority2 patients arrived on day Day1 booked on Day5: 4 Priority2 patients arrived on day Day2 booked on Day6: 1 Priority3 patients arrived on day Day1 booked on Day7: 1 Priority3 patients arrived on day Day2 booked on Day8: 6 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 4 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 6 Priority2 remaning patients arrived on day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1290 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 296 rows and 164 columns Presolve time: 0.00s Presolved: 29 rows, 22 columns, 90 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 22 integer (10 binary) Root relaxation: objective 1.065000e+03, 19 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1065.0000000 1065.00000 0.00% - 0s Explored 0 nodes (19 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2320 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on day Day1 booked on Day1: 1 Priority1 patients arrived on day Day1 booked on Day2: 1 Priority1 patients arrived on day Day2 booked on Day2: 7 Priority2 patients arrived on day Day1 booked on Day3: 2 Priority2 patients arrived on day Day1 booked on Day4: 3 Priority2 patients arrived on day Day1 booked on Day5: 4 Priority2 patients arrived on day Day2 booked on Day6: 1 Priority3 patients arrived on day Day1 booked on Day7: 1 Priority3 patients arrived on day Day2 booked on Day8: 6 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day2: 6 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 6 Priority2 remaning patients arrived on day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 285 rows, 186 columns and 1210 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 214 rows and 134 columns Presolve time: 0.01s Presolved: 71 rows, 52 columns, 314 nonzeros Variable types: 0 continuous, 52 integer (23 binary) Root relaxation: objective 8.300000e+02, 35 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 830.00000 0 2 3100.00000 830.00000 73.2% - 0s H 0 0 865.0000000 830.00000 4.05% - 0s 0 0 cutoff 0 865.00000 860.00087 0.58% - 0s Cutting planes: Implied bound: 1 MIR: 1 StrongCG: 1 Explored 0 nodes (41 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 1 Priority1 patients arrived on day Day1 booked on Day1: 1 Priority1 patients arrived on day Day1 booked on Day2: 5 Priority1 patients arrived on day Day2 booked on Day2: 3 Priority1 patients arrived on day Day2 booked on Day3: 4 Priority2 patients arrived on day Day1 booked on Day3: 2 Priority2 patients arrived on day Day1 booked on Day4: 3 Priority2 patients arrived on day Day1 booked on Day5: 4 Priority2 patients arrived on day Day2 booked on Day6: 1 Priority3 patients arrived on day Day1 booked on Day7: 1 Priority3 patients arrived on day Day2 booked on Day8: 6 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day2: 6 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 6 Priority1 remaning patients arrived on day Day2 to be booked on Day3: 4 Priority2 remaning patients arrived on day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 6 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 305 rows, 186 columns and 1250 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 234 rows and 134 columns Presolve time: 0.00s Presolved: 71 rows, 52 columns, 314 nonzeros Variable types: 0 continuous, 52 integer (23 binary) Root relaxation: objective 8.300000e+02, 35 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 830.00000 0 2 3100.00000 830.00000 73.2% - 0s H 0 0 865.0000000 830.00000 4.05% - 0s 0 0 cutoff 0 865.00000 860.00087 0.58% - 0s Cutting planes: Implied bound: 1 MIR: 1 StrongCG: 1 Explored 0 nodes (41 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 1 Priority1 patients arrived on day Day1 booked on Day1: 1 Priority1 patients arrived on day Day1 booked on Day2: 5 Priority1 patients arrived on day Day2 booked on Day2: 3 Priority1 patients arrived on day Day2 booked on Day3: 4 Priority2 patients arrived on day Day1 booked on Day3: 2 Priority2 patients arrived on day Day1 booked on Day4: 3 Priority2 patients arrived on day Day1 booked on Day5: 4 Priority2 patients arrived on day Day2 booked on Day6: 1 Priority3 patients arrived on day Day1 booked on Day7: 1 Priority3 patients arrived on day Day2 booked on Day8: 6 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day2: 106 Priority1 remaning patients arrived on day Day1 to be booked on Day3: 98 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 6 Priority1 remaning patients arrived on day Day2 to be booked on Day3: 98 Priority1 remaning patients arrived on day Day2 to be booked on Day4: 92 Priority2 remaning patients arrived on day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 6 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1290 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 296 rows and 164 columns Presolve time: 0.00s Presolved: 29 rows, 22 columns, 90 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 22 integer (10 binary) Root relaxation: objective 1.065000e+03, 19 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1065.0000000 1065.00000 0.00% - 0s Explored 0 nodes (19 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2320 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on day Day1 booked on Day1: 1 Priority1 patients arrived on day Day1 booked on Day2: 1 Priority1 patients arrived on day Day2 booked on Day2: 7 Priority2 patients arrived on day Day1 booked on Day3: 2 Priority2 patients arrived on day Day1 booked on Day4: 3 Priority2 patients arrived on day Day1 booked on Day5: 4 Priority2 patients arrived on day Day2 booked on Day6: 1 Priority3 patients arrived on day Day1 booked on Day7: 1 Priority3 patients arrived on day Day2 booked on Day8: 6 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day2: 6 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 6 Priority2 remaning patients arrived on day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 163 rows, 93 columns and 449 nonzeros Variable types: 0 continuous, 93 integer (30 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3200 Presolve removed 122 rows and 61 columns Presolve time: 0.02s Presolved: 41 rows, 32 columns, 159 nonzeros Variable types: 0 continuous, 32 integer (10 binary) Root relaxation: objective 1.335000e+03, 21 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1335.0000000 1335.00000 0.00% - 0s Explored 0 nodes (23 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1335 3200 Pool objective bound 1335 Optimal solution found (tolerance 1.00e-04) Best objective 1.335000000000e+03, best bound 1.335000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 163 rows, 93 columns and 449 nonzeros Variable types: 0 continuous, 93 integer (30 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 200 Presolve removed 163 rows and 93 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 30 Pool objective bound 30 Optimal solution found (tolerance 1.00e-04) Best objective 3.000000000000e+01, best bound 3.000000000000e+01, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 163 rows, 93 columns and 449 nonzeros Variable types: 0 continuous, 93 integer (30 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3500 Presolve removed 130 rows and 62 columns Presolve time: 0.00s Presolved: 33 rows, 31 columns, 168 nonzeros Variable types: 0 continuous, 31 integer (9 binary) Root relaxation: objective 1.855000e+03, 10 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1855.0000000 1855.00000 0.00% - 0s Explored 0 nodes (10 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1855 3500 Pool objective bound 1855 Optimal solution found (tolerance 1.00e-04) Best objective 1.855000000000e+03, best bound 1.855000000000e+03, gap 0.0000% Gurobi 7.0.1 (mac64, Python) logging started Mon Mar 6 10:03:30 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 163 rows, 93 columns and 449 nonzeros Variable types: 0 continuous, 93 integer (30 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 1900 Presolve removed 122 rows and 64 columns Presolve time: 0.01s Presolved: 41 rows, 29 columns, 107 nonzeros Variable types: 0 continuous, 29 integer (11 binary) Root relaxation: objective 6.590909e+02, 26 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 659.09091 0 4 1900.00000 659.09091 65.3% - 0s H 0 0 800.0000000 659.09091 17.6% - 0s H 0 0 670.0000000 659.09091 1.63% - 0s Explored 0 nodes (50 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 3: 670 800 1900 Pool objective bound 670 Optimal solution found (tolerance 1.00e-04) Best objective 6.700000000000e+02, best bound 6.700000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1416 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 292 rows and 161 columns Presolve time: 0.01s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on day Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on day Day1 booked on Day1: 1 Priority1 patients arrived on day Day1 booked on Day2: 1 Priority1 patients arrived on day Day2 booked on Day2: 7 Priority2 patients arrived on day Day1 booked on Day3: 2 Priority2 patients arrived on day Day1 booked on Day4: 3 Priority2 patients arrived on day Day1 booked on Day5: 4 Priority2 patients arrived on day Day2 booked on Day6: 1 Priority3 patients arrived on day Day1 booked on Day7: 1 Priority3 patients arrived on day Day2 booked on Day8: 6 Priority1 remaning patients arrived on day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived on day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived on day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived on day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived on day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived on day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived on day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived on day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived on day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived on day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived on day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived on day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived on day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived on day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on day Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on day Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1416 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 292 rows and 161 columns Presolve time: 0.03s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 325 rows, 186 columns and 1389 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 284 rows and 155 columns Presolve time: 0.00s Presolved: 41 rows, 31 columns, 129 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 31 integer (17 binary) Root relaxation: objective 7.765476e+02, 28 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 776.54762 0 6 1520.00000 776.54762 48.9% - 0s H 0 0 790.0000000 776.54762 1.70% - 0s H 0 0 780.0000000 776.54762 0.44% - 0s Explored 0 nodes (54 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 4: 780 790 1520 2570 Pool objective bound 780 Optimal solution found (tolerance 1.00e-04) Best objective 7.800000000000e+02, best bound 7.800000000000e+02, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 2 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 4 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day2: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day2 booked on Day7: 2 Priority3 patients arrived on Day2 booked on Day8: 3 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day3: 1 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 4 Priority2 remaning patients arrived day Day2 to be booked on Day7: 4 Priority2 remaning patients arrived day Day2 to be booked on Day8: 4 Priority2 remaning patients arrived day Day2 to be booked on Day9: 4 Priority2 remaning patients arrived day Day2 to be booked on Day10: 4 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day6: 1 Priority3 remaning patients arrived day Day2 to be booked on Day7: 2 Priority3 remaning patients arrived day Day2 to be booked on Day8: 10 Priority3 remaning patients arrived day Day2 to be booked on Day9: 10 Priority3 remaning patients arrived day Day2 to be booked on Day10: 10 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day3: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.03s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.02s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Gurobi 7.0.1 (mac64, Python) logging started Wed Mar 8 13:16:39 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.01s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.02s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.02s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.02s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.01s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.01s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.01s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.02s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Gurobi 7.0.1 (mac64, Python) logging started Wed Mar 8 14:39:34 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Gurobi 7.0.1 (mac64, Python) logging started Wed Mar 8 14:40:02 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.00 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Gurobi 7.0.1 (mac64, Python) logging started Wed Mar 8 14:47:17 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.00 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.02s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 C6 1 C7 1 C17 7 C28 2 C29 3 C30 4 C41 1 C52 1 C63 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Gurobi 7.0.1 (mac64, Python) logging started Wed Mar 8 15:04:14 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Gurobi 7.0.1 (mac64, Python) logging started Wed Mar 8 15:05:36 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.00 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 C6 1 C7 1 C17 7 C28 2 C29 3 C30 4 C41 1 C52 1 C63 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Gurobi 7.0.1 (mac64, Python) logging started Wed Mar 8 15:06:07 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Gurobi 7.0.1 (mac64, Python) logging started Wed Mar 8 15:10:33 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Gurobi 7.0.1 (mac64, Python) logging started Wed Mar 8 15:30:27 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.02s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Gurobi 7.0.1 (mac64, Python) logging started Wed Mar 8 15:40:16 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.01s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1 patients arrived on Day1 booked on Day1: 1 Priority1 patients arrived on Day1 booked on Day2: 1 Priority1 patients arrived on Day2 booked on Day2: 7 Priority2 patients arrived on Day1 booked on Day3: 2 Priority2 patients arrived on Day1 booked on Day4: 3 Priority2 patients arrived on Day1 booked on Day5: 4 Priority2 patients arrived on Day2 booked on Day6: 1 Priority3 patients arrived on Day1 booked on Day7: 1 Priority3 patients arrived on Day2 booked on Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 13: 1 14: 1 24: 7 35: 2 36: 3 37: 4 48: 1 59: 1 70: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Gurobi 7.0.1 (mac64, Python) logging started Wed Mar 8 15:48:28 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.00 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Gurobi 7.0.1 (mac64, Python) logging started Wed Mar 8 15:50:53 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.02s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 9ddd6eff-e138-4c29-b13e-57541d0c7f04 1 64470c5e-66cc-4896-8d3c-16587968fff5 1 1d5196ea-bb9e-4ca2-8063-6e90b1190c53 7 7d994df3-e248-4220-b66e-795bf7dd9786 2 850dd362-03cc-428a-b514-8f1a74a2d40d 3 960c1316-3373-49fb-a449-1e75dc36529b 4 a1b82be7-4ce2-462e-8541-cdc66aa99dc2 1 c474248d-9d28-4c6e-9155-b2383cb79add 1 cc96e37f-2c8b-4587-9ecb-1587cb909608 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.01s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1-Day1-Day1: 1 Priority1-Day1-Day2: 1 Priority1-Day2-Day2: 7 Priority2-Day1-Day3: 2 Priority2-Day1-Day4: 3 Priority2-Day1-Day5: 4 Priority2-Day2-Day6: 1 Priority3-Day1-Day7: 1 Priority3-Day2-Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.01s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1-Day1-Day1: 1 Priority1-Day1-Day2: 1 Priority1-Day2-Day2: 7 Priority2-Day1-Day3: 2 Priority2-Day1-Day4: 3 Priority2-Day1-Day5: 4 Priority2-Day2-Day6: 1 Priority3-Day1-Day7: 1 Priority3-Day2-Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1-Day1-Day1: 1 Priority1-Day1-Day2: 1 Priority1-Day2-Day2: 7 Priority2-Day1-Day3: 2 Priority2-Day1-Day4: 3 Priority2-Day1-Day5: 4 Priority2-Day2-Day6: 1 Priority3-Day1-Day7: 1 Priority3-Day2-Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1-Day1-Day1: 1 Priority1-Day1-Day2: 1 Priority1-Day2-Day2: 7 Priority2-Day1-Day3: 2 Priority2-Day1-Day4: 3 Priority2-Day1-Day5: 4 Priority2-Day2-Day6: 1 Priority3-Day1-Day7: 1 Priority3-Day2-Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Gurobi 7.0.1 (mac64, Python) logging started Wed Mar 8 16:27:45 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.00 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1-Day1-Day1: 1 Priority1-Day1-Day2: 1 Priority1-Day2-Day2: 7 Priority2-Day1-Day3: 2 Priority2-Day1-Day4: 3 Priority2-Day1-Day5: 4 Priority2-Day2-Day6: 1 Priority3-Day1-Day7: 1 Priority3-Day2-Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1-Day1-Day1: 1 Priority1-Day1-Day2: 1 Priority1-Day2-Day2: 7 Priority2-Day1-Day3: 2 Priority2-Day1-Day4: 3 Priority2-Day1-Day5: 4 Priority2-Day2-Day6: 1 Priority3-Day1-Day7: 1 Priority3-Day2-Day8: 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Variable x ------------------------- Priority1 patients arrived on Day1 booked overtime on day Day1 : 5 Priority1-Day1-Day1 1 Priority1-Day1-Day2 1 Priority1-Day2-Day2 7 Priority2-Day1-Day3 2 Priority2-Day1-Day4 3 Priority2-Day1-Day5 4 Priority2-Day2-Day6 1 Priority3-Day1-Day7 1 Priority3-Day2-Day8 6 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 4 Priority1 remaning patients arrived day Day1 to be booked on Day10: 6 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 5 Priority1 remaning patients arrived day Day2 to be booked on Day10: 7 Priority2 remaning patients arrived day Day1 to be booked on Day3: 2 Priority2 remaning patients arrived day Day1 to be booked on Day4: 5 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.02s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Gurobi 7.0.1 (mac64, Python) logging started Wed Mar 8 16:39:12 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.00 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.00 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Gurobi 7.0.1 (mac64, Python) logging started Wed 8 Mar 16:49:52 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.02s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.01s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.10 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.01s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Gurobi 7.0.1 (mac64, Python) logging started Thu Mar 9 19:27:16 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.01s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.02s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.01s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.01s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.01s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.01s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.00s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 293 rows and 161 columns Presolve time: 0.04s Presolved: 33 rows, 25 columns, 100 nonzeros Found heuristic solution: objective 1520.0000000 Variable types: 0 continuous, 25 integer (13 binary) Root relaxation: objective 1.040000e+03, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1040.00000 0 4 1520.00000 1040.00000 31.6% - 0s H 0 0 1065.0000000 1040.00000 2.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.13 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1065 1520 2570 Pool objective bound 1065 Optimal solution found (tolerance 1.00e-04) Best objective 1.065000000000e+03, best bound 1.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.02s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.01s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Gurobi 7.0.1 (mac64, Python) logging started Mon Mar 13 14:58:43 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.07s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.25 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.02s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.02s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.01s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.02s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.02s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.03s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.16 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 489 rows, 279 columns and 3255 nonzeros Variable types: 0 continuous, 279 integer (90 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4400 Presolve removed 345 rows and 177 columns Presolve time: 0.04s Presolved: 144 rows, 102 columns, 715 nonzeros Variable types: 0 continuous, 102 integer (45 binary) Root relaxation: objective 1.315000e+03, 58 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1315.00000 0 1 4400.00000 1315.00000 70.1% - 0s H 0 0 1385.0000000 1315.00000 5.05% - 0s 0 0 1320.00000 0 1 1385.00000 1320.00000 4.69% - 0s 0 0 1347.27273 0 18 1385.00000 1347.27273 2.72% - 0s 0 0 1347.27273 0 8 1385.00000 1347.27273 2.72% - 0s 0 0 1375.00000 0 1 1385.00000 1375.00000 0.72% - 0s 0 0 cutoff 0 1385.00000 1385.00000 0.00% - 0s Cutting planes: Learned: 1 Gomory: 2 Implied bound: 2 MIR: 2 Flow cover: 3 Explored 0 nodes (114 simplex iterations) in 0.19 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1385 4400 Pool objective bound 1385 Optimal solution found (tolerance 1.00e-04) Best objective 1.385000000000e+03, best bound 1.385000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 489 rows, 279 columns and 3255 nonzeros Variable types: 0 continuous, 279 integer (90 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4400 Presolve removed 345 rows and 177 columns Presolve time: 0.03s Presolved: 144 rows, 102 columns, 715 nonzeros Variable types: 0 continuous, 102 integer (45 binary) Root relaxation: objective 1.315000e+03, 58 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1315.00000 0 1 4400.00000 1315.00000 70.1% - 0s H 0 0 1385.0000000 1315.00000 5.05% - 0s 0 0 1320.00000 0 1 1385.00000 1320.00000 4.69% - 0s 0 0 1347.27273 0 18 1385.00000 1347.27273 2.72% - 0s 0 0 1347.27273 0 8 1385.00000 1347.27273 2.72% - 0s 0 0 1375.00000 0 1 1385.00000 1375.00000 0.72% - 0s 0 0 cutoff 0 1385.00000 1385.00000 0.00% - 0s Cutting planes: Learned: 1 Gomory: 2 Implied bound: 2 MIR: 2 Flow cover: 3 Explored 0 nodes (114 simplex iterations) in 0.15 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1385 4400 Pool objective bound 1385 Optimal solution found (tolerance 1.00e-04) Best objective 1.385000000000e+03, best bound 1.385000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 489 rows, 279 columns and 3255 nonzeros Variable types: 0 continuous, 279 integer (90 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4400 Presolve removed 345 rows and 177 columns Presolve time: 0.02s Presolved: 144 rows, 102 columns, 715 nonzeros Variable types: 0 continuous, 102 integer (45 binary) Root relaxation: objective 1.315000e+03, 58 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1315.00000 0 1 4400.00000 1315.00000 70.1% - 0s H 0 0 1385.0000000 1315.00000 5.05% - 0s 0 0 1320.00000 0 1 1385.00000 1320.00000 4.69% - 0s 0 0 1347.27273 0 18 1385.00000 1347.27273 2.72% - 0s 0 0 1347.27273 0 8 1385.00000 1347.27273 2.72% - 0s 0 0 1375.00000 0 1 1385.00000 1375.00000 0.72% - 0s 0 0 cutoff 0 1385.00000 1385.00000 0.00% - 0s Cutting planes: Learned: 1 Gomory: 2 Implied bound: 2 MIR: 2 Flow cover: 3 Explored 0 nodes (114 simplex iterations) in 0.10 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1385 4400 Pool objective bound 1385 Optimal solution found (tolerance 1.00e-04) Best objective 1.385000000000e+03, best bound 1.385000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.02s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.02s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.02s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.02s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.02s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.01s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.01s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.02s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.01s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.01s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.01s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.02s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.02s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 489 rows, 279 columns and 3255 nonzeros Variable types: 0 continuous, 279 integer (90 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4400 Presolve removed 345 rows and 177 columns Presolve time: 0.01s Presolved: 144 rows, 102 columns, 715 nonzeros Variable types: 0 continuous, 102 integer (45 binary) Root relaxation: objective 1.315000e+03, 58 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1315.00000 0 1 4400.00000 1315.00000 70.1% - 0s H 0 0 1385.0000000 1315.00000 5.05% - 0s 0 0 1320.00000 0 1 1385.00000 1320.00000 4.69% - 0s 0 0 1347.27273 0 18 1385.00000 1347.27273 2.72% - 0s 0 0 1347.27273 0 8 1385.00000 1347.27273 2.72% - 0s 0 0 1375.00000 0 1 1385.00000 1375.00000 0.72% - 0s 0 0 cutoff 0 1385.00000 1385.00000 0.00% - 0s Cutting planes: Learned: 1 Gomory: 2 Implied bound: 2 MIR: 2 Flow cover: 3 Explored 0 nodes (114 simplex iterations) in 0.15 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1385 4400 Pool objective bound 1385 Optimal solution found (tolerance 1.00e-04) Best objective 1.385000000000e+03, best bound 1.385000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 489 rows, 279 columns and 3255 nonzeros Variable types: 0 continuous, 279 integer (90 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4400 Presolve removed 345 rows and 177 columns Presolve time: 0.02s Presolved: 144 rows, 102 columns, 715 nonzeros Variable types: 0 continuous, 102 integer (45 binary) Root relaxation: objective 1.315000e+03, 58 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1315.00000 0 1 4400.00000 1315.00000 70.1% - 0s H 0 0 1385.0000000 1315.00000 5.05% - 0s 0 0 1320.00000 0 1 1385.00000 1320.00000 4.69% - 0s 0 0 1347.27273 0 18 1385.00000 1347.27273 2.72% - 0s 0 0 1347.27273 0 8 1385.00000 1347.27273 2.72% - 0s 0 0 1375.00000 0 1 1385.00000 1375.00000 0.72% - 0s 0 0 cutoff 0 1385.00000 1385.00000 0.00% - 0s Cutting planes: Learned: 1 Gomory: 2 Implied bound: 2 MIR: 2 Flow cover: 3 Explored 0 nodes (114 simplex iterations) in 0.10 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1385 4400 Pool objective bound 1385 Optimal solution found (tolerance 1.00e-04) Best objective 1.385000000000e+03, best bound 1.385000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 489 rows, 279 columns and 3255 nonzeros Variable types: 0 continuous, 279 integer (90 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4400 Presolve removed 345 rows and 177 columns Presolve time: 0.02s Presolved: 144 rows, 102 columns, 715 nonzeros Variable types: 0 continuous, 102 integer (45 binary) Root relaxation: objective 1.315000e+03, 58 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1315.00000 0 1 4400.00000 1315.00000 70.1% - 0s H 0 0 1385.0000000 1315.00000 5.05% - 0s 0 0 1320.00000 0 1 1385.00000 1320.00000 4.69% - 0s 0 0 1347.27273 0 18 1385.00000 1347.27273 2.72% - 0s 0 0 1347.27273 0 8 1385.00000 1347.27273 2.72% - 0s 0 0 1375.00000 0 1 1385.00000 1375.00000 0.72% - 0s 0 0 cutoff 0 1385.00000 1385.00000 0.00% - 0s Cutting planes: Learned: 1 Gomory: 2 Implied bound: 2 MIR: 2 Flow cover: 3 Explored 0 nodes (114 simplex iterations) in 0.11 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1385 4400 Pool objective bound 1385 Optimal solution found (tolerance 1.00e-04) Best objective 1.385000000000e+03, best bound 1.385000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 652 rows, 372 columns and 6066 nonzeros Variable types: 0 continuous, 372 integer (120 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 5200 Presolve removed 435 rows and 221 columns Presolve time: 0.05s Presolved: 217 rows, 151 columns, 1613 nonzeros Variable types: 0 continuous, 151 integer (65 binary) Root relaxation: objective 1.840000e+03, 94 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1840.00000 0 1 5200.00000 1840.00000 64.6% - 0s H 0 0 1910.0000000 1840.00000 3.66% - 0s 0 0 1845.00000 0 1 1910.00000 1845.00000 3.40% - 0s 0 0 1851.27660 0 23 1910.00000 1851.27660 3.07% - 0s H 0 0 1875.0000000 1851.27660 1.27% - 0s 0 0 1855.00000 0 1 1875.00000 1855.00000 1.07% - 0s 0 0 1861.17647 0 23 1875.00000 1861.17647 0.74% - 0s Cutting planes: Cover: 1 Implied bound: 5 MIR: 2 Flow cover: 1 Explored 0 nodes (138 simplex iterations) in 0.16 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1875 1910 5200 Pool objective bound 1875 Optimal solution found (tolerance 1.00e-04) Best objective 1.875000000000e+03, best bound 1.875000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 815 rows, 465 columns and 9818 nonzeros Variable types: 0 continuous, 465 integer (150 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6300 Presolve removed 489 rows and 243 columns Presolve time: 0.06s Presolved: 326 rows, 222 columns, 3031 nonzeros Variable types: 0 continuous, 222 integer (95 binary) Root relaxation: objective 2.600000e+03, 140 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2600.00000 0 3 6300.00000 2600.00000 58.7% - 0s H 0 0 2890.0000000 2600.00000 10.0% - 0s 0 0 2600.00000 0 12 2890.00000 2600.00000 10.0% - 0s H 0 0 2810.0000000 2600.00000 7.47% - 0s H 0 0 2800.0000000 2600.00000 7.14% - 0s 0 0 2600.00000 0 12 2800.00000 2600.00000 7.14% - 0s 0 0 2601.53846 0 21 2800.00000 2601.53846 7.09% - 0s 0 0 2601.97277 0 31 2800.00000 2601.97277 7.07% - 0s H 0 0 2660.0000000 2601.97277 2.18% - 0s 0 0 2603.64737 0 31 2660.00000 2603.64737 2.12% - 0s 0 0 2606.30748 0 34 2660.00000 2606.30748 2.02% - 0s 0 0 2606.30748 0 37 2660.00000 2606.30748 2.02% - 0s 0 0 2607.48733 0 34 2660.00000 2607.48733 1.97% - 0s 0 0 2608.01114 0 37 2660.00000 2608.01114 1.95% - 0s 0 0 2610.80392 0 40 2660.00000 2610.80392 1.85% - 0s 0 0 2612.41617 0 46 2660.00000 2612.41617 1.79% - 0s 0 0 2613.33333 0 38 2660.00000 2613.33333 1.75% - 0s 0 0 2614.50893 0 34 2660.00000 2614.50893 1.71% - 0s 0 0 2616.50233 0 48 2660.00000 2616.50233 1.64% - 0s 0 0 2616.50760 0 50 2660.00000 2616.50760 1.64% - 0s 0 0 2616.73599 0 58 2660.00000 2616.73599 1.63% - 0s 0 0 2616.76086 0 57 2660.00000 2616.76086 1.63% - 0s 0 0 2617.00124 0 37 2660.00000 2617.00124 1.62% - 0s 0 0 2617.10259 0 36 2660.00000 2617.10259 1.61% - 0s 0 0 2617.66667 0 37 2660.00000 2617.66667 1.59% - 0s 0 0 2617.69397 0 34 2660.00000 2617.69397 1.59% - 0s 0 0 2620.71429 0 35 2660.00000 2620.71429 1.48% - 0s 0 0 2620.81126 0 42 2660.00000 2620.81126 1.47% - 0s 0 0 2620.81126 0 41 2660.00000 2620.81126 1.47% - 0s 0 0 2620.81126 0 43 2660.00000 2620.81126 1.47% - 0s 0 0 2621.66667 0 43 2660.00000 2621.66667 1.44% - 0s 0 0 2621.66667 0 43 2660.00000 2621.66667 1.44% - 0s 0 0 2621.66667 0 38 2660.00000 2621.66667 1.44% - 0s 0 0 2621.66667 0 3 2660.00000 2621.66667 1.44% - 0s 0 0 2621.66667 0 16 2660.00000 2621.66667 1.44% - 0s 0 0 2621.66667 0 27 2660.00000 2621.66667 1.44% - 0s 0 0 2621.66667 0 24 2660.00000 2621.66667 1.44% - 0s 0 0 2621.66667 0 29 2660.00000 2621.66667 1.44% - 0s 0 0 2622.72818 0 29 2660.00000 2622.72818 1.40% - 0s 0 0 2624.20000 0 28 2660.00000 2624.20000 1.35% - 0s 0 0 2624.20000 0 32 2660.00000 2624.20000 1.35% - 0s 0 0 2628.93258 0 35 2660.00000 2628.93258 1.17% - 0s 0 0 2629.50000 0 25 2660.00000 2629.50000 1.15% - 0s 0 0 2629.50000 0 24 2660.00000 2629.50000 1.15% - 0s 0 0 2629.50000 0 23 2660.00000 2629.50000 1.15% - 0s 0 0 2629.61538 0 30 2660.00000 2629.61538 1.14% - 0s 0 0 2629.61538 0 30 2660.00000 2629.61538 1.14% - 0s 0 0 2630.00839 0 37 2660.00000 2630.00839 1.13% - 0s 0 0 2630.16393 0 29 2660.00000 2630.16393 1.12% - 0s 0 0 2630.33898 0 27 2660.00000 2630.33898 1.12% - 0s 0 0 2630.33898 0 27 2660.00000 2630.33898 1.12% - 0s 0 0 2648.63636 0 23 2660.00000 2648.63636 0.43% - 0s 0 0 2650.00000 0 9 2660.00000 2650.00000 0.38% - 0s 0 0 2650.00000 0 9 2660.00000 2650.00000 0.38% - 0s 0 0 2650.00000 0 1 2660.00000 2650.00000 0.38% - 0s 0 0 cutoff 0 2660.00000 2660.00000 0.00% - 0s Cutting planes: MIR: 4 Zero half: 2 Explored 0 nodes (713 simplex iterations) in 0.67 seconds Thread count was 4 (of 4 available processors) Solution count 6: 2660 2660 2800 ... 6300 Pool objective bound 2660 Optimal solution found (tolerance 1.00e-04) Best objective 2.660000000000e+03, best bound 2.660000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 978 rows, 558 columns and 14607 nonzeros Variable types: 0 continuous, 558 integer (180 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 552 rows and 267 columns Presolve time: 0.08s Presolved: 426 rows, 291 columns, 4843 nonzeros Variable types: 0 continuous, 291 integer (125 binary) Root relaxation: objective 3.605000e+03, 161 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3605.00000 0 1 7500.00000 3605.00000 51.9% - 0s H 0 0 3650.0000000 3605.00000 1.23% - 0s H 0 0 3610.0000000 3605.00000 0.14% - 0s Cutting planes: Zero half: 1 Explored 0 nodes (174 simplex iterations) in 0.13 seconds Thread count was 4 (of 4 available processors) Solution count 3: 3610 3650 7500 Pool objective bound 3610 Optimal solution found (tolerance 1.00e-04) Best objective 3.610000000000e+03, best bound 3.610000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 978 rows, 558 columns and 14607 nonzeros Variable types: 0 continuous, 558 integer (180 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 552 rows and 267 columns Presolve time: 0.07s Presolved: 426 rows, 291 columns, 4843 nonzeros Variable types: 0 continuous, 291 integer (125 binary) Root relaxation: objective 3.605000e+03, 161 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3605.00000 0 1 7500.00000 3605.00000 51.9% - 0s H 0 0 3650.0000000 3605.00000 1.23% - 0s H 0 0 3610.0000000 3605.00000 0.14% - 0s Cutting planes: Zero half: 1 Explored 0 nodes (174 simplex iterations) in 0.10 seconds Thread count was 4 (of 4 available processors) Solution count 3: 3610 3650 7500 Pool objective bound 3610 Optimal solution found (tolerance 1.00e-04) Best objective 3.610000000000e+03, best bound 3.610000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 978 rows, 558 columns and 14607 nonzeros Variable types: 0 continuous, 558 integer (180 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 552 rows and 267 columns Presolve time: 0.07s Presolved: 426 rows, 291 columns, 4843 nonzeros Variable types: 0 continuous, 291 integer (125 binary) Root relaxation: objective 3.605000e+03, 161 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3605.00000 0 1 7500.00000 3605.00000 51.9% - 0s H 0 0 3650.0000000 3605.00000 1.23% - 0s H 0 0 3610.0000000 3605.00000 0.14% - 0s Cutting planes: Zero half: 1 Explored 0 nodes (174 simplex iterations) in 0.13 seconds Thread count was 4 (of 4 available processors) Solution count 3: 3610 3650 7500 Pool objective bound 3610 Optimal solution found (tolerance 1.00e-04) Best objective 3.610000000000e+03, best bound 3.610000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1362 rows and 707 columns Presolve time: 0.08s Presolved: 576 rows, 391 columns, 6154 nonzeros Variable types: 0 continuous, 391 integer (169 binary) Root relaxation: objective 3.225000e+03, 283 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3225.00000 0 4 7500.00000 3225.00000 57.0% - 0s H 0 0 3375.0000000 3225.00000 4.44% - 0s H 0 0 3260.0000000 3225.00000 1.07% - 0s 0 0 3225.78212 0 38 3260.00000 3225.78212 1.05% - 0s H 0 0 3230.0000000 3225.78212 0.13% - 0s Cutting planes: Gomory: 1 Cover: 1 Implied bound: 1 MIR: 2 Flow cover: 2 Explored 0 nodes (313 simplex iterations) in 0.20 seconds Thread count was 4 (of 4 available processors) Solution count 4: 3230 3260 3375 7500 Pool objective bound 3230 Optimal solution found (tolerance 1.00e-04) Best objective 3.230000000000e+03, best bound 3.230000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1283 rows and 651 columns Presolve time: 0.14s Presolved: 655 rows, 447 columns, 6157 nonzeros Variable types: 0 continuous, 447 integer (198 binary) Root relaxation: objective 2.715000e+03, 274 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2715.00000 0 2 7500.00000 2715.00000 63.8% - 0s H 0 0 2760.0000000 2715.00000 1.63% - 0s 0 0 2715.00000 0 4 2760.00000 2715.00000 1.63% - 0s 0 0 2716.66667 0 18 2760.00000 2716.66667 1.57% - 0s 0 0 2716.66667 0 2 2760.00000 2716.66667 1.57% - 0s 0 0 2717.00000 0 14 2760.00000 2717.00000 1.56% - 0s 0 0 2718.00000 0 10 2760.00000 2718.00000 1.52% - 0s 0 0 2731.36364 0 12 2760.00000 2731.36364 1.04% - 0s 0 0 2733.23529 0 23 2760.00000 2733.23529 0.97% - 0s 0 0 2733.23529 0 23 2760.00000 2733.23529 0.97% - 0s 0 0 2740.00000 0 18 2760.00000 2740.00000 0.72% - 0s 0 0 2740.00000 0 2 2760.00000 2740.00000 0.72% - 0s 0 0 2740.00000 0 1 2760.00000 2740.00000 0.72% - 0s 0 0 2755.00000 0 1 2760.00000 2755.00000 0.18% - 0s Cutting planes: Gomory: 2 Implied bound: 1 MIR: 1 Flow cover: 2 Zero half: 1 Explored 0 nodes (549 simplex iterations) in 0.45 seconds Thread count was 4 (of 4 available processors) Solution count 3: 2760 2760 7500 Pool objective bound 2760 Optimal solution found (tolerance 1.00e-04) Best objective 2.760000000000e+03, best bound 2.760000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1508 rows and 803 columns Presolve time: 0.12s Presolved: 430 rows, 295 columns, 3879 nonzeros Variable types: 0 continuous, 295 integer (134 binary) Root relaxation: objective 3.062143e+03, 195 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3062.14286 0 4 7500.00000 3062.14286 59.2% - 0s H 0 0 3065.0000000 3062.14286 0.09% - 0s Explored 0 nodes (203 simplex iterations) in 0.17 seconds Thread count was 4 (of 4 available processors) Solution count 2: 3065 7500 Pool objective bound 3065 Optimal solution found (tolerance 1.00e-04) Best objective 3.065000000000e+03, best bound 3.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 969 rows, 549 columns and 7395 nonzeros Variable types: 0 continuous, 549 integer (180 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4400 Presolve removed 855 rows and 466 columns Presolve time: 0.05s Presolved: 114 rows, 83 columns, 448 nonzeros Variable types: 0 continuous, 83 integer (33 binary) Root relaxation: objective 1.415000e+03, 68 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1415.00000 0 3 4400.00000 1415.00000 67.8% - 0s H 0 0 1505.0000000 1415.00000 5.98% - 0s 0 0 1423.50000 0 23 1505.00000 1423.50000 5.42% - 0s H 0 0 1455.0000000 1423.50000 2.16% - 0s 0 0 1424.50000 0 16 1455.00000 1424.50000 2.10% - 0s 0 0 1450.00000 0 8 1455.00000 1450.00000 0.34% - 0s Cutting planes: Gomory: 2 MIR: 2 Explored 0 nodes (113 simplex iterations) in 0.20 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1455 1505 4400 Pool objective bound 1455 Optimal solution found (tolerance 1.00e-04) Best objective 1.455000000000e+03, best bound 1.455000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 969 rows, 549 columns and 7395 nonzeros Variable types: 0 continuous, 549 integer (180 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4400 Presolve removed 829 rows and 451 columns Presolve time: 0.02s Presolved: 140 rows, 98 columns, 491 nonzeros Variable types: 0 continuous, 98 integer (43 binary) Root relaxation: objective 1.194734e+03, 89 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1194.73373 0 12 4400.00000 1194.73373 72.8% - 0s H 0 0 1555.0000000 1194.73373 23.2% - 0s H 0 0 1410.0000000 1194.73373 15.3% - 0s H 0 0 1405.0000000 1194.73373 15.0% - 0s 0 0 1265.00000 0 2 1405.00000 1265.00000 10.0% - 0s 0 0 1280.38462 0 36 1405.00000 1280.38462 8.87% - 0s 0 0 1365.00000 0 10 1405.00000 1365.00000 2.85% - 0s 0 0 1365.00000 0 2 1405.00000 1365.00000 2.85% - 0s 0 0 1365.00000 0 19 1405.00000 1365.00000 2.85% - 0s 0 0 1373.06452 0 15 1405.00000 1373.06452 2.27% - 0s 0 0 cutoff 0 1405.00000 1405.00000 0.00% - 0s Cutting planes: Learned: 1 Gomory: 3 MIR: 3 Flow cover: 1 Explored 0 nodes (266 simplex iterations) in 0.13 seconds Thread count was 4 (of 4 available processors) Solution count 4: 1405 1410 1555 4400 Pool objective bound 1405 Optimal solution found (tolerance 1.00e-04) Best objective 1.405000000000e+03, best bound 1.405000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 969 rows, 549 columns and 7395 nonzeros Variable types: 0 continuous, 549 integer (180 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4400 Presolve removed 770 rows and 408 columns Presolve time: 0.04s Presolved: 199 rows, 141 columns, 987 nonzeros Variable types: 0 continuous, 141 integer (63 binary) Root relaxation: objective 1.430000e+03, 112 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1430.00000 0 1 4400.00000 1430.00000 67.5% - 0s H 0 0 1440.0000000 1430.00000 0.69% - 0s 0 0 infeasible 0 1440.00000 1435.00144 0.35% - 0s Cutting planes: Flow cover: 1 Explored 0 nodes (123 simplex iterations) in 0.13 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1440 4400 Pool objective bound 1440 Optimal solution found (tolerance 1.00e-04) Best objective 1.440000000000e+03, best bound 1.440000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 969 rows, 549 columns and 7395 nonzeros Variable types: 0 continuous, 549 integer (180 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4400 Presolve removed 872 rows and 481 columns Presolve time: 0.03s Presolved: 97 rows, 68 columns, 330 nonzeros Variable types: 0 continuous, 68 integer (28 binary) Root relaxation: objective 1.274286e+03, 60 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1274.28571 0 4 4400.00000 1274.28571 71.0% - 0s H 0 0 1280.0000000 1274.28571 0.45% - 0s Cutting planes: Zero half: 1 Explored 0 nodes (73 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1280 4400 Pool objective bound 1280 Optimal solution found (tolerance 1.00e-04) Best objective 1.280000000000e+03, best bound 1.280000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 646 rows, 366 columns and 3157 nonzeros Variable types: 0 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 532 rows and 283 columns Presolve time: 0.11s Presolved: 114 rows, 83 columns, 375 nonzeros Variable types: 0 continuous, 83 integer (37 binary) Root relaxation: objective 1.520000e+03, 71 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1520.0000000 1520.00000 0.00% - 0s Explored 0 nodes (76 simplex iterations) in 0.32 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1520 3100 Pool objective bound 1520 Optimal solution found (tolerance 1.00e-04) Best objective 1.520000000000e+03, best bound 1.520000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 646 rows, 366 columns and 3157 nonzeros Variable types: 0 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 571 rows and 311 columns Presolve time: 0.07s Presolved: 75 rows, 55 columns, 244 nonzeros Variable types: 0 continuous, 55 integer (28 binary) Root relaxation: objective 1.355000e+03, 48 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1355.00000 0 1 3100.00000 1355.00000 56.3% - 0s H 0 0 1360.0000000 1355.00000 0.37% - 0s Explored 0 nodes (65 simplex iterations) in 0.21 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1360 3100 Pool objective bound 1360 Optimal solution found (tolerance 1.00e-04) Best objective 1.360000000000e+03, best bound 1.360000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 646 rows, 366 columns and 3157 nonzeros Variable types: 0 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 527 rows and 282 columns Presolve time: 0.03s Presolved: 119 rows, 84 columns, 375 nonzeros Variable types: 0 continuous, 84 integer (38 binary) Root relaxation: objective 1.058333e+03, 78 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1058.33333 0 4 3100.00000 1058.33333 65.9% - 0s H 0 0 1060.0000000 1058.33333 0.16% - 0s Explored 0 nodes (86 simplex iterations) in 0.12 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1060 3100 Pool objective bound 1060 Optimal solution found (tolerance 1.00e-04) Best objective 1.060000000000e+03, best bound 1.060000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 646 rows, 366 columns and 3157 nonzeros Variable types: 0 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 541 rows and 294 columns Presolve time: 0.02s Presolved: 105 rows, 72 columns, 336 nonzeros Found heuristic solution: objective 1420.0000000 Variable types: 0 continuous, 72 integer (35 binary) Root relaxation: objective 7.543750e+02, 72 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 754.37500 0 22 1420.00000 754.37500 46.9% - 0s H 0 0 765.0000000 754.37500 1.39% - 0s 0 0 cutoff 0 765.00000 760.00077 0.65% - 0s Explored 0 nodes (120 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 3: 765 1420 2630 Pool objective bound 765 Optimal solution found (tolerance 1.00e-04) Best objective 7.650000000000e+02, best bound 7.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 646 rows, 366 columns and 3157 nonzeros Variable types: 0 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 576 rows and 317 columns Presolve time: 0.10s Presolved: 70 rows, 49 columns, 210 nonzeros Found heuristic solution: objective 1860.0000000 Variable types: 0 continuous, 49 integer (24 binary) Root relaxation: objective 7.918182e+02, 48 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 791.81818 0 4 1860.00000 791.81818 57.4% - 0s H 0 0 860.0000000 791.81818 7.93% - 0s 0 0 cutoff 0 860.00000 855.00086 0.58% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (53 simplex iterations) in 0.21 seconds Thread count was 4 (of 4 available processors) Solution count 3: 860 1860 2740 Pool objective bound 860 Optimal solution found (tolerance 1.00e-04) Best objective 8.600000000000e+02, best bound 8.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 646 rows, 366 columns and 3157 nonzeros Variable types: 0 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 494 rows and 262 columns Presolve time: 0.02s Presolved: 152 rows, 104 columns, 478 nonzeros Variable types: 0 continuous, 104 integer (50 binary) Root relaxation: objective 7.419167e+02, 100 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 741.91667 0 25 3100.00000 741.91667 76.1% - 0s H 0 0 830.0000000 741.91667 10.6% - 0s * 0 0 0 770.0000000 770.00000 0.00% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (107 simplex iterations) in 0.10 seconds Thread count was 4 (of 4 available processors) Solution count 3: 770 830 3100 Pool objective bound 770 Optimal solution found (tolerance 1.00e-04) Best objective 7.700000000000e+02, best bound 7.700000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 646 rows, 366 columns and 3157 nonzeros Variable types: 0 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Presolve removed 140 rows and 6 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 646 rows, 366 columns and 3157 nonzeros Variable types: 0 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 578 rows and 317 columns Presolve time: 0.03s Presolved: 68 rows, 49 columns, 194 nonzeros Variable types: 0 continuous, 49 integer (23 binary) Root relaxation: objective 4.686667e+02, 44 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 468.66667 0 7 3100.00000 468.66667 84.9% - 0s H 0 0 695.0000000 468.66667 32.6% - 0s H 0 0 625.0000000 468.66667 25.0% - 0s H 0 0 555.0000000 468.66667 15.6% - 0s * 0 0 0 495.0000000 495.00000 0.00% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (51 simplex iterations) in 0.12 seconds Thread count was 4 (of 4 available processors) Solution count 5: 495 555 625 ... 3100 Pool objective bound 495 Optimal solution found (tolerance 1.00e-04) Best objective 4.950000000000e+02, best bound 4.950000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.11s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.24 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.03s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.08s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.21 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.04s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.05 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.31 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.02s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.03s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 489 rows, 279 columns and 3255 nonzeros Variable types: 0 continuous, 279 integer (90 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4400 Presolve removed 345 rows and 177 columns Presolve time: 0.07s Presolved: 144 rows, 102 columns, 715 nonzeros Variable types: 0 continuous, 102 integer (45 binary) Root relaxation: objective 1.315000e+03, 58 iterations, 0.06 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1315.00000 0 1 4400.00000 1315.00000 70.1% - 0s H 0 0 1385.0000000 1315.00000 5.05% - 0s 0 0 1320.00000 0 1 1385.00000 1320.00000 4.69% - 0s 0 0 1347.27273 0 18 1385.00000 1347.27273 2.72% - 0s 0 0 1347.27273 0 8 1385.00000 1347.27273 2.72% - 0s 0 0 1375.00000 0 1 1385.00000 1375.00000 0.72% - 0s 0 0 cutoff 0 1385.00000 1385.00000 0.00% - 0s Cutting planes: Learned: 1 Gomory: 2 Implied bound: 2 MIR: 2 Flow cover: 3 Explored 0 nodes (114 simplex iterations) in 0.47 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1385 4400 Pool objective bound 1385 Optimal solution found (tolerance 1.00e-04) Best objective 1.385000000000e+03, best bound 1.385000000000e+03, gap 0.0000% Gurobi 7.0.1 (mac64, Python) logging started Wed Mar 15 12:09:23 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 489 rows, 279 columns and 3255 nonzeros Variable types: 0 continuous, 279 integer (90 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4400 Presolve removed 345 rows and 177 columns Presolve time: 0.02s Presolved: 144 rows, 102 columns, 715 nonzeros Variable types: 0 continuous, 102 integer (45 binary) Root relaxation: objective 1.315000e+03, 58 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1315.00000 0 1 4400.00000 1315.00000 70.1% - 0s H 0 0 1385.0000000 1315.00000 5.05% - 0s 0 0 1320.00000 0 1 1385.00000 1320.00000 4.69% - 0s 0 0 1347.27273 0 18 1385.00000 1347.27273 2.72% - 0s 0 0 1347.27273 0 8 1385.00000 1347.27273 2.72% - 0s 0 0 1375.00000 0 1 1385.00000 1375.00000 0.72% - 0s 0 0 cutoff 0 1385.00000 1385.00000 0.00% - 0s Cutting planes: Learned: 1 Gomory: 2 Implied bound: 2 MIR: 2 Flow cover: 3 Explored 0 nodes (114 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1385 4400 Pool objective bound 1385 Optimal solution found (tolerance 1.00e-04) Best objective 1.385000000000e+03, best bound 1.385000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.01s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3086 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3086 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3086 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3086 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3117.17 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.660101e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 866.0101010 866.01010 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 866.01 3117.17 Pool objective bound 866.01 Optimal solution found (tolerance 1.00e-04) Best objective 8.660101010101e+02, best bound 8.660101010101e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3086 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3086 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3100 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6169 Presolve removed 281 rows and 152 columns Presolve time: 0.01s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 9.640000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 964.0000000 964.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 964 6169 Pool objective bound 964 Optimal solution found (tolerance 1.00e-04) Best objective 9.640000000000e+02, best bound 9.640000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3086 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3086 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3086 Presolve removed 281 rows and 152 columns Presolve time: 0.02s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3086 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3086 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 3086 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2960 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 2960 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2960 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 2960 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2400 Presolve removed 284 rows and 154 columns Presolve time: 0.00s Presolved: 42 rows, 32 columns, 134 nonzeros Variable types: 0 continuous, 32 integer (15 binary) Root relaxation: objective 8.400000e+02, 27 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 840.0000000 840.00000 0.00% - 0s Explored 0 nodes (35 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 840 2400 Pool objective bound 840 Optimal solution found (tolerance 1.00e-04) Best objective 8.400000000000e+02, best bound 8.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2540 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.500000e+02, 29 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 850.0000000 850.00000 0.00% - 0s Explored 0 nodes (38 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 850 2540 Pool objective bound 850 Optimal solution found (tolerance 1.00e-04) Best objective 8.500000000000e+02, best bound 8.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2680 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.600000e+02, 29 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 860.0000000 860.00000 0.00% - 0s Explored 0 nodes (38 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 860 2680 Pool objective bound 860 Optimal solution found (tolerance 1.00e-04) Best objective 8.600000000000e+02, best bound 8.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2820 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (24 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 2820 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2750 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.650000e+02, 25 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 865.0000000 865.00000 0.00% - 0s Explored 0 nodes (30 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 865 2750 Pool objective bound 865 Optimal solution found (tolerance 1.00e-04) Best objective 8.650000000000e+02, best bound 8.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2680 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.600000e+02, 29 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 860.0000000 860.00000 0.00% - 0s Explored 0 nodes (38 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 860 2680 Pool objective bound 860 Optimal solution found (tolerance 1.00e-04) Best objective 8.600000000000e+02, best bound 8.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 326 rows, 186 columns and 1417 nonzeros Variable types: 0 continuous, 186 integer (60 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 2680 Presolve removed 281 rows and 152 columns Presolve time: 0.00s Presolved: 45 rows, 34 columns, 142 nonzeros Variable types: 0 continuous, 34 integer (17 binary) Root relaxation: objective 8.600000e+02, 29 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 860.0000000 860.00000 0.00% - 0s Explored 0 nodes (38 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 860 2680 Pool objective bound 860 Optimal solution found (tolerance 1.00e-04) Best objective 8.600000000000e+02, best bound 8.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 815 rows, 465 columns and 9818 nonzeros Variable types: 0 continuous, 465 integer (150 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3855.51 Presolve removed 491 rows and 244 columns Presolve time: 0.06s Presolved: 324 rows, 221 columns, 3026 nonzeros Variable types: 0 continuous, 221 integer (95 binary) Root relaxation: objective 1.817880e+03, 176 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1817.88000 0 4 3855.51000 1817.88000 52.8% - 0s H 0 0 2377.5800000 1817.88000 23.5% - 0s H 0 0 1897.4600000 1817.88000 4.19% - 0s 0 0 1817.88000 0 25 1897.46000 1817.88000 4.19% - 0s H 0 0 1882.4600000 1817.88000 3.43% - 0s 0 0 1818.14387 0 33 1882.46000 1818.14387 3.42% - 0s H 0 0 1849.1600000 1818.14387 1.68% - 0s 0 0 1818.16328 0 38 1849.16000 1818.16328 1.68% - 0s 0 0 1818.88048 0 40 1849.16000 1818.88048 1.64% - 0s H 0 0 1844.8600000 1818.88048 1.41% - 0s 0 0 1818.88048 0 11 1844.86000 1818.88048 1.41% - 0s H 0 0 1819.8800000 1818.88048 0.05% - 0s Cutting planes: Gomory: 1 Implied bound: 1 MIR: 2 Flow cover: 1 Explored 0 nodes (389 simplex iterations) in 0.26 seconds Thread count was 4 (of 4 available processors) Solution count 8: 1819.88 1844.86 1849.16 ... 3855.51 Pool objective bound 1819.88 Optimal solution found (tolerance 1.00e-04) Best objective 1.819880000000e+03, best bound 1.819880000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 815 rows, 465 columns and 9818 nonzeros Variable types: 0 continuous, 465 integer (150 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3855.51 Presolve removed 491 rows and 244 columns Presolve time: 0.05s Presolved: 324 rows, 221 columns, 3026 nonzeros Variable types: 0 continuous, 221 integer (95 binary) Root relaxation: objective 1.817880e+03, 176 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1817.88000 0 4 3855.51000 1817.88000 52.8% - 0s H 0 0 2377.5800000 1817.88000 23.5% - 0s H 0 0 1897.4600000 1817.88000 4.19% - 0s 0 0 1817.88000 0 25 1897.46000 1817.88000 4.19% - 0s H 0 0 1882.4600000 1817.88000 3.43% - 0s 0 0 1818.14387 0 33 1882.46000 1818.14387 3.42% - 0s H 0 0 1849.1600000 1818.14387 1.68% - 0s 0 0 1818.16328 0 38 1849.16000 1818.16328 1.68% - 0s 0 0 1818.88048 0 40 1849.16000 1818.88048 1.64% - 0s H 0 0 1844.8600000 1818.88048 1.41% - 0s 0 0 1818.88048 0 11 1844.86000 1818.88048 1.41% - 0s H 0 0 1819.8800000 1818.88048 0.05% - 0s Cutting planes: Gomory: 1 Implied bound: 1 MIR: 2 Flow cover: 1 Explored 0 nodes (389 simplex iterations) in 0.18 seconds Thread count was 4 (of 4 available processors) Solution count 8: 1819.88 1844.86 1849.16 ... 3855.51 Pool objective bound 1819.88 Optimal solution found (tolerance 1.00e-04) Best objective 1.819880000000e+03, best bound 1.819880000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 978 rows, 558 columns and 14607 nonzeros Variable types: 0 continuous, 558 integer (180 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4057.19 Presolve removed 553 rows and 268 columns Presolve time: 0.10s Presolved: 425 rows, 290 columns, 4839 nonzeros Variable types: 0 continuous, 290 integer (125 binary) Root relaxation: objective 2.019564e+03, 199 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2019.56400 0 4 4057.19400 2019.56400 50.2% - 0s H 0 0 2056.1490000 2019.56400 1.78% - 0s 0 0 2019.56400 0 20 2056.14900 2019.56400 1.78% - 0s 0 0 2019.56400 0 4 2056.14900 2019.56400 1.78% - 0s 0 0 2019.56400 0 27 2056.14900 2019.56400 1.78% - 0s 0 0 2019.56539 0 44 2056.14900 2019.56539 1.78% - 0s 0 0 2020.07300 0 51 2056.14900 2020.07300 1.75% - 0s 0 0 2020.32261 0 57 2056.14900 2020.32261 1.74% - 0s H 0 0 2047.4530000 2020.32261 1.33% - 0s 0 0 2020.46104 0 58 2047.45300 2020.46104 1.32% - 0s * 0 0 0 2021.5640000 2021.56400 0.00% - 0s Cutting planes: Gomory: 2 MIR: 11 Explored 0 nodes (425 simplex iterations) in 0.30 seconds Thread count was 4 (of 4 available processors) Solution count 4: 2021.56 2047.45 2056.15 4057.19 Pool objective bound 2021.56 Optimal solution found (tolerance 1.00e-04) Best objective 2.021564000000e+03, best bound 2.021564000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 4057.19 Presolve removed 1330 rows and 687 columns Presolve time: 0.11s Presolved: 608 rows, 411 columns, 6571 nonzeros Variable types: 0 continuous, 411 integer (184 binary) Root relaxation: objective 2.009970e+03, 311 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2009.97000 0 4 4057.19400 2009.97000 50.5% - 0s H 0 0 2151.3470000 2009.97000 6.57% - 0s 0 0 2018.25376 0 45 2151.34700 2018.25376 6.19% - 0s H 0 0 2126.0470000 2018.25376 5.07% - 0s 0 0 2024.36072 0 30 2126.04700 2024.36072 4.78% - 0s 0 0 2024.36072 0 9 2126.04700 2024.36072 4.78% - 0s H 0 0 2067.8570000 2024.36072 2.10% - 0s 0 0 2027.95870 0 38 2067.85700 2027.95870 1.93% - 0s 0 0 2028.76282 0 37 2067.85700 2028.76282 1.89% - 0s 0 0 2040.43215 0 36 2067.85700 2040.43215 1.33% - 0s 0 0 2040.43215 0 36 2067.85700 2040.43215 1.33% - 0s 0 0 2040.69400 0 1 2067.85700 2040.69400 1.31% - 0s H 0 0 2063.8470000 2040.69400 1.12% - 0s 0 0 2040.80389 0 25 2063.84700 2040.80389 1.12% - 0s 0 0 2040.99414 0 39 2063.84700 2040.99414 1.11% - 0s 0 0 2040.99414 0 41 2063.84700 2040.99414 1.11% - 0s * 0 0 0 2041.6940000 2041.69400 0.00% - 0s Cutting planes: Gomory: 3 Implied bound: 3 MIR: 13 Flow cover: 2 Zero half: 2 Explored 0 nodes (811 simplex iterations) in 0.63 seconds Thread count was 4 (of 4 available processors) Solution count 6: 2041.69 2063.85 2067.86 ... 4057.19 Pool objective bound 2041.69 Optimal solution found (tolerance 1.00e-04) Best objective 2.041694000000e+03, best bound 2.041694000000e+03, gap 0.0000% Gurobi 7.0.1 (mac64, Python) logging started Sun Mar 19 11:28:05 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3987.19 Presolve removed 1305 rows and 677 columns Presolve time: 0.12s Presolved: 633 rows, 421 columns, 6227 nonzeros Variable types: 0 continuous, 421 integer (196 binary) Root relaxation: objective 1.528594e+03, 301 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1528.5940000 1528.59400 0.00% - 0s Explored 0 nodes (307 simplex iterations) in 0.18 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1528.59 3987.19 Pool objective bound 1528.59 Optimal solution found (tolerance 1.00e-04) Best objective 1.528594000000e+03, best bound 1.528594000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1343 rows and 692 columns Presolve time: 0.08s Presolved: 595 rows, 406 columns, 5572 nonzeros Variable types: 0 continuous, 406 integer (178 binary) Root relaxation: objective 2.865000e+03, 292 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2865.00000 0 1 7500.00000 2865.00000 61.8% - 0s H 0 0 2995.0000000 2865.00000 4.34% - 0s 0 0 2881.25000 0 12 2995.00000 2881.25000 3.80% - 0s 0 0 2933.88889 0 28 2995.00000 2933.88889 2.04% - 0s 0 0 2933.88889 0 1 2995.00000 2933.88889 2.04% - 0s * 0 0 0 2935.0000000 2935.00000 0.00% - 0s Cutting planes: Gomory: 1 Flow cover: 2 Explored 0 nodes (548 simplex iterations) in 0.33 seconds Thread count was 4 (of 4 available processors) Solution count 3: 2935 2995 7500 Pool objective bound 2935 Optimal solution found (tolerance 1.00e-04) Best objective 2.935000000000e+03, best bound 2.935000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1309 rows and 673 columns Presolve time: 0.10s Presolved: 629 rows, 425 columns, 5641 nonzeros Variable types: 0 continuous, 425 integer (190 binary) Root relaxation: objective 2.270000e+03, 312 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2270.00000 0 2 7500.00000 2270.00000 69.7% - 0s H 0 0 2515.0000000 2270.00000 9.74% - 0s H 0 0 2460.0000000 2270.00000 7.72% - 0s H 0 0 2410.0000000 2270.00000 5.81% - 0s 0 0 2270.00000 0 18 2410.00000 2270.00000 5.81% - 0s 0 0 2272.14286 0 14 2410.00000 2272.14286 5.72% - 0s 0 0 2272.14286 0 13 2410.00000 2272.14286 5.72% - 0s H 0 0 2380.0000000 2272.14286 4.53% - 0s 0 0 2293.33333 0 12 2380.00000 2293.33333 3.64% - 0s 0 0 2300.00000 0 20 2380.00000 2300.00000 3.36% - 0s 0 0 2300.00000 0 17 2380.00000 2300.00000 3.36% - 0s H 0 0 2340.0000000 2300.00000 1.71% - 0s * 0 0 0 2310.0000000 2310.00000 0.00% - 0s Cutting planes: Gomory: 2 MIR: 3 Explored 0 nodes (573 simplex iterations) in 0.35 seconds Thread count was 4 (of 4 available processors) Solution count 8: 2310 2340 2380 ... 7500 Pool objective bound 2310 Optimal solution found (tolerance 1.00e-04) Best objective 2.310000000000e+03, best bound 2.310000000000e+03, gap 0.0000% Gurobi 7.0.2 (mac64, Python) logging started Sat Apr 22 19:09:11 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1291 rows and 659 columns Presolve time: 0.07s Presolved: 647 rows, 439 columns, 6857 nonzeros Variable types: 0 continuous, 439 integer (208 binary) Root relaxation: objective 2.585000e+03, 294 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2585.00000 0 3 7500.00000 2585.00000 65.5% - 0s H 0 0 2695.0000000 2585.00000 4.08% - 0s H 0 0 2650.0000000 2585.00000 2.45% - 0s 0 0 2611.00000 0 13 2650.00000 2611.00000 1.47% - 0s 0 0 2624.16667 0 40 2650.00000 2624.16667 0.97% - 0s 0 0 cutoff 0 2650.00000 2650.00000 0.00% - 0s Explored 0 nodes (406 simplex iterations) in 0.17 seconds Thread count was 4 (of 4 available processors) Solution count 4: 2650 2650 2695 7500 Pool objective bound 2650 Optimal solution found (tolerance 1.00e-04) Best objective 2.650000000000e+03, best bound 2.650000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1395 rows and 728 columns Presolve time: 0.05s Presolved: 543 rows, 370 columns, 6119 nonzeros Variable types: 0 continuous, 370 integer (182 binary) Root relaxation: objective 3.775000e+03, 234 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3775.00000 0 2 7500.00000 3775.00000 49.7% - 0s H 0 0 3810.0000000 3775.00000 0.92% - 0s 0 0 cutoff 0 3810.00000 3805.00381 0.13% - 0s Cutting planes: Implied bound: 2 MIR: 3 Flow cover: 1 Explored 0 nodes (256 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 2: 3810 7500 Pool objective bound 3810 Optimal solution found (tolerance 1.00e-04) Best objective 3.810000000000e+03, best bound 3.810000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day1--Day1 5 Priority1--Day2--Day2 4 Priority1--Day4--Day4 5 Priority1--Day5--Day5 2 Priority2--Day1--Day1 9 Priority2--Day2--Day2 1 Priority2--Day3--Day3 1 Priority3--Day1--Day1 1 Priority3--Day2--Day2 3 Priority1-Day1-Day1 2 Priority1-Day2-Day2 3 Priority1-Day3-Day3 4 Priority1-Day4-Day4 1 Priority1-Day5-Day5 1 Priority1-Day6-Day6 3 Priority2-Day3-Day3 4 Priority2-Day5-Day6 4 Priority2-Day5-Day9 1 Priority2-Day6-Day10 2 Priority3-Day2-Day7 1 Priority3-Day2-Day8 2 Priority3-Day3-Day9 4 Priority3-Day4-Day10 2 Priority3-Day5-Day11 3 Priority3-Day6-Day11 3 Priority3-Day6-Day12 4 Priority1 remaning patients arrived day Day1 to be booked on Day1: 7 Priority1 remaning patients arrived day Day1 to be booked on Day2: 5 Priority1 remaning patients arrived day Day1 to be booked on Day3: 2 Priority1 remaning patients arrived day Day2 to be booked on Day1: 7 Priority1 remaning patients arrived day Day2 to be booked on Day2: 7 Priority1 remaning patients arrived day Day2 to be booked on Day3: 4 Priority1 remaning patients arrived day Day3 to be booked on Day1: 4 Priority1 remaning patients arrived day Day3 to be booked on Day2: 4 Priority1 remaning patients arrived day Day3 to be booked on Day3: 4 Priority1 remaning patients arrived day Day4 to be booked on Day1: 6 Priority1 remaning patients arrived day Day4 to be booked on Day2: 6 Priority1 remaning patients arrived day Day4 to be booked on Day3: 6 Priority1 remaning patients arrived day Day4 to be booked on Day4: 6 Priority1 remaning patients arrived day Day4 to be booked on Day5: 5 Priority1 remaning patients arrived day Day4 to be booked on Day6: 4 Priority1 remaning patients arrived day Day5 to be booked on Day1: 3 Priority1 remaning patients arrived day Day5 to be booked on Day2: 3 Priority1 remaning patients arrived day Day5 to be booked on Day3: 3 Priority1 remaning patients arrived day Day5 to be booked on Day4: 3 Priority1 remaning patients arrived day Day5 to be booked on Day5: 3 Priority1 remaning patients arrived day Day5 to be booked on Day6: 2 Priority1 remaning patients arrived day Day6 to be booked on Day1: 3 Priority1 remaning patients arrived day Day6 to be booked on Day2: 3 Priority1 remaning patients arrived day Day6 to be booked on Day3: 3 Priority1 remaning patients arrived day Day6 to be booked on Day4: 3 Priority1 remaning patients arrived day Day6 to be booked on Day5: 3 Priority1 remaning patients arrived day Day6 to be booked on Day6: 3 Priority2 remaning patients arrived day Day1 to be booked on Day3: 7 Priority2 remaning patients arrived day Day1 to be booked on Day4: 8 Priority2 remaning patients arrived day Day1 to be booked on Day5: 9 Priority2 remaning patients arrived day Day1 to be booked on Day6: 9 Priority2 remaning patients arrived day Day1 to be booked on Day7: 9 Priority2 remaning patients arrived day Day1 to be booked on Day8: 9 Priority2 remaning patients arrived day Day1 to be booked on Day9: 9 Priority2 remaning patients arrived day Day1 to be booked on Day10: 9 Priority2 remaning patients arrived day Day1 to be booked on Day11: 9 Priority2 remaning patients arrived day Day1 to be booked on Day12: 9 Priority2 remaning patients arrived day Day1 to be booked on Day13: 9 Priority2 remaning patients arrived day Day1 to be booked on Day14: 9 Priority2 remaning patients arrived day Day1 to be booked on Day15: 9 Priority2 remaning patients arrived day Day1 to be booked on Day16: 9 Priority2 remaning patients arrived day Day1 to be booked on Day17: 9 Priority2 remaning patients arrived day Day1 to be booked on Day18: 9 Priority2 remaning patients arrived day Day1 to be booked on Day19: 9 Priority2 remaning patients arrived day Day1 to be booked on Day20: 9 Priority2 remaning patients arrived day Day2 to be booked on Day6: 1 Priority2 remaning patients arrived day Day2 to be booked on Day7: 1 Priority2 remaning patients arrived day Day2 to be booked on Day8: 1 Priority2 remaning patients arrived day Day2 to be booked on Day9: 1 Priority2 remaning patients arrived day Day2 to be booked on Day10: 1 Priority2 remaning patients arrived day Day2 to be booked on Day11: 1 Priority2 remaning patients arrived day Day2 to be booked on Day12: 1 Priority2 remaning patients arrived day Day2 to be booked on Day13: 1 Priority2 remaning patients arrived day Day2 to be booked on Day14: 1 Priority2 remaning patients arrived day Day2 to be booked on Day15: 1 Priority2 remaning patients arrived day Day2 to be booked on Day16: 1 Priority2 remaning patients arrived day Day2 to be booked on Day17: 1 Priority2 remaning patients arrived day Day2 to be booked on Day18: 1 Priority2 remaning patients arrived day Day2 to be booked on Day19: 1 Priority2 remaning patients arrived day Day2 to be booked on Day20: 1 Priority2 remaning patients arrived day Day3 to be booked on Day6: 1 Priority2 remaning patients arrived day Day3 to be booked on Day7: 1 Priority2 remaning patients arrived day Day3 to be booked on Day8: 1 Priority2 remaning patients arrived day Day3 to be booked on Day9: 1 Priority2 remaning patients arrived day Day3 to be booked on Day10: 1 Priority2 remaning patients arrived day Day3 to be booked on Day11: 1 Priority2 remaning patients arrived day Day3 to be booked on Day12: 1 Priority2 remaning patients arrived day Day3 to be booked on Day13: 1 Priority2 remaning patients arrived day Day3 to be booked on Day14: 1 Priority2 remaning patients arrived day Day3 to be booked on Day15: 1 Priority2 remaning patients arrived day Day3 to be booked on Day16: 1 Priority2 remaning patients arrived day Day3 to be booked on Day17: 1 Priority2 remaning patients arrived day Day3 to be booked on Day18: 1 Priority2 remaning patients arrived day Day3 to be booked on Day19: 1 Priority2 remaning patients arrived day Day3 to be booked on Day20: 1 Priority2 remaning patients arrived day Day5 to be booked on Day6: 4 Priority2 remaning patients arrived day Day5 to be booked on Day7: 4 Priority2 remaning patients arrived day Day5 to be booked on Day8: 4 Priority2 remaning patients arrived day Day5 to be booked on Day9: 5 Priority2 remaning patients arrived day Day5 to be booked on Day10: 5 Priority2 remaning patients arrived day Day5 to be booked on Day11: 5 Priority2 remaning patients arrived day Day5 to be booked on Day12: 5 Priority2 remaning patients arrived day Day5 to be booked on Day13: 5 Priority2 remaning patients arrived day Day5 to be booked on Day14: 5 Priority2 remaning patients arrived day Day5 to be booked on Day15: 5 Priority2 remaning patients arrived day Day5 to be booked on Day16: 5 Priority2 remaning patients arrived day Day5 to be booked on Day17: 5 Priority2 remaning patients arrived day Day5 to be booked on Day18: 5 Priority2 remaning patients arrived day Day5 to be booked on Day19: 5 Priority2 remaning patients arrived day Day5 to be booked on Day20: 5 Priority2 remaning patients arrived day Day6 to be booked on Day10: 2 Priority2 remaning patients arrived day Day6 to be booked on Day11: 2 Priority2 remaning patients arrived day Day6 to be booked on Day12: 2 Priority2 remaning patients arrived day Day6 to be booked on Day13: 2 Priority2 remaning patients arrived day Day6 to be booked on Day14: 2 Priority2 remaning patients arrived day Day6 to be booked on Day15: 2 Priority2 remaning patients arrived day Day6 to be booked on Day16: 2 Priority2 remaning patients arrived day Day6 to be booked on Day17: 2 Priority2 remaning patients arrived day Day6 to be booked on Day18: 2 Priority2 remaning patients arrived day Day6 to be booked on Day19: 2 Priority2 remaning patients arrived day Day6 to be booked on Day20: 2 Priority3 remaning patients arrived day Day1 to be booked on Day7: 1 Priority3 remaning patients arrived day Day1 to be booked on Day8: 1 Priority3 remaning patients arrived day Day1 to be booked on Day9: 1 Priority3 remaning patients arrived day Day1 to be booked on Day10: 1 Priority3 remaning patients arrived day Day1 to be booked on Day11: 1 Priority3 remaning patients arrived day Day1 to be booked on Day12: 1 Priority3 remaning patients arrived day Day1 to be booked on Day13: 1 Priority3 remaning patients arrived day Day1 to be booked on Day14: 1 Priority3 remaning patients arrived day Day1 to be booked on Day15: 1 Priority3 remaning patients arrived day Day1 to be booked on Day16: 1 Priority3 remaning patients arrived day Day1 to be booked on Day17: 1 Priority3 remaning patients arrived day Day1 to be booked on Day18: 1 Priority3 remaning patients arrived day Day1 to be booked on Day19: 1 Priority3 remaning patients arrived day Day1 to be booked on Day20: 1 Priority3 remaning patients arrived day Day2 to be booked on Day6: 3 Priority3 remaning patients arrived day Day2 to be booked on Day7: 4 Priority3 remaning patients arrived day Day2 to be booked on Day8: 6 Priority3 remaning patients arrived day Day2 to be booked on Day9: 6 Priority3 remaning patients arrived day Day2 to be booked on Day10: 6 Priority3 remaning patients arrived day Day2 to be booked on Day11: 6 Priority3 remaning patients arrived day Day2 to be booked on Day12: 6 Priority3 remaning patients arrived day Day2 to be booked on Day13: 6 Priority3 remaning patients arrived day Day2 to be booked on Day14: 6 Priority3 remaning patients arrived day Day2 to be booked on Day15: 6 Priority3 remaning patients arrived day Day2 to be booked on Day16: 6 Priority3 remaning patients arrived day Day2 to be booked on Day17: 6 Priority3 remaning patients arrived day Day2 to be booked on Day18: 6 Priority3 remaning patients arrived day Day2 to be booked on Day19: 6 Priority3 remaning patients arrived day Day2 to be booked on Day20: 6 Priority3 remaning patients arrived day Day3 to be booked on Day9: 4 Priority3 remaning patients arrived day Day3 to be booked on Day10: 4 Priority3 remaning patients arrived day Day3 to be booked on Day11: 4 Priority3 remaning patients arrived day Day3 to be booked on Day12: 4 Priority3 remaning patients arrived day Day3 to be booked on Day13: 4 Priority3 remaning patients arrived day Day3 to be booked on Day14: 4 Priority3 remaning patients arrived day Day3 to be booked on Day15: 4 Priority3 remaning patients arrived day Day3 to be booked on Day16: 4 Priority3 remaning patients arrived day Day3 to be booked on Day17: 4 Priority3 remaning patients arrived day Day3 to be booked on Day18: 4 Priority3 remaning patients arrived day Day3 to be booked on Day19: 4 Priority3 remaning patients arrived day Day3 to be booked on Day20: 4 Priority3 remaning patients arrived day Day4 to be booked on Day10: 2 Priority3 remaning patients arrived day Day4 to be booked on Day11: 2 Priority3 remaning patients arrived day Day4 to be booked on Day12: 2 Priority3 remaning patients arrived day Day4 to be booked on Day13: 2 Priority3 remaning patients arrived day Day4 to be booked on Day14: 2 Priority3 remaning patients arrived day Day4 to be booked on Day15: 2 Priority3 remaning patients arrived day Day4 to be booked on Day16: 2 Priority3 remaning patients arrived day Day4 to be booked on Day17: 2 Priority3 remaning patients arrived day Day4 to be booked on Day18: 2 Priority3 remaning patients arrived day Day4 to be booked on Day19: 2 Priority3 remaning patients arrived day Day4 to be booked on Day20: 2 Priority3 remaning patients arrived day Day5 to be booked on Day11: 3 Priority3 remaning patients arrived day Day5 to be booked on Day12: 3 Priority3 remaning patients arrived day Day5 to be booked on Day13: 3 Priority3 remaning patients arrived day Day5 to be booked on Day14: 3 Priority3 remaning patients arrived day Day5 to be booked on Day15: 3 Priority3 remaning patients arrived day Day5 to be booked on Day16: 3 Priority3 remaning patients arrived day Day5 to be booked on Day17: 3 Priority3 remaning patients arrived day Day5 to be booked on Day18: 3 Priority3 remaning patients arrived day Day5 to be booked on Day19: 3 Priority3 remaning patients arrived day Day5 to be booked on Day20: 3 Priority3 remaning patients arrived day Day6 to be booked on Day11: 3 Priority3 remaning patients arrived day Day6 to be booked on Day12: 7 Priority3 remaning patients arrived day Day6 to be booked on Day13: 7 Priority3 remaning patients arrived day Day6 to be booked on Day14: 7 Priority3 remaning patients arrived day Day6 to be booked on Day15: 7 Priority3 remaning patients arrived day Day6 to be booked on Day16: 7 Priority3 remaning patients arrived day Day6 to be booked on Day17: 7 Priority3 remaning patients arrived day Day6 to be booked on Day18: 7 Priority3 remaning patients arrived day Day6 to be booked on Day19: 7 Priority3 remaning patients arrived day Day6 to be booked on Day20: 7 Binary Variable for Priority1 arrived on Day1 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day2 to be booked on day Day3: 1 Binary Variable for Priority1 arrived on Day3 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day3 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day3 to be booked on day Day3: 1 Binary Variable for Priority1 arrived on Day4 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day4 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day4 to be booked on day Day3: 1 Binary Variable for Priority1 arrived on Day4 to be booked on day Day4: 1 Binary Variable for Priority1 arrived on Day4 to be booked on day Day5: 1 Binary Variable for Priority1 arrived on Day4 to be booked on day Day6: 1 Binary Variable for Priority1 arrived on Day5 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day5 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day5 to be booked on day Day3: 1 Binary Variable for Priority1 arrived on Day5 to be booked on day Day4: 1 Binary Variable for Priority1 arrived on Day5 to be booked on day Day5: 1 Binary Variable for Priority1 arrived on Day5 to be booked on day Day6: 1 Binary Variable for Priority1 arrived on Day6 to be booked on day Day1: 1 Binary Variable for Priority1 arrived on Day6 to be booked on day Day2: 1 Binary Variable for Priority1 arrived on Day6 to be booked on day Day3: 1 Binary Variable for Priority1 arrived on Day6 to be booked on day Day4: 1 Binary Variable for Priority1 arrived on Day6 to be booked on day Day5: 1 Binary Variable for Priority1 arrived on Day6 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day3: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day4: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day5: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day11: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day12: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day13: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day14: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day15: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day16: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day17: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day18: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day19: 1 Binary Variable for Priority2 arrived on Day1 to be booked on day Day20: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day11: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day12: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day13: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day14: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day15: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day16: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day17: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day18: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day19: 1 Binary Variable for Priority2 arrived on Day2 to be booked on day Day20: 1 Binary Variable for Priority2 arrived on Day3 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day3 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day3 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day3 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day3 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day3 to be booked on day Day11: 1 Binary Variable for Priority2 arrived on Day3 to be booked on day Day12: 1 Binary Variable for Priority2 arrived on Day3 to be booked on day Day13: 1 Binary Variable for Priority2 arrived on Day3 to be booked on day Day14: 1 Binary Variable for Priority2 arrived on Day3 to be booked on day Day15: 1 Binary Variable for Priority2 arrived on Day3 to be booked on day Day16: 1 Binary Variable for Priority2 arrived on Day3 to be booked on day Day17: 1 Binary Variable for Priority2 arrived on Day3 to be booked on day Day18: 1 Binary Variable for Priority2 arrived on Day3 to be booked on day Day19: 1 Binary Variable for Priority2 arrived on Day3 to be booked on day Day20: 1 Binary Variable for Priority2 arrived on Day5 to be booked on day Day6: 1 Binary Variable for Priority2 arrived on Day5 to be booked on day Day7: 1 Binary Variable for Priority2 arrived on Day5 to be booked on day Day8: 1 Binary Variable for Priority2 arrived on Day5 to be booked on day Day9: 1 Binary Variable for Priority2 arrived on Day5 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day5 to be booked on day Day11: 1 Binary Variable for Priority2 arrived on Day5 to be booked on day Day12: 1 Binary Variable for Priority2 arrived on Day5 to be booked on day Day13: 1 Binary Variable for Priority2 arrived on Day5 to be booked on day Day14: 1 Binary Variable for Priority2 arrived on Day5 to be booked on day Day15: 1 Binary Variable for Priority2 arrived on Day5 to be booked on day Day16: 1 Binary Variable for Priority2 arrived on Day5 to be booked on day Day17: 1 Binary Variable for Priority2 arrived on Day5 to be booked on day Day18: 1 Binary Variable for Priority2 arrived on Day5 to be booked on day Day19: 1 Binary Variable for Priority2 arrived on Day5 to be booked on day Day20: 1 Binary Variable for Priority2 arrived on Day6 to be booked on day Day10: 1 Binary Variable for Priority2 arrived on Day6 to be booked on day Day11: 1 Binary Variable for Priority2 arrived on Day6 to be booked on day Day12: 1 Binary Variable for Priority2 arrived on Day6 to be booked on day Day13: 1 Binary Variable for Priority2 arrived on Day6 to be booked on day Day14: 1 Binary Variable for Priority2 arrived on Day6 to be booked on day Day15: 1 Binary Variable for Priority2 arrived on Day6 to be booked on day Day16: 1 Binary Variable for Priority2 arrived on Day6 to be booked on day Day17: 1 Binary Variable for Priority2 arrived on Day6 to be booked on day Day18: 1 Binary Variable for Priority2 arrived on Day6 to be booked on day Day19: 1 Binary Variable for Priority2 arrived on Day6 to be booked on day Day20: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day11: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day12: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day13: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day14: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day15: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day16: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day17: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day18: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day19: 1 Binary Variable for Priority3 arrived on Day1 to be booked on day Day20: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day6: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day7: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day8: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day11: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day12: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day13: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day14: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day15: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day16: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day17: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day18: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day19: 1 Binary Variable for Priority3 arrived on Day2 to be booked on day Day20: 1 Binary Variable for Priority3 arrived on Day3 to be booked on day Day9: 1 Binary Variable for Priority3 arrived on Day3 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day3 to be booked on day Day11: 1 Binary Variable for Priority3 arrived on Day3 to be booked on day Day12: 1 Binary Variable for Priority3 arrived on Day3 to be booked on day Day13: 1 Binary Variable for Priority3 arrived on Day3 to be booked on day Day14: 1 Binary Variable for Priority3 arrived on Day3 to be booked on day Day15: 1 Binary Variable for Priority3 arrived on Day3 to be booked on day Day16: 1 Binary Variable for Priority3 arrived on Day3 to be booked on day Day17: 1 Binary Variable for Priority3 arrived on Day3 to be booked on day Day18: 1 Binary Variable for Priority3 arrived on Day3 to be booked on day Day19: 1 Binary Variable for Priority3 arrived on Day3 to be booked on day Day20: 1 Binary Variable for Priority3 arrived on Day4 to be booked on day Day10: 1 Binary Variable for Priority3 arrived on Day4 to be booked on day Day11: 1 Binary Variable for Priority3 arrived on Day4 to be booked on day Day12: 1 Binary Variable for Priority3 arrived on Day4 to be booked on day Day13: 1 Binary Variable for Priority3 arrived on Day4 to be booked on day Day14: 1 Binary Variable for Priority3 arrived on Day4 to be booked on day Day15: 1 Binary Variable for Priority3 arrived on Day4 to be booked on day Day16: 1 Binary Variable for Priority3 arrived on Day4 to be booked on day Day17: 1 Binary Variable for Priority3 arrived on Day4 to be booked on day Day18: 1 Binary Variable for Priority3 arrived on Day4 to be booked on day Day19: 1 Binary Variable for Priority3 arrived on Day4 to be booked on day Day20: 1 Binary Variable for Priority3 arrived on Day5 to be booked on day Day11: 1 Binary Variable for Priority3 arrived on Day5 to be booked on day Day12: 1 Binary Variable for Priority3 arrived on Day5 to be booked on day Day13: 1 Binary Variable for Priority3 arrived on Day5 to be booked on day Day14: 1 Binary Variable for Priority3 arrived on Day5 to be booked on day Day15: 1 Binary Variable for Priority3 arrived on Day5 to be booked on day Day16: 1 Binary Variable for Priority3 arrived on Day5 to be booked on day Day17: 1 Binary Variable for Priority3 arrived on Day5 to be booked on day Day18: 1 Binary Variable for Priority3 arrived on Day5 to be booked on day Day19: 1 Binary Variable for Priority3 arrived on Day5 to be booked on day Day20: 1 Binary Variable for Priority3 arrived on Day6 to be booked on day Day11: 1 Binary Variable for Priority3 arrived on Day6 to be booked on day Day12: 1 Binary Variable for Priority3 arrived on Day6 to be booked on day Day13: 1 Binary Variable for Priority3 arrived on Day6 to be booked on day Day14: 1 Binary Variable for Priority3 arrived on Day6 to be booked on day Day15: 1 Binary Variable for Priority3 arrived on Day6 to be booked on day Day16: 1 Binary Variable for Priority3 arrived on Day6 to be booked on day Day17: 1 Binary Variable for Priority3 arrived on Day6 to be booked on day Day18: 1 Binary Variable for Priority3 arrived on Day6 to be booked on day Day19: 1 Binary Variable for Priority3 arrived on Day6 to be booked on day Day20: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1279 rows and 651 columns Presolve time: 0.07s Presolved: 659 rows, 447 columns, 8162 nonzeros Variable types: 0 continuous, 447 integer (194 binary) Root relaxation: objective 3.215000e+03, 250 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3215.00000 0 2 7500.00000 3215.00000 57.1% - 0s H 0 0 3315.0000000 3215.00000 3.02% - 0s H 0 0 3310.0000000 3215.00000 2.87% - 0s 0 0 3218.75000 0 15 3310.00000 3218.75000 2.76% - 0s H 0 0 3245.0000000 3218.75000 0.81% - 0s * 0 0 0 3240.0000000 3240.00000 0.00% - 0s Cutting planes: Flow cover: 5 Explored 0 nodes (321 simplex iterations) in 0.13 seconds Thread count was 4 (of 4 available processors) Solution count 5: 3240 3245 3310 ... 7500 Pool objective bound 3240 Optimal solution found (tolerance 1.00e-04) Best objective 3.240000000000e+03, best bound 3.240000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day2--Day2 7 Priority1--Day3--Day3 4 Priority2--Day1--Day1 9 Priority2--Day3--Day3 1 Priority3--Day1--Day1 1 Priority3--Day2--Day2 5 Priority1-Day1-Day1 7 Priority1-Day4-Day4 6 Priority1-Day5-Day5 3 Priority1-Day6-Day6 3 Priority2-Day2-Day2 1 Priority2-Day3-Day3 4 Priority2-Day5-Day5 2 Priority2-Day5-Day6 2 Priority2-Day5-Day7 1 Priority2-Day6-Day6 1 Priority2-Day6-Day10 1 Priority3-Day2-Day8 1 Priority3-Day3-Day7 1 Priority3-Day3-Day8 1 Priority3-Day3-Day9 2 Priority3-Day4-Day4 1 Priority3-Day4-Day10 1 Priority3-Day5-Day11 3 Priority3-Day6-Day11 1 Priority3-Day6-Day12 6 Priority1-Day1-Day1: 7 Priority1-Day2-Day1: 7 Priority1-Day2-Day2: 7 Priority1-Day2-Day3: 6 Priority1-Day2-Day4: 2 Priority1-Day3-Day1: 4 Priority1-Day3-Day2: 4 Priority1-Day3-Day3: 4 Priority1-Day4-Day1: 6 Priority1-Day4-Day2: 6 Priority1-Day4-Day3: 6 Priority1-Day4-Day4: 6 Priority1-Day5-Day1: 3 Priority1-Day5-Day2: 3 Priority1-Day5-Day3: 3 Priority1-Day5-Day4: 3 Priority1-Day5-Day5: 3 Priority1-Day6-Day1: 3 Priority1-Day6-Day2: 3 Priority1-Day6-Day3: 3 Priority1-Day6-Day4: 3 Priority1-Day6-Day5: 3 Priority1-Day6-Day6: 3 Priority2-Day1-Day4: 4 Priority2-Day1-Day5: 9 Priority2-Day1-Day6: 9 Priority2-Day1-Day7: 9 Priority2-Day1-Day8: 9 Priority2-Day1-Day9: 9 Priority2-Day1-Day10: 9 Priority2-Day1-Day11: 9 Priority2-Day1-Day12: 9 Priority2-Day1-Day13: 9 Priority2-Day1-Day14: 9 Priority2-Day1-Day15: 9 Priority2-Day1-Day16: 9 Priority2-Day1-Day17: 9 Priority2-Day1-Day18: 9 Priority2-Day1-Day19: 9 Priority2-Day1-Day20: 9 Priority2-Day3-Day7: 1 Priority2-Day3-Day8: 1 Priority2-Day3-Day9: 1 Priority2-Day3-Day10: 1 Priority2-Day3-Day11: 1 Priority2-Day3-Day12: 1 Priority2-Day3-Day13: 1 Priority2-Day3-Day14: 1 Priority2-Day3-Day15: 1 Priority2-Day3-Day16: 1 Priority2-Day3-Day17: 1 Priority2-Day3-Day18: 1 Priority2-Day3-Day19: 1 Priority2-Day3-Day20: 1 Priority2-Day5-Day6: 2 Priority2-Day5-Day7: 3 Priority2-Day5-Day8: 3 Priority2-Day5-Day9: 3 Priority2-Day5-Day10: 3 Priority2-Day5-Day11: 3 Priority2-Day5-Day12: 3 Priority2-Day5-Day13: 3 Priority2-Day5-Day14: 3 Priority2-Day5-Day15: 3 Priority2-Day5-Day16: 3 Priority2-Day5-Day17: 3 Priority2-Day5-Day18: 3 Priority2-Day5-Day19: 3 Priority2-Day5-Day20: 3 Priority2-Day6-Day10: 1 Priority2-Day6-Day11: 1 Priority2-Day6-Day12: 1 Priority2-Day6-Day13: 1 Priority2-Day6-Day14: 1 Priority2-Day6-Day15: 1 Priority2-Day6-Day16: 1 Priority2-Day6-Day17: 1 Priority2-Day6-Day18: 1 Priority2-Day6-Day19: 1 Priority2-Day6-Day20: 1 Priority3-Day1-Day7: 1 Priority3-Day1-Day8: 1 Priority3-Day1-Day9: 1 Priority3-Day1-Day10: 1 Priority3-Day1-Day11: 1 Priority3-Day1-Day12: 1 Priority3-Day1-Day13: 1 Priority3-Day1-Day14: 1 Priority3-Day1-Day15: 1 Priority3-Day1-Day16: 1 Priority3-Day1-Day17: 1 Priority3-Day1-Day18: 1 Priority3-Day1-Day19: 1 Priority3-Day1-Day20: 1 Priority3-Day2-Day6: 2 Priority3-Day2-Day7: 4 Priority3-Day2-Day8: 6 Priority3-Day2-Day9: 6 Priority3-Day2-Day10: 6 Priority3-Day2-Day11: 6 Priority3-Day2-Day12: 6 Priority3-Day2-Day13: 6 Priority3-Day2-Day14: 6 Priority3-Day2-Day15: 6 Priority3-Day2-Day16: 6 Priority3-Day2-Day17: 6 Priority3-Day2-Day18: 6 Priority3-Day2-Day19: 6 Priority3-Day2-Day20: 6 Priority3-Day3-Day7: 1 Priority3-Day3-Day8: 2 Priority3-Day3-Day9: 4 Priority3-Day3-Day10: 4 Priority3-Day3-Day11: 4 Priority3-Day3-Day12: 4 Priority3-Day3-Day13: 4 Priority3-Day3-Day14: 4 Priority3-Day3-Day15: 4 Priority3-Day3-Day16: 4 Priority3-Day3-Day17: 4 Priority3-Day3-Day18: 4 Priority3-Day3-Day19: 4 Priority3-Day3-Day20: 4 Priority3-Day4-Day10: 1 Priority3-Day4-Day11: 1 Priority3-Day4-Day12: 1 Priority3-Day4-Day13: 1 Priority3-Day4-Day14: 1 Priority3-Day4-Day15: 1 Priority3-Day4-Day16: 1 Priority3-Day4-Day17: 1 Priority3-Day4-Day18: 1 Priority3-Day4-Day19: 1 Priority3-Day4-Day20: 1 Priority3-Day5-Day11: 3 Priority3-Day5-Day12: 3 Priority3-Day5-Day13: 3 Priority3-Day5-Day14: 3 Priority3-Day5-Day15: 3 Priority3-Day5-Day16: 3 Priority3-Day5-Day17: 3 Priority3-Day5-Day18: 3 Priority3-Day5-Day19: 3 Priority3-Day5-Day20: 3 Priority3-Day6-Day11: 1 Priority3-Day6-Day12: 7 Priority3-Day6-Day13: 7 Priority3-Day6-Day14: 7 Priority3-Day6-Day15: 7 Priority3-Day6-Day16: 7 Priority3-Day6-Day17: 7 Priority3-Day6-Day18: 7 Priority3-Day6-Day19: 7 Priority3-Day6-Day20: 7 Priority1-Day1-Day1: 1 Priority1-Day1-Day2: 1 Priority1-Day2-Day1: 1 Priority1-Day2-Day2: 1 Priority1-Day2-Day3: 1 Priority1-Day2-Day4: 1 Priority1-Day3-Day1: 1 Priority1-Day3-Day2: 1 Priority1-Day3-Day3: 1 Priority1-Day4-Day1: 1 Priority1-Day4-Day2: 1 Priority1-Day4-Day3: 1 Priority1-Day4-Day4: 1 Priority1-Day5-Day1: 1 Priority1-Day5-Day2: 1 Priority1-Day5-Day3: 1 Priority1-Day5-Day4: 1 Priority1-Day5-Day5: 1 Priority1-Day6-Day1: 1 Priority1-Day6-Day2: 1 Priority1-Day6-Day3: 1 Priority1-Day6-Day4: 1 Priority1-Day6-Day5: 1 Priority1-Day6-Day6: 1 Priority2-Day1-Day4: 1 Priority2-Day1-Day5: 1 Priority2-Day1-Day6: 1 Priority2-Day1-Day7: 1 Priority2-Day1-Day8: 1 Priority2-Day1-Day9: 1 Priority2-Day1-Day10: 1 Priority2-Day1-Day11: 1 Priority2-Day1-Day12: 1 Priority2-Day1-Day13: 1 Priority2-Day1-Day14: 1 Priority2-Day1-Day15: 1 Priority2-Day1-Day16: 1 Priority2-Day1-Day17: 1 Priority2-Day1-Day18: 1 Priority2-Day1-Day19: 1 Priority2-Day1-Day20: 1 Priority2-Day2-Day7: 1 Priority2-Day2-Day8: 1 Priority2-Day2-Day9: 1 Priority2-Day2-Day10: 1 Priority2-Day2-Day11: 1 Priority2-Day2-Day12: 1 Priority2-Day2-Day13: 1 Priority2-Day2-Day14: 1 Priority2-Day2-Day15: 1 Priority2-Day2-Day16: 1 Priority2-Day2-Day17: 1 Priority2-Day2-Day18: 1 Priority2-Day2-Day19: 1 Priority2-Day2-Day20: 1 Priority2-Day3-Day7: 1 Priority2-Day3-Day8: 1 Priority2-Day3-Day9: 1 Priority2-Day3-Day10: 1 Priority2-Day3-Day11: 1 Priority2-Day3-Day12: 1 Priority2-Day3-Day13: 1 Priority2-Day3-Day14: 1 Priority2-Day3-Day15: 1 Priority2-Day3-Day16: 1 Priority2-Day3-Day17: 1 Priority2-Day3-Day18: 1 Priority2-Day3-Day19: 1 Priority2-Day3-Day20: 1 Priority2-Day5-Day6: 1 Priority2-Day5-Day7: 1 Priority2-Day5-Day8: 1 Priority2-Day5-Day9: 1 Priority2-Day5-Day10: 1 Priority2-Day5-Day11: 1 Priority2-Day5-Day12: 1 Priority2-Day5-Day13: 1 Priority2-Day5-Day14: 1 Priority2-Day5-Day15: 1 Priority2-Day5-Day16: 1 Priority2-Day5-Day17: 1 Priority2-Day5-Day18: 1 Priority2-Day5-Day19: 1 Priority2-Day5-Day20: 1 Priority2-Day6-Day10: 1 Priority2-Day6-Day11: 1 Priority2-Day6-Day12: 1 Priority2-Day6-Day13: 1 Priority2-Day6-Day14: 1 Priority2-Day6-Day15: 1 Priority2-Day6-Day16: 1 Priority2-Day6-Day17: 1 Priority2-Day6-Day18: 1 Priority2-Day6-Day19: 1 Priority2-Day6-Day20: 1 Priority3-Day1-Day7: 1 Priority3-Day1-Day8: 1 Priority3-Day1-Day9: 1 Priority3-Day1-Day10: 1 Priority3-Day1-Day11: 1 Priority3-Day1-Day12: 1 Priority3-Day1-Day13: 1 Priority3-Day1-Day14: 1 Priority3-Day1-Day15: 1 Priority3-Day1-Day16: 1 Priority3-Day1-Day17: 1 Priority3-Day1-Day18: 1 Priority3-Day1-Day19: 1 Priority3-Day1-Day20: 1 Priority3-Day2-Day6: 1 Priority3-Day2-Day7: 1 Priority3-Day2-Day8: 1 Priority3-Day2-Day9: 1 Priority3-Day2-Day10: 1 Priority3-Day2-Day11: 1 Priority3-Day2-Day12: 1 Priority3-Day2-Day13: 1 Priority3-Day2-Day14: 1 Priority3-Day2-Day15: 1 Priority3-Day2-Day16: 1 Priority3-Day2-Day17: 1 Priority3-Day2-Day18: 1 Priority3-Day2-Day19: 1 Priority3-Day2-Day20: 1 Priority3-Day3-Day7: 1 Priority3-Day3-Day8: 1 Priority3-Day3-Day9: 1 Priority3-Day3-Day10: 1 Priority3-Day3-Day11: 1 Priority3-Day3-Day12: 1 Priority3-Day3-Day13: 1 Priority3-Day3-Day14: 1 Priority3-Day3-Day15: 1 Priority3-Day3-Day16: 1 Priority3-Day3-Day17: 1 Priority3-Day3-Day18: 1 Priority3-Day3-Day19: 1 Priority3-Day3-Day20: 1 Priority3-Day4-Day10: 1 Priority3-Day4-Day11: 1 Priority3-Day4-Day12: 1 Priority3-Day4-Day13: 1 Priority3-Day4-Day14: 1 Priority3-Day4-Day15: 1 Priority3-Day4-Day16: 1 Priority3-Day4-Day17: 1 Priority3-Day4-Day18: 1 Priority3-Day4-Day19: 1 Priority3-Day4-Day20: 1 Priority3-Day5-Day11: 1 Priority3-Day5-Day12: 1 Priority3-Day5-Day13: 1 Priority3-Day5-Day14: 1 Priority3-Day5-Day15: 1 Priority3-Day5-Day16: 1 Priority3-Day5-Day17: 1 Priority3-Day5-Day18: 1 Priority3-Day5-Day19: 1 Priority3-Day5-Day20: 1 Priority3-Day6-Day11: 1 Priority3-Day6-Day12: 1 Priority3-Day6-Day13: 1 Priority3-Day6-Day14: 1 Priority3-Day6-Day15: 1 Priority3-Day6-Day16: 1 Priority3-Day6-Day17: 1 Priority3-Day6-Day18: 1 Priority3-Day6-Day19: 1 Priority3-Day6-Day20: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1350 rows and 691 columns Presolve time: 0.05s Presolved: 588 rows, 407 columns, 7358 nonzeros Variable types: 0 continuous, 407 integer (192 binary) Root relaxation: objective 4.415000e+03, 276 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 4415.00000 0 2 7500.00000 4415.00000 41.1% - 0s H 0 0 4435.0000000 4415.00000 0.45% - 0s H 0 0 4425.0000000 4415.00000 0.23% - 0s 0 0 4415.04329 0 23 4425.00000 4415.04329 0.23% - 0s Cutting planes: Flow cover: 1 Explored 0 nodes (350 simplex iterations) in 0.11 seconds Thread count was 4 (of 4 available processors) Solution count 3: 4425 4435 7500 Pool objective bound 4425 Optimal solution found (tolerance 1.00e-04) Best objective 4.425000000000e+03, best bound 4.425000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day1--Day1(y) 1 Priority1--Day2--Day2(y) 6 Priority1--Day4--Day4(y) 3 Priority1--Day5--Day5(y) 2 Priority2--Day1--Day1(y) 9 Priority2--Day2--Day2(y) 1 Priority2--Day3--Day3(y) 4 Priority2--Day5--Day5(y) 4 Priority2--Day6--Day6(y) 1 Priority3--Day1--Day1(y) 1 Priority3--Day2--Day2(y) 6 Priority3--Day3--Day3(y) 3 Priority1-Day1-Day1(x) 6 Priority1-Day2-Day2(x) 1 Priority1-Day3-Day3(x) 4 Priority1-Day4-Day4(x) 3 Priority1-Day5-Day5(x) 1 Priority1-Day6-Day6(x) 3 Priority2-Day3-Day3(x) 1 Priority2-Day5-Day7(x) 1 Priority2-Day6-Day6(x) 1 Priority3-Day3-Day9(x) 1 Priority3-Day4-Day10(x) 2 Priority3-Day5-Day11(x) 3 Priority3-Day6-Day7(x) 2 Priority3-Day6-Day8(x) 1 Priority3-Day6-Day9(x) 1 Priority3-Day6-Day12(x) 3 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 1 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 6 Priority1-Day2-Day4(r) 1 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 3 Priority1-Day4-Day6(r) 2 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day5-Day6(r) 2 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day3(r) 5 Priority2-Day1-Day4(r) 8 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day2-Day6(r) 1 Priority2-Day2-Day7(r) 1 Priority2-Day2-Day8(r) 1 Priority2-Day2-Day9(r) 1 Priority2-Day2-Day10(r) 1 Priority2-Day2-Day11(r) 1 Priority2-Day2-Day12(r) 1 Priority2-Day2-Day13(r) 1 Priority2-Day2-Day14(r) 1 Priority2-Day2-Day15(r) 1 Priority2-Day2-Day16(r) 1 Priority2-Day2-Day17(r) 1 Priority2-Day2-Day18(r) 1 Priority2-Day2-Day19(r) 1 Priority2-Day2-Day20(r) 1 Priority2-Day3-Day6(r) 1 Priority2-Day3-Day7(r) 4 Priority2-Day3-Day8(r) 4 Priority2-Day3-Day9(r) 4 Priority2-Day3-Day10(r) 4 Priority2-Day3-Day11(r) 4 Priority2-Day3-Day12(r) 4 Priority2-Day3-Day13(r) 4 Priority2-Day3-Day14(r) 4 Priority2-Day3-Day15(r) 4 Priority2-Day3-Day16(r) 4 Priority2-Day3-Day17(r) 4 Priority2-Day3-Day18(r) 4 Priority2-Day3-Day19(r) 4 Priority2-Day3-Day20(r) 4 Priority2-Day5-Day7(r) 3 Priority2-Day5-Day8(r) 4 Priority2-Day5-Day9(r) 5 Priority2-Day5-Day10(r) 5 Priority2-Day5-Day11(r) 5 Priority2-Day5-Day12(r) 5 Priority2-Day5-Day13(r) 5 Priority2-Day5-Day14(r) 5 Priority2-Day5-Day15(r) 5 Priority2-Day5-Day16(r) 5 Priority2-Day5-Day17(r) 5 Priority2-Day5-Day18(r) 5 Priority2-Day5-Day19(r) 5 Priority2-Day5-Day20(r) 5 Priority2-Day6-Day9(r) 1 Priority2-Day6-Day10(r) 1 Priority2-Day6-Day11(r) 1 Priority2-Day6-Day12(r) 1 Priority2-Day6-Day13(r) 1 Priority2-Day6-Day14(r) 1 Priority2-Day6-Day15(r) 1 Priority2-Day6-Day16(r) 1 Priority2-Day6-Day17(r) 1 Priority2-Day6-Day18(r) 1 Priority2-Day6-Day19(r) 1 Priority2-Day6-Day20(r) 1 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day6(r) 2 Priority3-Day2-Day7(r) 5 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day7(r) 1 Priority3-Day3-Day8(r) 2 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day7(r) 2 Priority3-Day6-Day8(r) 3 Priority3-Day6-Day9(r) 4 Priority3-Day6-Day10(r) 4 Priority3-Day6-Day11(r) 4 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1 (w) 1 Priority1-Day1-Day2 (w) 1 Priority1-Day2-Day1 (w) 1 Priority1-Day2-Day2 (w) 1 Priority1-Day2-Day3 (w) 1 Priority1-Day2-Day4 (w) 1 Priority1-Day3-Day1 (w) 1 Priority1-Day3-Day2 (w) 1 Priority1-Day3-Day3 (w) 1 Priority1-Day4-Day1 (w) 1 Priority1-Day4-Day2 (w) 1 Priority1-Day4-Day3 (w) 1 Priority1-Day4-Day4 (w) 1 Priority1-Day4-Day5 (w) 1 Priority1-Day4-Day6 (w) 1 Priority1-Day5-Day1 (w) 1 Priority1-Day5-Day2 (w) 1 Priority1-Day5-Day3 (w) 1 Priority1-Day5-Day4 (w) 1 Priority1-Day5-Day5 (w) 1 Priority1-Day5-Day6 (w) 1 Priority1-Day6-Day1 (w) 1 Priority1-Day6-Day2 (w) 1 Priority1-Day6-Day3 (w) 1 Priority1-Day6-Day4 (w) 1 Priority1-Day6-Day5 (w) 1 Priority1-Day6-Day6 (w) 1 Priority2-Day1-Day3 (w) 1 Priority2-Day1-Day4 (w) 1 Priority2-Day1-Day5 (w) 1 Priority2-Day1-Day6 (w) 1 Priority2-Day1-Day7 (w) 1 Priority2-Day1-Day8 (w) 1 Priority2-Day1-Day9 (w) 1 Priority2-Day1-Day10 (w) 1 Priority2-Day1-Day11 (w) 1 Priority2-Day1-Day12 (w) 1 Priority2-Day1-Day13 (w) 1 Priority2-Day1-Day14 (w) 1 Priority2-Day1-Day15 (w) 1 Priority2-Day1-Day16 (w) 1 Priority2-Day1-Day17 (w) 1 Priority2-Day1-Day18 (w) 1 Priority2-Day1-Day19 (w) 1 Priority2-Day1-Day20 (w) 1 Priority2-Day2-Day6 (w) 1 Priority2-Day2-Day7 (w) 1 Priority2-Day2-Day8 (w) 1 Priority2-Day2-Day9 (w) 1 Priority2-Day2-Day10 (w) 1 Priority2-Day2-Day11 (w) 1 Priority2-Day2-Day12 (w) 1 Priority2-Day2-Day13 (w) 1 Priority2-Day2-Day14 (w) 1 Priority2-Day2-Day15 (w) 1 Priority2-Day2-Day16 (w) 1 Priority2-Day2-Day17 (w) 1 Priority2-Day2-Day18 (w) 1 Priority2-Day2-Day19 (w) 1 Priority2-Day2-Day20 (w) 1 Priority2-Day3-Day6 (w) 1 Priority2-Day3-Day7 (w) 1 Priority2-Day3-Day8 (w) 1 Priority2-Day3-Day9 (w) 1 Priority2-Day3-Day10 (w) 1 Priority2-Day3-Day11 (w) 1 Priority2-Day3-Day12 (w) 1 Priority2-Day3-Day13 (w) 1 Priority2-Day3-Day14 (w) 1 Priority2-Day3-Day15 (w) 1 Priority2-Day3-Day16 (w) 1 Priority2-Day3-Day17 (w) 1 Priority2-Day3-Day18 (w) 1 Priority2-Day3-Day19 (w) 1 Priority2-Day3-Day20 (w) 1 Priority2-Day5-Day6 (w) 1 Priority2-Day5-Day7 (w) 1 Priority2-Day5-Day8 (w) 1 Priority2-Day5-Day9 (w) 1 Priority2-Day5-Day10 (w) 1 Priority2-Day5-Day11 (w) 1 Priority2-Day5-Day12 (w) 1 Priority2-Day5-Day13 (w) 1 Priority2-Day5-Day14 (w) 1 Priority2-Day5-Day15 (w) 1 Priority2-Day5-Day16 (w) 1 Priority2-Day5-Day17 (w) 1 Priority2-Day5-Day18 (w) 1 Priority2-Day5-Day19 (w) 1 Priority2-Day5-Day20 (w) 1 Priority2-Day6-Day9 (w) 1 Priority2-Day6-Day10 (w) 1 Priority2-Day6-Day11 (w) 1 Priority2-Day6-Day12 (w) 1 Priority2-Day6-Day13 (w) 1 Priority2-Day6-Day14 (w) 1 Priority2-Day6-Day15 (w) 1 Priority2-Day6-Day16 (w) 1 Priority2-Day6-Day17 (w) 1 Priority2-Day6-Day18 (w) 1 Priority2-Day6-Day19 (w) 1 Priority2-Day6-Day20 (w) 1 Priority3-Day1-Day7 (w) 1 Priority3-Day1-Day8 (w) 1 Priority3-Day1-Day9 (w) 1 Priority3-Day1-Day10 (w) 1 Priority3-Day1-Day11 (w) 1 Priority3-Day1-Day12 (w) 1 Priority3-Day1-Day13 (w) 1 Priority3-Day1-Day14 (w) 1 Priority3-Day1-Day15 (w) 1 Priority3-Day1-Day16 (w) 1 Priority3-Day1-Day17 (w) 1 Priority3-Day1-Day18 (w) 1 Priority3-Day1-Day19 (w) 1 Priority3-Day1-Day20 (w) 1 Priority3-Day2-Day6 (w) 1 Priority3-Day2-Day7 (w) 1 Priority3-Day2-Day8 (w) 1 Priority3-Day2-Day9 (w) 1 Priority3-Day2-Day10 (w) 1 Priority3-Day2-Day11 (w) 1 Priority3-Day2-Day12 (w) 1 Priority3-Day2-Day13 (w) 1 Priority3-Day2-Day14 (w) 1 Priority3-Day2-Day15 (w) 1 Priority3-Day2-Day16 (w) 1 Priority3-Day2-Day17 (w) 1 Priority3-Day2-Day18 (w) 1 Priority3-Day2-Day19 (w) 1 Priority3-Day2-Day20 (w) 1 Priority3-Day3-Day7 (w) 1 Priority3-Day3-Day8 (w) 1 Priority3-Day3-Day9 (w) 1 Priority3-Day3-Day10 (w) 1 Priority3-Day3-Day11 (w) 1 Priority3-Day3-Day12 (w) 1 Priority3-Day3-Day13 (w) 1 Priority3-Day3-Day14 (w) 1 Priority3-Day3-Day15 (w) 1 Priority3-Day3-Day16 (w) 1 Priority3-Day3-Day17 (w) 1 Priority3-Day3-Day18 (w) 1 Priority3-Day3-Day19 (w) 1 Priority3-Day3-Day20 (w) 1 Priority3-Day4-Day9 (w) 1 Priority3-Day4-Day10 (w) 1 Priority3-Day4-Day11 (w) 1 Priority3-Day4-Day12 (w) 1 Priority3-Day4-Day13 (w) 1 Priority3-Day4-Day14 (w) 1 Priority3-Day4-Day15 (w) 1 Priority3-Day4-Day16 (w) 1 Priority3-Day4-Day17 (w) 1 Priority3-Day4-Day18 (w) 1 Priority3-Day4-Day19 (w) 1 Priority3-Day4-Day20 (w) 1 Priority3-Day5-Day9 (w) 1 Priority3-Day5-Day10 (w) 1 Priority3-Day5-Day11 (w) 1 Priority3-Day5-Day12 (w) 1 Priority3-Day5-Day13 (w) 1 Priority3-Day5-Day14 (w) 1 Priority3-Day5-Day15 (w) 1 Priority3-Day5-Day16 (w) 1 Priority3-Day5-Day17 (w) 1 Priority3-Day5-Day18 (w) 1 Priority3-Day5-Day19 (w) 1 Priority3-Day5-Day20 (w) 1 Priority3-Day6-Day7 (w) 1 Priority3-Day6-Day8 (w) 1 Priority3-Day6-Day9 (w) 1 Priority3-Day6-Day10 (w) 1 Priority3-Day6-Day11 (w) 1 Priority3-Day6-Day12 (w) 1 Priority3-Day6-Day13 (w) 1 Priority3-Day6-Day14 (w) 1 Priority3-Day6-Day15 (w) 1 Priority3-Day6-Day16 (w) 1 Priority3-Day6-Day17 (w) 1 Priority3-Day6-Day18 (w) 1 Priority3-Day6-Day19 (w) 1 Priority3-Day6-Day20 (w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1449 rows and 766 columns Presolve time: 0.03s Presolved: 489 rows, 332 columns, 4480 nonzeros Variable types: 0 continuous, 332 integer (142 binary) Root relaxation: objective 2.470000e+03, 234 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2470.00000 0 8 7500.00000 2470.00000 67.1% - 0s H 0 0 2590.0000000 2470.00000 4.63% - 0s H 0 0 2555.0000000 2470.00000 3.33% - 0s 0 0 2470.00000 0 8 2555.00000 2470.00000 3.33% - 0s 0 0 2472.85714 0 9 2555.00000 2472.85714 3.21% - 0s 0 0 2472.85714 0 1 2555.00000 2472.85714 3.21% - 0s 0 0 2472.85714 0 7 2555.00000 2472.85714 3.21% - 0s 0 0 2473.75000 0 22 2555.00000 2473.75000 3.18% - 0s 0 0 2482.30769 0 9 2555.00000 2482.30769 2.85% - 0s 0 0 2482.30769 0 23 2555.00000 2482.30769 2.85% - 0s H 0 0 2550.0000000 2482.30769 2.65% - 0s 0 0 2482.40385 0 29 2550.00000 2482.40385 2.65% - 0s 0 0 2482.40385 0 31 2550.00000 2482.40385 2.65% - 0s 0 0 2490.71429 0 23 2550.00000 2490.71429 2.32% - 0s H 0 0 2530.0000000 2490.71429 1.55% - 0s 0 0 2499.28571 0 29 2530.00000 2499.28571 1.21% - 0s 0 0 2501.25000 0 18 2530.00000 2501.25000 1.14% - 0s H 0 0 2525.0000000 2501.25000 0.94% - 0s Explored 0 nodes (424 simplex iterations) in 0.16 seconds Thread count was 4 (of 4 available processors) Solution count 7: 2525 2530 2550 ... 7500 Pool objective bound 2525 Optimal solution found (tolerance 1.00e-04) Best objective 2.525000000000e+03, best bound 2.525000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day1--Day1(y) 2 Priority1--Day2--Day2(y) 5 Priority1--Day4--Day4(y) 2 Priority2--Day1--Day1(y) 6 Priority1-Day1-Day1 5 Priority1-Day2-Day2 2 Priority1-Day3-Day3 4 Priority1-Day4-Day4 2 Priority1-Day4-Day5 2 Priority1-Day5-Day5 3 Priority1-Day6-Day6 3 Priority2-Day1-Day1 3 Priority2-Day2-Day2 1 Priority2-Day3-Day7 5 Priority2-Day5-Day5 1 Priority2-Day5-Day6 2 Priority2-Day5-Day9 2 Priority2-Day6-Day6 2 Priority3-Day1-Day7 1 Priority3-Day2-Day7 1 Priority3-Day2-Day8 5 Priority3-Day3-Day9 4 Priority3-Day4-Day10 2 Priority3-Day5-Day11 3 Priority3-Day6-Day10 1 Priority3-Day6-Day12 6 Priority1-Day1-Day1(r) 7 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 4 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 4 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day5(r) 6 Priority2-Day1-Day6(r) 6 Priority2-Day1-Day7(r) 6 Priority2-Day1-Day8(r) 6 Priority2-Day1-Day9(r) 6 Priority2-Day1-Day10(r) 6 Priority2-Day1-Day11(r) 6 Priority2-Day1-Day12(r) 6 Priority2-Day1-Day13(r) 6 Priority2-Day1-Day14(r) 6 Priority2-Day1-Day15(r) 6 Priority2-Day1-Day16(r) 6 Priority2-Day1-Day17(r) 6 Priority2-Day1-Day18(r) 6 Priority2-Day1-Day19(r) 6 Priority2-Day1-Day20(r) 6 Priority2-Day3-Day7(r) 5 Priority2-Day3-Day8(r) 5 Priority2-Day3-Day9(r) 5 Priority2-Day3-Day10(r) 5 Priority2-Day3-Day11(r) 5 Priority2-Day3-Day12(r) 5 Priority2-Day3-Day13(r) 5 Priority2-Day3-Day14(r) 5 Priority2-Day3-Day15(r) 5 Priority2-Day3-Day16(r) 5 Priority2-Day3-Day17(r) 5 Priority2-Day3-Day18(r) 5 Priority2-Day3-Day19(r) 5 Priority2-Day3-Day20(r) 5 Priority2-Day5-Day6(r) 2 Priority2-Day5-Day7(r) 2 Priority2-Day5-Day8(r) 2 Priority2-Day5-Day9(r) 4 Priority2-Day5-Day10(r) 4 Priority2-Day5-Day11(r) 4 Priority2-Day5-Day12(r) 4 Priority2-Day5-Day13(r) 4 Priority2-Day5-Day14(r) 4 Priority2-Day5-Day15(r) 4 Priority2-Day5-Day16(r) 4 Priority2-Day5-Day17(r) 4 Priority2-Day5-Day18(r) 4 Priority2-Day5-Day19(r) 4 Priority2-Day5-Day20(r) 4 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day7(r) 1 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day10(r) 1 Priority3-Day6-Day11(r) 1 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1 (w) 1 Priority1-Day2-Day1 (w) 1 Priority1-Day2-Day2 (w) 1 Priority1-Day2-Day3 (w) 1 Priority1-Day2-Day4 (w) 1 Priority1-Day3-Day1 (w) 1 Priority1-Day3-Day2 (w) 1 Priority1-Day3-Day3 (w) 1 Priority1-Day3-Day4 (w) 1 Priority1-Day4-Day1 (w) 1 Priority1-Day4-Day2 (w) 1 Priority1-Day4-Day3 (w) 1 Priority1-Day4-Day4 (w) 1 Priority1-Day4-Day5 (w) 1 Priority1-Day5-Day1 (w) 1 Priority1-Day5-Day2 (w) 1 Priority1-Day5-Day3 (w) 1 Priority1-Day5-Day4 (w) 1 Priority1-Day5-Day5 (w) 1 Priority1-Day6-Day1 (w) 1 Priority1-Day6-Day2 (w) 1 Priority1-Day6-Day3 (w) 1 Priority1-Day6-Day4 (w) 1 Priority1-Day6-Day5 (w) 1 Priority1-Day6-Day6 (w) 1 Priority2-Day1-Day5 (w) 1 Priority2-Day1-Day6 (w) 1 Priority2-Day1-Day7 (w) 1 Priority2-Day1-Day8 (w) 1 Priority2-Day1-Day9 (w) 1 Priority2-Day1-Day10 (w) 1 Priority2-Day1-Day11 (w) 1 Priority2-Day1-Day12 (w) 1 Priority2-Day1-Day13 (w) 1 Priority2-Day1-Day14 (w) 1 Priority2-Day1-Day15 (w) 1 Priority2-Day1-Day16 (w) 1 Priority2-Day1-Day17 (w) 1 Priority2-Day1-Day18 (w) 1 Priority2-Day1-Day19 (w) 1 Priority2-Day1-Day20 (w) 1 Priority2-Day3-Day7 (w) 1 Priority2-Day3-Day8 (w) 1 Priority2-Day3-Day9 (w) 1 Priority2-Day3-Day10 (w) 1 Priority2-Day3-Day11 (w) 1 Priority2-Day3-Day12 (w) 1 Priority2-Day3-Day13 (w) 1 Priority2-Day3-Day14 (w) 1 Priority2-Day3-Day15 (w) 1 Priority2-Day3-Day16 (w) 1 Priority2-Day3-Day17 (w) 1 Priority2-Day3-Day18 (w) 1 Priority2-Day3-Day19 (w) 1 Priority2-Day3-Day20 (w) 1 Priority2-Day5-Day6 (w) 1 Priority2-Day5-Day7 (w) 1 Priority2-Day5-Day8 (w) 1 Priority2-Day5-Day9 (w) 1 Priority2-Day5-Day10 (w) 1 Priority2-Day5-Day11 (w) 1 Priority2-Day5-Day12 (w) 1 Priority2-Day5-Day13 (w) 1 Priority2-Day5-Day14 (w) 1 Priority2-Day5-Day15 (w) 1 Priority2-Day5-Day16 (w) 1 Priority2-Day5-Day17 (w) 1 Priority2-Day5-Day18 (w) 1 Priority2-Day5-Day19 (w) 1 Priority2-Day5-Day20 (w) 1 Priority2-Day6-Day10 (w) 1 Priority2-Day6-Day11 (w) 1 Priority2-Day6-Day12 (w) 1 Priority2-Day6-Day13 (w) 1 Priority2-Day6-Day14 (w) 1 Priority2-Day6-Day15 (w) 1 Priority2-Day6-Day16 (w) 1 Priority2-Day6-Day17 (w) 1 Priority2-Day6-Day18 (w) 1 Priority2-Day6-Day19 (w) 1 Priority2-Day6-Day20 (w) 1 Priority3-Day1-Day7 (w) 1 Priority3-Day1-Day8 (w) 1 Priority3-Day1-Day9 (w) 1 Priority3-Day1-Day10 (w) 1 Priority3-Day1-Day11 (w) 1 Priority3-Day1-Day12 (w) 1 Priority3-Day1-Day13 (w) 1 Priority3-Day1-Day14 (w) 1 Priority3-Day1-Day15 (w) 1 Priority3-Day1-Day16 (w) 1 Priority3-Day1-Day17 (w) 1 Priority3-Day1-Day18 (w) 1 Priority3-Day1-Day19 (w) 1 Priority3-Day1-Day20 (w) 1 Priority3-Day2-Day7 (w) 1 Priority3-Day2-Day8 (w) 1 Priority3-Day2-Day9 (w) 1 Priority3-Day2-Day10 (w) 1 Priority3-Day2-Day11 (w) 1 Priority3-Day2-Day12 (w) 1 Priority3-Day2-Day13 (w) 1 Priority3-Day2-Day14 (w) 1 Priority3-Day2-Day15 (w) 1 Priority3-Day2-Day16 (w) 1 Priority3-Day2-Day17 (w) 1 Priority3-Day2-Day18 (w) 1 Priority3-Day2-Day19 (w) 1 Priority3-Day2-Day20 (w) 1 Priority3-Day3-Day9 (w) 1 Priority3-Day3-Day10 (w) 1 Priority3-Day3-Day11 (w) 1 Priority3-Day3-Day12 (w) 1 Priority3-Day3-Day13 (w) 1 Priority3-Day3-Day14 (w) 1 Priority3-Day3-Day15 (w) 1 Priority3-Day3-Day16 (w) 1 Priority3-Day3-Day17 (w) 1 Priority3-Day3-Day18 (w) 1 Priority3-Day3-Day19 (w) 1 Priority3-Day3-Day20 (w) 1 Priority3-Day4-Day10 (w) 1 Priority3-Day4-Day11 (w) 1 Priority3-Day4-Day12 (w) 1 Priority3-Day4-Day13 (w) 1 Priority3-Day4-Day14 (w) 1 Priority3-Day4-Day15 (w) 1 Priority3-Day4-Day16 (w) 1 Priority3-Day4-Day17 (w) 1 Priority3-Day4-Day18 (w) 1 Priority3-Day4-Day19 (w) 1 Priority3-Day4-Day20 (w) 1 Priority3-Day5-Day11 (w) 1 Priority3-Day5-Day12 (w) 1 Priority3-Day5-Day13 (w) 1 Priority3-Day5-Day14 (w) 1 Priority3-Day5-Day15 (w) 1 Priority3-Day5-Day16 (w) 1 Priority3-Day5-Day17 (w) 1 Priority3-Day5-Day18 (w) 1 Priority3-Day5-Day19 (w) 1 Priority3-Day5-Day20 (w) 1 Priority3-Day6-Day10 (w) 1 Priority3-Day6-Day11 (w) 1 Priority3-Day6-Day12 (w) 1 Priority3-Day6-Day13 (w) 1 Priority3-Day6-Day14 (w) 1 Priority3-Day6-Day15 (w) 1 Priority3-Day6-Day16 (w) 1 Priority3-Day6-Day17 (w) 1 Priority3-Day6-Day18 (w) 1 Priority3-Day6-Day19 (w) 1 Priority3-Day6-Day20 (w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1377 rows and 717 columns Presolve time: 0.04s Presolved: 561 rows, 381 columns, 5584 nonzeros Variable types: 0 continuous, 381 integer (167 binary) Root relaxation: objective 2.975000e+03, 217 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2975.00000 0 1 7500.00000 2975.00000 60.3% - 0s H 0 0 2990.0000000 2975.00000 0.50% - 0s Explored 0 nodes (243 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 2: 2990 7500 Pool objective bound 2990 Optimal solution found (tolerance 1.00e-04) Best objective 2.990000000000e+03, best bound 2.990000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day2--Day2(y) 7 Priority1--Day4--Day4(y) 1 Priority2--Day1--Day1(y) 9 Priority2--Day3--Day3(y) 4 Priority3--Day1--Day1(y) 1 Priority3--Day2--Day2(y) 1 Priority1-Day1-Day1 7 Priority1-Day3-Day3 4 Priority1-Day4-Day4 5 Priority1-Day5-Day5 3 Priority1-Day6-Day6 3 Priority2-Day2-Day2 1 Priority2-Day3-Day3 1 Priority2-Day5-Day6 1 Priority2-Day5-Day7 4 Priority2-Day6-Day6 2 Priority3-Day2-Day7 3 Priority3-Day2-Day8 2 Priority3-Day3-Day7 1 Priority3-Day3-Day8 1 Priority3-Day3-Day9 2 Priority3-Day4-Day10 2 Priority3-Day5-Day11 3 Priority3-Day6-Day12 7 Priority1-Day1-Day1(r) 7 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 6 Priority1-Day2-Day4(r) 1 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 1 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day3(r) 1 Priority2-Day1-Day4(r) 6 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day3-Day7(r) 4 Priority2-Day3-Day8(r) 4 Priority2-Day3-Day9(r) 4 Priority2-Day3-Day10(r) 4 Priority2-Day3-Day11(r) 4 Priority2-Day3-Day12(r) 4 Priority2-Day3-Day13(r) 4 Priority2-Day3-Day14(r) 4 Priority2-Day3-Day15(r) 4 Priority2-Day3-Day16(r) 4 Priority2-Day3-Day17(r) 4 Priority2-Day3-Day18(r) 4 Priority2-Day3-Day19(r) 4 Priority2-Day3-Day20(r) 4 Priority2-Day5-Day6(r) 1 Priority2-Day5-Day7(r) 5 Priority2-Day5-Day8(r) 5 Priority2-Day5-Day9(r) 5 Priority2-Day5-Day10(r) 5 Priority2-Day5-Day11(r) 5 Priority2-Day5-Day12(r) 5 Priority2-Day5-Day13(r) 5 Priority2-Day5-Day14(r) 5 Priority2-Day5-Day15(r) 5 Priority2-Day5-Day16(r) 5 Priority2-Day5-Day17(r) 5 Priority2-Day5-Day18(r) 5 Priority2-Day5-Day19(r) 5 Priority2-Day5-Day20(r) 5 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day7(r) 3 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day7(r) 1 Priority3-Day3-Day8(r) 2 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1 (w) 1 Priority1-Day1-Day2 (w) 1 Priority1-Day2-Day1 (w) 1 Priority1-Day2-Day2 (w) 1 Priority1-Day2-Day3 (w) 1 Priority1-Day2-Day4 (w) 1 Priority1-Day3-Day1 (w) 1 Priority1-Day3-Day2 (w) 1 Priority1-Day3-Day3 (w) 1 Priority1-Day4-Day1 (w) 1 Priority1-Day4-Day2 (w) 1 Priority1-Day4-Day3 (w) 1 Priority1-Day4-Day4 (w) 1 Priority1-Day4-Day5 (w) 1 Priority1-Day5-Day1 (w) 1 Priority1-Day5-Day2 (w) 1 Priority1-Day5-Day3 (w) 1 Priority1-Day5-Day4 (w) 1 Priority1-Day5-Day5 (w) 1 Priority1-Day6-Day1 (w) 1 Priority1-Day6-Day2 (w) 1 Priority1-Day6-Day3 (w) 1 Priority1-Day6-Day4 (w) 1 Priority1-Day6-Day5 (w) 1 Priority1-Day6-Day6 (w) 1 Priority2-Day1-Day3 (w) 1 Priority2-Day1-Day4 (w) 1 Priority2-Day1-Day5 (w) 1 Priority2-Day1-Day6 (w) 1 Priority2-Day1-Day7 (w) 1 Priority2-Day1-Day8 (w) 1 Priority2-Day1-Day9 (w) 1 Priority2-Day1-Day10 (w) 1 Priority2-Day1-Day11 (w) 1 Priority2-Day1-Day12 (w) 1 Priority2-Day1-Day13 (w) 1 Priority2-Day1-Day14 (w) 1 Priority2-Day1-Day15 (w) 1 Priority2-Day1-Day16 (w) 1 Priority2-Day1-Day17 (w) 1 Priority2-Day1-Day18 (w) 1 Priority2-Day1-Day19 (w) 1 Priority2-Day1-Day20 (w) 1 Priority2-Day2-Day7 (w) 1 Priority2-Day2-Day8 (w) 1 Priority2-Day2-Day9 (w) 1 Priority2-Day2-Day10 (w) 1 Priority2-Day2-Day11 (w) 1 Priority2-Day2-Day12 (w) 1 Priority2-Day2-Day13 (w) 1 Priority2-Day2-Day14 (w) 1 Priority2-Day2-Day15 (w) 1 Priority2-Day2-Day16 (w) 1 Priority2-Day2-Day17 (w) 1 Priority2-Day2-Day18 (w) 1 Priority2-Day2-Day19 (w) 1 Priority2-Day2-Day20 (w) 1 Priority2-Day3-Day7 (w) 1 Priority2-Day3-Day8 (w) 1 Priority2-Day3-Day9 (w) 1 Priority2-Day3-Day10 (w) 1 Priority2-Day3-Day11 (w) 1 Priority2-Day3-Day12 (w) 1 Priority2-Day3-Day13 (w) 1 Priority2-Day3-Day14 (w) 1 Priority2-Day3-Day15 (w) 1 Priority2-Day3-Day16 (w) 1 Priority2-Day3-Day17 (w) 1 Priority2-Day3-Day18 (w) 1 Priority2-Day3-Day19 (w) 1 Priority2-Day3-Day20 (w) 1 Priority2-Day5-Day6 (w) 1 Priority2-Day5-Day7 (w) 1 Priority2-Day5-Day8 (w) 1 Priority2-Day5-Day9 (w) 1 Priority2-Day5-Day10 (w) 1 Priority2-Day5-Day11 (w) 1 Priority2-Day5-Day12 (w) 1 Priority2-Day5-Day13 (w) 1 Priority2-Day5-Day14 (w) 1 Priority2-Day5-Day15 (w) 1 Priority2-Day5-Day16 (w) 1 Priority2-Day5-Day17 (w) 1 Priority2-Day5-Day18 (w) 1 Priority2-Day5-Day19 (w) 1 Priority2-Day5-Day20 (w) 1 Priority3-Day1-Day7 (w) 1 Priority3-Day1-Day8 (w) 1 Priority3-Day1-Day9 (w) 1 Priority3-Day1-Day10 (w) 1 Priority3-Day1-Day11 (w) 1 Priority3-Day1-Day12 (w) 1 Priority3-Day1-Day13 (w) 1 Priority3-Day1-Day14 (w) 1 Priority3-Day1-Day15 (w) 1 Priority3-Day1-Day16 (w) 1 Priority3-Day1-Day17 (w) 1 Priority3-Day1-Day18 (w) 1 Priority3-Day1-Day19 (w) 1 Priority3-Day1-Day20 (w) 1 Priority3-Day2-Day7 (w) 1 Priority3-Day2-Day8 (w) 1 Priority3-Day2-Day9 (w) 1 Priority3-Day2-Day10 (w) 1 Priority3-Day2-Day11 (w) 1 Priority3-Day2-Day12 (w) 1 Priority3-Day2-Day13 (w) 1 Priority3-Day2-Day14 (w) 1 Priority3-Day2-Day15 (w) 1 Priority3-Day2-Day16 (w) 1 Priority3-Day2-Day17 (w) 1 Priority3-Day2-Day18 (w) 1 Priority3-Day2-Day19 (w) 1 Priority3-Day2-Day20 (w) 1 Priority3-Day3-Day7 (w) 1 Priority3-Day3-Day8 (w) 1 Priority3-Day3-Day9 (w) 1 Priority3-Day3-Day10 (w) 1 Priority3-Day3-Day11 (w) 1 Priority3-Day3-Day12 (w) 1 Priority3-Day3-Day13 (w) 1 Priority3-Day3-Day14 (w) 1 Priority3-Day3-Day15 (w) 1 Priority3-Day3-Day16 (w) 1 Priority3-Day3-Day17 (w) 1 Priority3-Day3-Day18 (w) 1 Priority3-Day3-Day19 (w) 1 Priority3-Day3-Day20 (w) 1 Priority3-Day4-Day10 (w) 1 Priority3-Day4-Day11 (w) 1 Priority3-Day4-Day12 (w) 1 Priority3-Day4-Day13 (w) 1 Priority3-Day4-Day14 (w) 1 Priority3-Day4-Day15 (w) 1 Priority3-Day4-Day16 (w) 1 Priority3-Day4-Day17 (w) 1 Priority3-Day4-Day18 (w) 1 Priority3-Day4-Day19 (w) 1 Priority3-Day4-Day20 (w) 1 Priority3-Day5-Day11 (w) 1 Priority3-Day5-Day12 (w) 1 Priority3-Day5-Day13 (w) 1 Priority3-Day5-Day14 (w) 1 Priority3-Day5-Day15 (w) 1 Priority3-Day5-Day16 (w) 1 Priority3-Day5-Day17 (w) 1 Priority3-Day5-Day18 (w) 1 Priority3-Day5-Day19 (w) 1 Priority3-Day5-Day20 (w) 1 Priority3-Day6-Day12 (w) 1 Priority3-Day6-Day13 (w) 1 Priority3-Day6-Day14 (w) 1 Priority3-Day6-Day15 (w) 1 Priority3-Day6-Day16 (w) 1 Priority3-Day6-Day17 (w) 1 Priority3-Day6-Day18 (w) 1 Priority3-Day6-Day19 (w) 1 Priority3-Day6-Day20 (w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1278 rows and 649 columns Presolve time: 0.07s Presolved: 660 rows, 449 columns, 6615 nonzeros Variable types: 0 continuous, 449 integer (200 binary) Root relaxation: objective 3.010000e+03, 311 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3010.00000 0 1 7500.00000 3010.00000 59.9% - 0s H 0 0 3070.0000000 3010.00000 1.95% - 0s 0 0 3010.00000 0 3 3070.00000 3010.00000 1.95% - 0s 0 0 3012.14286 0 12 3070.00000 3012.14286 1.88% - 0s 0 0 3012.14286 0 1 3070.00000 3012.14286 1.88% - 0s 0 0 3046.66667 0 8 3070.00000 3046.66667 0.76% - 0s 0 0 3060.00000 0 1 3070.00000 3060.00000 0.33% - 0s 0 0 cutoff 0 3070.00000 3070.00000 0.00% - 0s Explored 0 nodes (478 simplex iterations) in 0.17 seconds Thread count was 4 (of 4 available processors) Solution count 2: 3070 7500 Pool objective bound 3070 Optimal solution found (tolerance 1.00e-04) Best objective 3.070000000000e+03, best bound 3.070000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day1--Day1 2 Priority1--Day2--Day2 6 Priority1--Day4--Day4 1 Priority2--Day1--Day1 9 Priority2--Day3--Day3 2 Priority2--Day6--Day6 1 Priority3--Day1--Day1 1 Priority3--Day2--Day2 2 Priority1-Day1-Day1 5 Priority1-Day2-Day2 1 Priority1-Day3-Day3 4 Priority1-Day4-Day4 5 Priority1-Day5-Day5 3 Priority1-Day6-Day6 3 Priority2-Day2-Day2 1 Priority2-Day3-Day3 3 Priority2-Day5-Day5 1 Priority2-Day5-Day7 3 Priority2-Day5-Day9 1 Priority2-Day6-Day6 1 Priority3-Day2-Day8 4 Priority3-Day3-Day9 4 Priority3-Day4-Day10 2 Priority3-Day5-Day10 2 Priority3-Day5-Day11 1 Priority3-Day6-Day10 2 Priority3-Day6-Day12 5 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 2 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 5 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 1 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day4(r) 5 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day3-Day7(r) 2 Priority2-Day3-Day8(r) 2 Priority2-Day3-Day9(r) 2 Priority2-Day3-Day10(r) 2 Priority2-Day3-Day11(r) 2 Priority2-Day3-Day12(r) 2 Priority2-Day3-Day13(r) 2 Priority2-Day3-Day14(r) 2 Priority2-Day3-Day15(r) 2 Priority2-Day3-Day16(r) 2 Priority2-Day3-Day17(r) 2 Priority2-Day3-Day18(r) 2 Priority2-Day3-Day19(r) 2 Priority2-Day3-Day20(r) 2 Priority2-Day5-Day7(r) 3 Priority2-Day5-Day8(r) 3 Priority2-Day5-Day9(r) 4 Priority2-Day5-Day10(r) 4 Priority2-Day5-Day11(r) 4 Priority2-Day5-Day12(r) 4 Priority2-Day5-Day13(r) 4 Priority2-Day5-Day14(r) 4 Priority2-Day5-Day15(r) 4 Priority2-Day5-Day16(r) 4 Priority2-Day5-Day17(r) 4 Priority2-Day5-Day18(r) 4 Priority2-Day5-Day19(r) 4 Priority2-Day5-Day20(r) 4 Priority2-Day6-Day10(r) 1 Priority2-Day6-Day11(r) 1 Priority2-Day6-Day12(r) 1 Priority2-Day6-Day13(r) 1 Priority2-Day6-Day14(r) 1 Priority2-Day6-Day15(r) 1 Priority2-Day6-Day16(r) 1 Priority2-Day6-Day17(r) 1 Priority2-Day6-Day18(r) 1 Priority2-Day6-Day19(r) 1 Priority2-Day6-Day20(r) 1 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day7(r) 2 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day10(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day10(r) 2 Priority3-Day6-Day11(r) 2 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1 (w) 1 Priority1-Day1-Day2 (w) 1 Priority1-Day2-Day1 (w) 1 Priority1-Day2-Day2 (w) 1 Priority1-Day2-Day3 (w) 1 Priority1-Day3-Day1 (w) 1 Priority1-Day3-Day2 (w) 1 Priority1-Day3-Day3 (w) 1 Priority1-Day4-Day1 (w) 1 Priority1-Day4-Day2 (w) 1 Priority1-Day4-Day3 (w) 1 Priority1-Day4-Day4 (w) 1 Priority1-Day4-Day5 (w) 1 Priority1-Day5-Day1 (w) 1 Priority1-Day5-Day2 (w) 1 Priority1-Day5-Day3 (w) 1 Priority1-Day5-Day4 (w) 1 Priority1-Day5-Day5 (w) 1 Priority1-Day6-Day1 (w) 1 Priority1-Day6-Day2 (w) 1 Priority1-Day6-Day3 (w) 1 Priority1-Day6-Day4 (w) 1 Priority1-Day6-Day5 (w) 1 Priority1-Day6-Day6 (w) 1 Priority2-Day1-Day4 (w) 1 Priority2-Day1-Day5 (w) 1 Priority2-Day1-Day6 (w) 1 Priority2-Day1-Day7 (w) 1 Priority2-Day1-Day8 (w) 1 Priority2-Day1-Day9 (w) 1 Priority2-Day1-Day10 (w) 1 Priority2-Day1-Day11 (w) 1 Priority2-Day1-Day12 (w) 1 Priority2-Day1-Day13 (w) 1 Priority2-Day1-Day14 (w) 1 Priority2-Day1-Day15 (w) 1 Priority2-Day1-Day16 (w) 1 Priority2-Day1-Day17 (w) 1 Priority2-Day1-Day18 (w) 1 Priority2-Day1-Day19 (w) 1 Priority2-Day1-Day20 (w) 1 Priority2-Day3-Day7 (w) 1 Priority2-Day3-Day8 (w) 1 Priority2-Day3-Day9 (w) 1 Priority2-Day3-Day10 (w) 1 Priority2-Day3-Day11 (w) 1 Priority2-Day3-Day12 (w) 1 Priority2-Day3-Day13 (w) 1 Priority2-Day3-Day14 (w) 1 Priority2-Day3-Day15 (w) 1 Priority2-Day3-Day16 (w) 1 Priority2-Day3-Day17 (w) 1 Priority2-Day3-Day18 (w) 1 Priority2-Day3-Day19 (w) 1 Priority2-Day3-Day20 (w) 1 Priority2-Day5-Day6 (w) 1 Priority2-Day5-Day7 (w) 1 Priority2-Day5-Day8 (w) 1 Priority2-Day5-Day9 (w) 1 Priority2-Day5-Day10 (w) 1 Priority2-Day5-Day11 (w) 1 Priority2-Day5-Day12 (w) 1 Priority2-Day5-Day13 (w) 1 Priority2-Day5-Day14 (w) 1 Priority2-Day5-Day15 (w) 1 Priority2-Day5-Day16 (w) 1 Priority2-Day5-Day17 (w) 1 Priority2-Day5-Day18 (w) 1 Priority2-Day5-Day19 (w) 1 Priority2-Day5-Day20 (w) 1 Priority2-Day6-Day10 (w) 1 Priority2-Day6-Day11 (w) 1 Priority2-Day6-Day12 (w) 1 Priority2-Day6-Day13 (w) 1 Priority2-Day6-Day14 (w) 1 Priority2-Day6-Day15 (w) 1 Priority2-Day6-Day16 (w) 1 Priority2-Day6-Day17 (w) 1 Priority2-Day6-Day18 (w) 1 Priority2-Day6-Day19 (w) 1 Priority2-Day6-Day20 (w) 1 Priority3-Day1-Day7 (w) 1 Priority3-Day1-Day8 (w) 1 Priority3-Day1-Day9 (w) 1 Priority3-Day1-Day10 (w) 1 Priority3-Day1-Day11 (w) 1 Priority3-Day1-Day12 (w) 1 Priority3-Day1-Day13 (w) 1 Priority3-Day1-Day14 (w) 1 Priority3-Day1-Day15 (w) 1 Priority3-Day1-Day16 (w) 1 Priority3-Day1-Day17 (w) 1 Priority3-Day1-Day18 (w) 1 Priority3-Day1-Day19 (w) 1 Priority3-Day1-Day20 (w) 1 Priority3-Day2-Day7 (w) 1 Priority3-Day2-Day8 (w) 1 Priority3-Day2-Day9 (w) 1 Priority3-Day2-Day10 (w) 1 Priority3-Day2-Day11 (w) 1 Priority3-Day2-Day12 (w) 1 Priority3-Day2-Day13 (w) 1 Priority3-Day2-Day14 (w) 1 Priority3-Day2-Day15 (w) 1 Priority3-Day2-Day16 (w) 1 Priority3-Day2-Day17 (w) 1 Priority3-Day2-Day18 (w) 1 Priority3-Day2-Day19 (w) 1 Priority3-Day2-Day20 (w) 1 Priority3-Day3-Day9 (w) 1 Priority3-Day3-Day10 (w) 1 Priority3-Day3-Day11 (w) 1 Priority3-Day3-Day12 (w) 1 Priority3-Day3-Day13 (w) 1 Priority3-Day3-Day14 (w) 1 Priority3-Day3-Day15 (w) 1 Priority3-Day3-Day16 (w) 1 Priority3-Day3-Day17 (w) 1 Priority3-Day3-Day18 (w) 1 Priority3-Day3-Day19 (w) 1 Priority3-Day3-Day20 (w) 1 Priority3-Day4-Day10 (w) 1 Priority3-Day4-Day11 (w) 1 Priority3-Day4-Day12 (w) 1 Priority3-Day4-Day13 (w) 1 Priority3-Day4-Day14 (w) 1 Priority3-Day4-Day15 (w) 1 Priority3-Day4-Day16 (w) 1 Priority3-Day4-Day17 (w) 1 Priority3-Day4-Day18 (w) 1 Priority3-Day4-Day19 (w) 1 Priority3-Day4-Day20 (w) 1 Priority3-Day5-Day10 (w) 1 Priority3-Day5-Day11 (w) 1 Priority3-Day5-Day12 (w) 1 Priority3-Day5-Day13 (w) 1 Priority3-Day5-Day14 (w) 1 Priority3-Day5-Day15 (w) 1 Priority3-Day5-Day16 (w) 1 Priority3-Day5-Day17 (w) 1 Priority3-Day5-Day18 (w) 1 Priority3-Day5-Day19 (w) 1 Priority3-Day5-Day20 (w) 1 Priority3-Day6-Day10 (w) 1 Priority3-Day6-Day11 (w) 1 Priority3-Day6-Day12 (w) 1 Priority3-Day6-Day13 (w) 1 Priority3-Day6-Day14 (w) 1 Priority3-Day6-Day15 (w) 1 Priority3-Day6-Day16 (w) 1 Priority3-Day6-Day17 (w) 1 Priority3-Day6-Day18 (w) 1 Priority3-Day6-Day19 (w) 1 Priority3-Day6-Day20 (w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1421 rows and 742 columns Presolve time: 0.05s Presolved: 517 rows, 356 columns, 5283 nonzeros Variable types: 0 continuous, 356 integer (169 binary) Root relaxation: objective 3.305000e+03, 203 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3305.00000 0 2 7500.00000 3305.00000 55.9% - 0s H 0 0 3375.0000000 3305.00000 2.07% - 0s H 0 0 3345.0000000 3305.00000 1.20% - 0s 0 0 3305.00000 0 1 3345.00000 3305.00000 1.20% - 0s 0 0 3305.00000 0 9 3345.00000 3305.00000 1.20% - 0s 0 0 3305.00000 0 1 3345.00000 3305.00000 1.20% - 0s 0 0 3305.00000 0 9 3345.00000 3305.00000 1.20% - 0s 0 0 3315.66667 0 11 3345.00000 3315.66667 0.88% - 0s 0 0 cutoff 0 3345.00000 3345.00000 0.00% - 0s Cutting planes: Gomory: 4 MIR: 4 Explored 0 nodes (432 simplex iterations) in 0.12 seconds Thread count was 4 (of 4 available processors) Solution count 4: 3345 3345 3375 7500 Pool objective bound 3345 Optimal solution found (tolerance 1.00e-04) Best objective 3.345000000000e+03, best bound 3.345000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day1--Day1 4 Priority1--Day2--Day2 7 Priority1--Day3--Day3 3 Priority2--Day1--Day1 9 Priority2--Day5--Day5 2 Priority1-Day1-Day1 3 Priority1-Day3-Day3 1 Priority1-Day4-Day4 6 Priority1-Day5-Day5 3 Priority1-Day6-Day6 3 Priority2-Day2-Day2 1 Priority2-Day3-Day6 3 Priority2-Day3-Day7 2 Priority2-Day5-Day5 3 Priority2-Day6-Day6 1 Priority2-Day6-Day9 1 Priority3-Day1-Day7 1 Priority3-Day2-Day7 5 Priority3-Day2-Day8 1 Priority3-Day3-Day9 4 Priority3-Day4-Day10 2 Priority3-Day5-Day9 2 Priority3-Day5-Day11 1 Priority3-Day6-Day12 7 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 4 Priority1-Day1-Day3(r) 3 Priority1-Day1-Day4(r) 2 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 6 Priority1-Day2-Day4(r) 5 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day3-Day4(r) 3 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day4(r) 3 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day3-Day6(r) 3 Priority2-Day3-Day7(r) 5 Priority2-Day3-Day8(r) 5 Priority2-Day3-Day9(r) 5 Priority2-Day3-Day10(r) 5 Priority2-Day3-Day11(r) 5 Priority2-Day3-Day12(r) 5 Priority2-Day3-Day13(r) 5 Priority2-Day3-Day14(r) 5 Priority2-Day3-Day15(r) 5 Priority2-Day3-Day16(r) 5 Priority2-Day3-Day17(r) 5 Priority2-Day3-Day18(r) 5 Priority2-Day3-Day19(r) 5 Priority2-Day3-Day20(r) 5 Priority2-Day5-Day9(r) 2 Priority2-Day5-Day10(r) 2 Priority2-Day5-Day11(r) 2 Priority2-Day5-Day12(r) 2 Priority2-Day5-Day13(r) 2 Priority2-Day5-Day14(r) 2 Priority2-Day5-Day15(r) 2 Priority2-Day5-Day16(r) 2 Priority2-Day5-Day17(r) 2 Priority2-Day5-Day18(r) 2 Priority2-Day5-Day19(r) 2 Priority2-Day5-Day20(r) 2 Priority2-Day6-Day9(r) 1 Priority2-Day6-Day10(r) 1 Priority2-Day6-Day11(r) 1 Priority2-Day6-Day12(r) 1 Priority2-Day6-Day13(r) 1 Priority2-Day6-Day14(r) 1 Priority2-Day6-Day15(r) 1 Priority2-Day6-Day16(r) 1 Priority2-Day6-Day17(r) 1 Priority2-Day6-Day18(r) 1 Priority2-Day6-Day19(r) 1 Priority2-Day6-Day20(r) 1 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day7(r) 5 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day9(r) 2 Priority3-Day5-Day10(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1 (w) 1 Priority1-Day1-Day2 (w) 1 Priority1-Day1-Day3 (w) 1 Priority1-Day1-Day4 (w) 1 Priority1-Day2-Day1 (w) 1 Priority1-Day2-Day2 (w) 1 Priority1-Day2-Day3 (w) 1 Priority1-Day2-Day4 (w) 1 Priority1-Day3-Day1 (w) 1 Priority1-Day3-Day2 (w) 1 Priority1-Day3-Day3 (w) 1 Priority1-Day3-Day4 (w) 1 Priority1-Day4-Day1 (w) 1 Priority1-Day4-Day2 (w) 1 Priority1-Day4-Day3 (w) 1 Priority1-Day4-Day4 (w) 1 Priority1-Day4-Day5 (w) 1 Priority1-Day5-Day1 (w) 1 Priority1-Day5-Day2 (w) 1 Priority1-Day5-Day3 (w) 1 Priority1-Day5-Day4 (w) 1 Priority1-Day5-Day5 (w) 1 Priority1-Day6-Day1 (w) 1 Priority1-Day6-Day2 (w) 1 Priority1-Day6-Day3 (w) 1 Priority1-Day6-Day4 (w) 1 Priority1-Day6-Day5 (w) 1 Priority1-Day6-Day6 (w) 1 Priority2-Day1-Day4 (w) 1 Priority2-Day1-Day5 (w) 1 Priority2-Day1-Day6 (w) 1 Priority2-Day1-Day7 (w) 1 Priority2-Day1-Day8 (w) 1 Priority2-Day1-Day9 (w) 1 Priority2-Day1-Day10 (w) 1 Priority2-Day1-Day11 (w) 1 Priority2-Day1-Day12 (w) 1 Priority2-Day1-Day13 (w) 1 Priority2-Day1-Day14 (w) 1 Priority2-Day1-Day15 (w) 1 Priority2-Day1-Day16 (w) 1 Priority2-Day1-Day17 (w) 1 Priority2-Day1-Day18 (w) 1 Priority2-Day1-Day19 (w) 1 Priority2-Day1-Day20 (w) 1 Priority2-Day2-Day6 (w) 1 Priority2-Day2-Day7 (w) 1 Priority2-Day2-Day8 (w) 1 Priority2-Day2-Day9 (w) 1 Priority2-Day2-Day10 (w) 1 Priority2-Day2-Day11 (w) 1 Priority2-Day2-Day12 (w) 1 Priority2-Day2-Day13 (w) 1 Priority2-Day2-Day14 (w) 1 Priority2-Day2-Day15 (w) 1 Priority2-Day2-Day16 (w) 1 Priority2-Day2-Day17 (w) 1 Priority2-Day2-Day18 (w) 1 Priority2-Day2-Day19 (w) 1 Priority2-Day2-Day20 (w) 1 Priority2-Day3-Day6 (w) 1 Priority2-Day3-Day7 (w) 1 Priority2-Day3-Day8 (w) 1 Priority2-Day3-Day9 (w) 1 Priority2-Day3-Day10 (w) 1 Priority2-Day3-Day11 (w) 1 Priority2-Day3-Day12 (w) 1 Priority2-Day3-Day13 (w) 1 Priority2-Day3-Day14 (w) 1 Priority2-Day3-Day15 (w) 1 Priority2-Day3-Day16 (w) 1 Priority2-Day3-Day17 (w) 1 Priority2-Day3-Day18 (w) 1 Priority2-Day3-Day19 (w) 1 Priority2-Day3-Day20 (w) 1 Priority2-Day4-Day7 (w) 1 Priority2-Day4-Day8 (w) 1 Priority2-Day4-Day9 (w) 1 Priority2-Day4-Day10 (w) 1 Priority2-Day4-Day11 (w) 1 Priority2-Day4-Day12 (w) 1 Priority2-Day4-Day13 (w) 1 Priority2-Day4-Day14 (w) 1 Priority2-Day4-Day15 (w) 1 Priority2-Day4-Day16 (w) 1 Priority2-Day4-Day17 (w) 1 Priority2-Day4-Day18 (w) 1 Priority2-Day4-Day19 (w) 1 Priority2-Day4-Day20 (w) 1 Priority2-Day5-Day9 (w) 1 Priority2-Day5-Day10 (w) 1 Priority2-Day5-Day11 (w) 1 Priority2-Day5-Day12 (w) 1 Priority2-Day5-Day13 (w) 1 Priority2-Day5-Day14 (w) 1 Priority2-Day5-Day15 (w) 1 Priority2-Day5-Day16 (w) 1 Priority2-Day5-Day17 (w) 1 Priority2-Day5-Day18 (w) 1 Priority2-Day5-Day19 (w) 1 Priority2-Day5-Day20 (w) 1 Priority2-Day6-Day9 (w) 1 Priority2-Day6-Day10 (w) 1 Priority2-Day6-Day11 (w) 1 Priority2-Day6-Day12 (w) 1 Priority2-Day6-Day13 (w) 1 Priority2-Day6-Day14 (w) 1 Priority2-Day6-Day15 (w) 1 Priority2-Day6-Day16 (w) 1 Priority2-Day6-Day17 (w) 1 Priority2-Day6-Day18 (w) 1 Priority2-Day6-Day19 (w) 1 Priority2-Day6-Day20 (w) 1 Priority3-Day1-Day7 (w) 1 Priority3-Day1-Day8 (w) 1 Priority3-Day1-Day9 (w) 1 Priority3-Day1-Day10 (w) 1 Priority3-Day1-Day11 (w) 1 Priority3-Day1-Day12 (w) 1 Priority3-Day1-Day13 (w) 1 Priority3-Day1-Day14 (w) 1 Priority3-Day1-Day15 (w) 1 Priority3-Day1-Day16 (w) 1 Priority3-Day1-Day17 (w) 1 Priority3-Day1-Day18 (w) 1 Priority3-Day1-Day19 (w) 1 Priority3-Day1-Day20 (w) 1 Priority3-Day2-Day7 (w) 1 Priority3-Day2-Day8 (w) 1 Priority3-Day2-Day9 (w) 1 Priority3-Day2-Day10 (w) 1 Priority3-Day2-Day11 (w) 1 Priority3-Day2-Day12 (w) 1 Priority3-Day2-Day13 (w) 1 Priority3-Day2-Day14 (w) 1 Priority3-Day2-Day15 (w) 1 Priority3-Day2-Day16 (w) 1 Priority3-Day2-Day17 (w) 1 Priority3-Day2-Day18 (w) 1 Priority3-Day2-Day19 (w) 1 Priority3-Day2-Day20 (w) 1 Priority3-Day3-Day9 (w) 1 Priority3-Day3-Day10 (w) 1 Priority3-Day3-Day11 (w) 1 Priority3-Day3-Day12 (w) 1 Priority3-Day3-Day13 (w) 1 Priority3-Day3-Day14 (w) 1 Priority3-Day3-Day15 (w) 1 Priority3-Day3-Day16 (w) 1 Priority3-Day3-Day17 (w) 1 Priority3-Day3-Day18 (w) 1 Priority3-Day3-Day19 (w) 1 Priority3-Day3-Day20 (w) 1 Priority3-Day4-Day9 (w) 1 Priority3-Day4-Day10 (w) 1 Priority3-Day4-Day11 (w) 1 Priority3-Day4-Day12 (w) 1 Priority3-Day4-Day13 (w) 1 Priority3-Day4-Day14 (w) 1 Priority3-Day4-Day15 (w) 1 Priority3-Day4-Day16 (w) 1 Priority3-Day4-Day17 (w) 1 Priority3-Day4-Day18 (w) 1 Priority3-Day4-Day19 (w) 1 Priority3-Day4-Day20 (w) 1 Priority3-Day5-Day9 (w) 1 Priority3-Day5-Day10 (w) 1 Priority3-Day5-Day11 (w) 1 Priority3-Day5-Day12 (w) 1 Priority3-Day5-Day13 (w) 1 Priority3-Day5-Day14 (w) 1 Priority3-Day5-Day15 (w) 1 Priority3-Day5-Day16 (w) 1 Priority3-Day5-Day17 (w) 1 Priority3-Day5-Day18 (w) 1 Priority3-Day5-Day19 (w) 1 Priority3-Day5-Day20 (w) 1 Priority3-Day6-Day10 (w) 1 Priority3-Day6-Day11 (w) 1 Priority3-Day6-Day12 (w) 1 Priority3-Day6-Day13 (w) 1 Priority3-Day6-Day14 (w) 1 Priority3-Day6-Day15 (w) 1 Priority3-Day6-Day16 (w) 1 Priority3-Day6-Day17 (w) 1 Priority3-Day6-Day18 (w) 1 Priority3-Day6-Day19 (w) 1 Priority3-Day6-Day20 (w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Gurobi 7.0.2 (mac64, Python) logging started Fri Apr 28 11:54:09 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1167 rows and 575 columns Presolve time: 0.06s Presolved: 771 rows, 523 columns, 7547 nonzeros Variable types: 0 continuous, 523 integer (234 binary) Root relaxation: objective 2.515000e+03, 346 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 2515.0000000 2515.00000 0.00% - 0s Explored 0 nodes (350 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 2: 2515 7500 Pool objective bound 2515 Optimal solution found (tolerance 1.00e-04) Best objective 2.515000000000e+03, best bound 2.515000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day1--Day1 7 Priority1--Day2--Day2 2 Priority1--Day3--Day3 3 Priority1--Day4--Day4 2 Priority2--Day1--Day1 4 Priority1-Day2-Day2 5 Priority1-Day3-Day3 1 Priority1-Day4-Day4 4 Priority1-Day5-Day5 3 Priority1-Day6-Day6 3 Priority2-Day1-Day1 5 Priority2-Day2-Day2 1 Priority2-Day3-Day3 5 Priority2-Day5-Day5 3 Priority2-Day5-Day7 1 Priority2-Day5-Day9 1 Priority2-Day6-Day6 1 Priority2-Day6-Day10 1 Priority3-Day1-Day1 1 Priority3-Day2-Day2 1 Priority3-Day2-Day7 3 Priority3-Day2-Day8 2 Priority3-Day3-Day9 4 Priority3-Day4-Day10 2 Priority3-Day5-Day11 3 Priority3-Day6-Day12 7 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 1 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 2 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day5(r) 3 Priority2-Day1-Day6(r) 3 Priority2-Day1-Day7(r) 3 Priority2-Day1-Day8(r) 3 Priority2-Day1-Day9(r) 3 Priority2-Day1-Day10(r) 3 Priority2-Day1-Day11(r) 3 Priority2-Day1-Day12(r) 3 Priority2-Day1-Day13(r) 3 Priority2-Day1-Day14(r) 3 Priority2-Day1-Day15(r) 3 Priority2-Day1-Day16(r) 3 Priority2-Day1-Day17(r) 3 Priority2-Day1-Day18(r) 3 Priority2-Day1-Day19(r) 3 Priority2-Day1-Day20(r) 3 Priority2-Day5-Day7(r) 1 Priority2-Day5-Day8(r) 1 Priority2-Day5-Day9(r) 2 Priority2-Day5-Day10(r) 2 Priority2-Day5-Day11(r) 2 Priority2-Day5-Day12(r) 2 Priority2-Day5-Day13(r) 2 Priority2-Day5-Day14(r) 2 Priority2-Day5-Day15(r) 2 Priority2-Day5-Day16(r) 2 Priority2-Day5-Day17(r) 2 Priority2-Day5-Day18(r) 2 Priority2-Day5-Day19(r) 2 Priority2-Day5-Day20(r) 2 Priority2-Day6-Day10(r) 1 Priority2-Day6-Day11(r) 1 Priority2-Day6-Day12(r) 1 Priority2-Day6-Day13(r) 1 Priority2-Day6-Day14(r) 1 Priority2-Day6-Day15(r) 1 Priority2-Day6-Day16(r) 1 Priority2-Day6-Day17(r) 1 Priority2-Day6-Day18(r) 1 Priority2-Day6-Day19(r) 1 Priority2-Day6-Day20(r) 1 Priority3-Day2-Day7(r) 3 Priority3-Day2-Day8(r) 5 Priority3-Day2-Day9(r) 5 Priority3-Day2-Day10(r) 5 Priority3-Day2-Day11(r) 5 Priority3-Day2-Day12(r) 5 Priority3-Day2-Day13(r) 5 Priority3-Day2-Day14(r) 5 Priority3-Day2-Day15(r) 5 Priority3-Day2-Day16(r) 5 Priority3-Day2-Day17(r) 5 Priority3-Day2-Day18(r) 5 Priority3-Day2-Day19(r) 5 Priority3-Day2-Day20(r) 5 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day4-Day5(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day5-Day7(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority2-Day6-Day10(w) 1 Priority2-Day6-Day11(w) 1 Priority2-Day6-Day12(w) 1 Priority2-Day6-Day13(w) 1 Priority2-Day6-Day14(w) 1 Priority2-Day6-Day15(w) 1 Priority2-Day6-Day16(w) 1 Priority2-Day6-Day17(w) 1 Priority2-Day6-Day18(w) 1 Priority2-Day6-Day19(w) 1 Priority2-Day6-Day20(w) 1 Priority3-Day2-Day7(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1344 rows and 689 columns Presolve time: 0.05s Presolved: 594 rows, 409 columns, 7366 nonzeros Variable types: 0 continuous, 409 integer (190 binary) Root relaxation: objective 4.450000e+03, 292 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 4450.00000 0 3 7500.00000 4450.00000 40.7% - 0s H 0 0 4505.0000000 4450.00000 1.22% - 0s H 0 0 4470.0000000 4450.00000 0.45% - 0s 0 0 4452.40088 0 16 4470.00000 4452.40088 0.39% - 0s 0 0 4452.40088 0 15 4470.00000 4452.40088 0.39% - 0s 0 0 4462.01550 0 17 4470.00000 4462.01550 0.18% - 0s Explored 0 nodes (388 simplex iterations) in 0.15 seconds Thread count was 4 (of 4 available processors) Solution count 4: 4470 4470 4505 7500 Pool objective bound 4470 Optimal solution found (tolerance 1.00e-04) Best objective 4.470000000000e+03, best bound 4.470000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day1--Day1 3 Priority1--Day2--Day2 5 Priority1--Day4--Day4 5 Priority1--Day6--Day6 1 Priority2--Day1--Day1 9 Priority2--Day2--Day2 1 Priority2--Day3--Day3 4 Priority2--Day5--Day5 4 Priority2--Day6--Day6 2 Priority3--Day1--Day1 1 Priority3--Day2--Day2 6 Priority1-Day1-Day1 4 Priority1-Day2-Day2 2 Priority1-Day3-Day3 4 Priority1-Day4-Day4 1 Priority1-Day5-Day5 3 Priority1-Day6-Day6 2 Priority2-Day3-Day3 1 Priority2-Day5-Day5 1 Priority3-Day3-Day8 1 Priority3-Day3-Day9 3 Priority3-Day4-Day10 2 Priority3-Day5-Day10 2 Priority3-Day5-Day11 1 Priority3-Day6-Day7 3 Priority3-Day6-Day10 2 Priority3-Day6-Day12 2 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 3 Priority1-Day1-Day3(r) 1 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 5 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 5 Priority1-Day4-Day6(r) 1 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority1-Day6-Day7(r) 1 Priority2-Day1-Day3(r) 4 Priority2-Day1-Day4(r) 5 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day2-Day6(r) 1 Priority2-Day2-Day7(r) 1 Priority2-Day2-Day8(r) 1 Priority2-Day2-Day9(r) 1 Priority2-Day2-Day10(r) 1 Priority2-Day2-Day11(r) 1 Priority2-Day2-Day12(r) 1 Priority2-Day2-Day13(r) 1 Priority2-Day2-Day14(r) 1 Priority2-Day2-Day15(r) 1 Priority2-Day2-Day16(r) 1 Priority2-Day2-Day17(r) 1 Priority2-Day2-Day18(r) 1 Priority2-Day2-Day19(r) 1 Priority2-Day2-Day20(r) 1 Priority2-Day3-Day6(r) 1 Priority2-Day3-Day7(r) 4 Priority2-Day3-Day8(r) 4 Priority2-Day3-Day9(r) 4 Priority2-Day3-Day10(r) 4 Priority2-Day3-Day11(r) 4 Priority2-Day3-Day12(r) 4 Priority2-Day3-Day13(r) 4 Priority2-Day3-Day14(r) 4 Priority2-Day3-Day15(r) 4 Priority2-Day3-Day16(r) 4 Priority2-Day3-Day17(r) 4 Priority2-Day3-Day18(r) 4 Priority2-Day3-Day19(r) 4 Priority2-Day3-Day20(r) 4 Priority2-Day5-Day6(r) 1 Priority2-Day5-Day7(r) 4 Priority2-Day5-Day8(r) 4 Priority2-Day5-Day9(r) 4 Priority2-Day5-Day10(r) 4 Priority2-Day5-Day11(r) 4 Priority2-Day5-Day12(r) 4 Priority2-Day5-Day13(r) 4 Priority2-Day5-Day14(r) 4 Priority2-Day5-Day15(r) 4 Priority2-Day5-Day16(r) 4 Priority2-Day5-Day17(r) 4 Priority2-Day5-Day18(r) 4 Priority2-Day5-Day19(r) 4 Priority2-Day5-Day20(r) 4 Priority2-Day6-Day10(r) 2 Priority2-Day6-Day11(r) 2 Priority2-Day6-Day12(r) 2 Priority2-Day6-Day13(r) 2 Priority2-Day6-Day14(r) 2 Priority2-Day6-Day15(r) 2 Priority2-Day6-Day16(r) 2 Priority2-Day6-Day17(r) 2 Priority2-Day6-Day18(r) 2 Priority2-Day6-Day19(r) 2 Priority2-Day6-Day20(r) 2 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day6(r) 2 Priority3-Day2-Day7(r) 5 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day8(r) 1 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day10(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day7(r) 3 Priority3-Day6-Day8(r) 3 Priority3-Day6-Day9(r) 3 Priority3-Day6-Day10(r) 5 Priority3-Day6-Day11(r) 5 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day1-Day3(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day2-Day3(w) 1 Priority1-Day2-Day4(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day4-Day5(w) 1 Priority1-Day4-Day6(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority1-Day6-Day7(w) 1 Priority2-Day1-Day3(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day2-Day6(w) 1 Priority2-Day2-Day7(w) 1 Priority2-Day2-Day8(w) 1 Priority2-Day2-Day9(w) 1 Priority2-Day2-Day10(w) 1 Priority2-Day2-Day11(w) 1 Priority2-Day2-Day12(w) 1 Priority2-Day2-Day13(w) 1 Priority2-Day2-Day14(w) 1 Priority2-Day2-Day15(w) 1 Priority2-Day2-Day16(w) 1 Priority2-Day2-Day17(w) 1 Priority2-Day2-Day18(w) 1 Priority2-Day2-Day19(w) 1 Priority2-Day2-Day20(w) 1 Priority2-Day3-Day6(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day6(w) 1 Priority2-Day5-Day7(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority2-Day6-Day8(w) 1 Priority2-Day6-Day10(w) 1 Priority2-Day6-Day11(w) 1 Priority2-Day6-Day12(w) 1 Priority2-Day6-Day13(w) 1 Priority2-Day6-Day14(w) 1 Priority2-Day6-Day15(w) 1 Priority2-Day6-Day16(w) 1 Priority2-Day6-Day17(w) 1 Priority2-Day6-Day18(w) 1 Priority2-Day6-Day19(w) 1 Priority2-Day6-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day5(w) 1 Priority3-Day2-Day6(w) 1 Priority3-Day2-Day7(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day7(w) 1 Priority3-Day3-Day8(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day10(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day7(w) 1 Priority3-Day6-Day8(w) 1 Priority3-Day6-Day9(w) 1 Priority3-Day6-Day10(w) 1 Priority3-Day6-Day11(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1251 rows and 643 columns Presolve time: 0.03s Presolved: 687 rows, 455 columns, 6156 nonzeros Variable types: 0 continuous, 455 integer (202 binary) Root relaxation: objective 2.405000e+03, 293 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2405.00000 0 3 7500.00000 2405.00000 67.9% - 0s H 0 0 2600.0000000 2405.00000 7.50% - 0s H 0 0 2575.0000000 2405.00000 6.60% - 0s 0 0 2405.00000 0 26 2575.00000 2405.00000 6.60% - 0s H 0 0 2495.0000000 2405.00000 3.61% - 0s 0 0 2405.00000 0 36 2495.00000 2405.00000 3.61% - 0s 0 0 2405.00000 0 1 2495.00000 2405.00000 3.61% - 0s H 0 0 2425.0000000 2405.00000 0.82% - 0s H 0 0 2415.0000000 2405.00000 0.41% - 0s 0 0 2405.00000 0 3 2415.00000 2405.00000 0.41% - 0s Cutting planes: Gomory: 1 Implied bound: 1 MIR: 1 Explored 0 nodes (482 simplex iterations) in 0.12 seconds Thread count was 4 (of 4 available processors) Solution count 7: 2415 2425 2495 ... 7500 Pool objective bound 2415 Optimal solution found (tolerance 1.00e-04) Best objective 2.415000000000e+03, best bound 2.415000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day3--Day3 3 Priority1--Day5--Day5 2 Priority2--Day1--Day1 8 Priority2--Day5--Day5 2 Priority2--Day6--Day6 1 Priority3--Day1--Day1 1 Priority3--Day2--Day2 1 Priority1-Day1-Day1 7 Priority1-Day2-Day2 7 Priority1-Day3-Day3 1 Priority1-Day4-Day4 6 Priority1-Day5-Day5 1 Priority1-Day6-Day6 3 Priority2-Day1-Day1 1 Priority2-Day2-Day2 1 Priority2-Day3-Day3 5 Priority2-Day5-Day5 1 Priority2-Day5-Day7 2 Priority2-Day6-Day6 1 Priority3-Day2-Day8 5 Priority3-Day3-Day9 4 Priority3-Day4-Day10 2 Priority3-Day5-Day11 3 Priority3-Day6-Day8 1 Priority3-Day6-Day9 1 Priority3-Day6-Day10 1 Priority3-Day6-Day11 2 Priority3-Day6-Day12 2 Priority1-Day1-Day1(r) 7 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day5-Day6(r) 1 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day4(r) 6 Priority2-Day1-Day5(r) 8 Priority2-Day1-Day6(r) 8 Priority2-Day1-Day7(r) 8 Priority2-Day1-Day8(r) 8 Priority2-Day1-Day9(r) 8 Priority2-Day1-Day10(r) 8 Priority2-Day1-Day11(r) 8 Priority2-Day1-Day12(r) 8 Priority2-Day1-Day13(r) 8 Priority2-Day1-Day14(r) 8 Priority2-Day1-Day15(r) 8 Priority2-Day1-Day16(r) 8 Priority2-Day1-Day17(r) 8 Priority2-Day1-Day18(r) 8 Priority2-Day1-Day19(r) 8 Priority2-Day1-Day20(r) 8 Priority2-Day5-Day7(r) 2 Priority2-Day5-Day8(r) 3 Priority2-Day5-Day9(r) 4 Priority2-Day5-Day10(r) 4 Priority2-Day5-Day11(r) 4 Priority2-Day5-Day12(r) 4 Priority2-Day5-Day13(r) 4 Priority2-Day5-Day14(r) 4 Priority2-Day5-Day15(r) 4 Priority2-Day5-Day16(r) 4 Priority2-Day5-Day17(r) 4 Priority2-Day5-Day18(r) 4 Priority2-Day5-Day19(r) 4 Priority2-Day5-Day20(r) 4 Priority2-Day6-Day10(r) 1 Priority2-Day6-Day11(r) 1 Priority2-Day6-Day12(r) 1 Priority2-Day6-Day13(r) 1 Priority2-Day6-Day14(r) 1 Priority2-Day6-Day15(r) 1 Priority2-Day6-Day16(r) 1 Priority2-Day6-Day17(r) 1 Priority2-Day6-Day18(r) 1 Priority2-Day6-Day19(r) 1 Priority2-Day6-Day20(r) 1 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day8(r) 1 Priority3-Day6-Day9(r) 2 Priority3-Day6-Day10(r) 3 Priority3-Day6-Day11(r) 5 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day4-Day5(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day5-Day6(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day6(w) 1 Priority2-Day5-Day7(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority2-Day6-Day9(w) 1 Priority2-Day6-Day10(w) 1 Priority2-Day6-Day11(w) 1 Priority2-Day6-Day12(w) 1 Priority2-Day6-Day13(w) 1 Priority2-Day6-Day14(w) 1 Priority2-Day6-Day15(w) 1 Priority2-Day6-Day16(w) 1 Priority2-Day6-Day17(w) 1 Priority2-Day6-Day18(w) 1 Priority2-Day6-Day19(w) 1 Priority2-Day6-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day7(w) 1 Priority3-Day6-Day8(w) 1 Priority3-Day6-Day9(w) 1 Priority3-Day6-Day10(w) 1 Priority3-Day6-Day11(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 687 rows, 368 columns and 3378 nonzeros Variable types: 0 continuous, 368 integer (122 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 519 rows and 266 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 687 rows, 368 columns and 3378 nonzeros Variable types: 0 continuous, 368 integer (122 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 687 rows and 368 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 890 Pool objective bound 890 Optimal solution found (tolerance 1.00e-04) Best objective 8.900000000000e+02, best bound 8.900000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 687 rows, 368 columns and 3378 nonzeros Variable types: 0 continuous, 368 integer (122 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 687 rows and 368 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 700 Pool objective bound 700 Optimal solution found (tolerance 1.00e-04) Best objective 7.000000000000e+02, best bound 7.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 687 rows, 368 columns and 3378 nonzeros Variable types: 0 continuous, 368 integer (122 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 683 rows and 364 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 687 rows, 368 columns and 3378 nonzeros Variable types: 0 continuous, 368 integer (122 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 614 rows and 325 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 687 rows, 368 columns and 3378 nonzeros Variable types: 0 continuous, 368 integer (122 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 586 rows and 300 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 687 rows, 368 columns and 3378 nonzeros Variable types: 0 continuous, 368 integer (122 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 642 rows and 335 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 687 rows, 368 columns and 3378 nonzeros Variable types: 0 continuous, 368 integer (122 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 564 rows and 294 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1134 rows and 525 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1435 rows and 754 columns Presolve time: 0.05s Presolved: 503 rows, 344 columns, 4017 nonzeros Variable types: 0 continuous, 344 integer (154 binary) Root relaxation: objective 2.650000e+03, 253 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2650.00000 0 2 7500.00000 2650.00000 64.7% - 0s H 0 0 2680.0000000 2650.00000 1.12% - 0s 0 0 2657.00000 0 26 2680.00000 2657.00000 0.86% - 0s 0 0 2673.57143 0 3 2680.00000 2673.57143 0.24% - 0s Explored 0 nodes (300 simplex iterations) in 0.10 seconds Thread count was 4 (of 4 available processors) Solution count 2: 2680 7500 Pool objective bound 2680 Optimal solution found (tolerance 1.00e-04) Best objective 2.680000000000e+03, best bound 2.680000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day1--Day1 3 Priority1--Day2--Day2 1 Priority1--Day3--Day3 3 Priority2--Day1--Day1 9 Priority1-Day1-Day1 4 Priority1-Day2-Day2 6 Priority1-Day3-Day3 1 Priority1-Day4-Day4 5 Priority1-Day4-Day5 1 Priority1-Day5-Day5 3 Priority1-Day6-Day6 3 Priority2-Day2-Day6 1 Priority2-Day3-Day7 5 Priority2-Day5-Day6 3 Priority2-Day5-Day8 2 Priority2-Day6-Day6 1 Priority2-Day6-Day10 1 Priority3-Day1-Day7 1 Priority3-Day2-Day8 6 Priority3-Day3-Day9 4 Priority3-Day4-Day10 2 Priority3-Day5-Day11 3 Priority3-Day6-Day11 1 Priority3-Day6-Day12 6 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 3 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 1 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day3-Day4(r) 3 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 1 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day4(r) 5 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day2-Day6(r) 1 Priority2-Day2-Day7(r) 1 Priority2-Day2-Day8(r) 1 Priority2-Day2-Day9(r) 1 Priority2-Day2-Day10(r) 1 Priority2-Day2-Day11(r) 1 Priority2-Day2-Day12(r) 1 Priority2-Day2-Day13(r) 1 Priority2-Day2-Day14(r) 1 Priority2-Day2-Day15(r) 1 Priority2-Day2-Day16(r) 1 Priority2-Day2-Day17(r) 1 Priority2-Day2-Day18(r) 1 Priority2-Day2-Day19(r) 1 Priority2-Day2-Day20(r) 1 Priority2-Day3-Day7(r) 5 Priority2-Day3-Day8(r) 5 Priority2-Day3-Day9(r) 5 Priority2-Day3-Day10(r) 5 Priority2-Day3-Day11(r) 5 Priority2-Day3-Day12(r) 5 Priority2-Day3-Day13(r) 5 Priority2-Day3-Day14(r) 5 Priority2-Day3-Day15(r) 5 Priority2-Day3-Day16(r) 5 Priority2-Day3-Day17(r) 5 Priority2-Day3-Day18(r) 5 Priority2-Day3-Day19(r) 5 Priority2-Day3-Day20(r) 5 Priority2-Day5-Day6(r) 3 Priority2-Day5-Day7(r) 3 Priority2-Day5-Day8(r) 5 Priority2-Day5-Day9(r) 5 Priority2-Day5-Day10(r) 5 Priority2-Day5-Day11(r) 5 Priority2-Day5-Day12(r) 5 Priority2-Day5-Day13(r) 5 Priority2-Day5-Day14(r) 5 Priority2-Day5-Day15(r) 5 Priority2-Day5-Day16(r) 5 Priority2-Day5-Day17(r) 5 Priority2-Day5-Day18(r) 5 Priority2-Day5-Day19(r) 5 Priority2-Day5-Day20(r) 5 Priority2-Day6-Day10(r) 1 Priority2-Day6-Day11(r) 1 Priority2-Day6-Day12(r) 1 Priority2-Day6-Day13(r) 1 Priority2-Day6-Day14(r) 1 Priority2-Day6-Day15(r) 1 Priority2-Day6-Day16(r) 1 Priority2-Day6-Day17(r) 1 Priority2-Day6-Day18(r) 1 Priority2-Day6-Day19(r) 1 Priority2-Day6-Day20(r) 1 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day11(r) 1 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day2-Day3(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day3-Day4(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day4-Day5(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day2-Day6(w) 1 Priority2-Day2-Day7(w) 1 Priority2-Day2-Day8(w) 1 Priority2-Day2-Day9(w) 1 Priority2-Day2-Day10(w) 1 Priority2-Day2-Day11(w) 1 Priority2-Day2-Day12(w) 1 Priority2-Day2-Day13(w) 1 Priority2-Day2-Day14(w) 1 Priority2-Day2-Day15(w) 1 Priority2-Day2-Day16(w) 1 Priority2-Day2-Day17(w) 1 Priority2-Day2-Day18(w) 1 Priority2-Day2-Day19(w) 1 Priority2-Day2-Day20(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day6(w) 1 Priority2-Day5-Day7(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority2-Day6-Day10(w) 1 Priority2-Day6-Day11(w) 1 Priority2-Day6-Day12(w) 1 Priority2-Day6-Day13(w) 1 Priority2-Day6-Day14(w) 1 Priority2-Day6-Day15(w) 1 Priority2-Day6-Day16(w) 1 Priority2-Day6-Day17(w) 1 Priority2-Day6-Day18(w) 1 Priority2-Day6-Day19(w) 1 Priority2-Day6-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day11(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7430 Presolve removed 1371 rows and 710 columns Presolve time: 0.05s Presolved: 567 rows, 388 columns, 4789 nonzeros Variable types: 0 continuous, 388 integer (176 binary) Root relaxation: objective 2.775500e+03, 309 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2775.50000 0 13 7430.00000 2775.50000 62.6% - 0s H 0 0 3000.0000000 2775.50000 7.48% - 0s 0 0 2790.00000 0 1 3000.00000 2790.00000 7.00% - 0s H 0 0 2875.0000000 2790.00000 2.96% - 0s 0 0 2790.00000 0 3 2875.00000 2790.00000 2.96% - 0s 0 0 2790.00000 0 1 2875.00000 2790.00000 2.96% - 0s H 0 0 2835.0000000 2790.00000 1.59% - 0s 0 0 2790.00000 0 8 2835.00000 2790.00000 1.59% - 0s 0 0 2790.00000 0 8 2835.00000 2790.00000 1.59% - 0s 0 0 2793.33333 0 5 2835.00000 2793.33333 1.47% - 0s H 0 0 2825.0000000 2793.33333 1.12% - 0s * 0 0 0 2795.0000000 2795.00000 0.00% - 0s Cutting planes: Gomory: 1 Implied bound: 2 MIR: 7 Flow cover: 1 Explored 0 nodes (546 simplex iterations) in 0.16 seconds Thread count was 4 (of 4 available processors) Solution count 6: 2795 2825 2835 ... 7430 Pool objective bound 2795 Optimal solution found (tolerance 1.00e-04) Best objective 2.795000000000e+03, best bound 2.795000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day1--Day1 3 Priority1--Day2--Day2 4 Priority1--Day4--Day4 1 Priority2--Day1--Day1 8 Priority1-Day1-Day1 4 Priority1-Day2-Day2 2 Priority1-Day2-Day3 1 Priority1-Day3-Day3 4 Priority1-Day4-Day4 1 Priority1-Day4-Day5 4 Priority1-Day5-Day5 3 Priority1-Day6-Day6 3 Priority2-Day1-Day3 1 Priority2-Day2-Day6 1 Priority2-Day3-Day7 5 Priority2-Day5-Day6 3 Priority2-Day5-Day7 2 Priority2-Day6-Day10 2 Priority3-Day1-Day7 1 Priority3-Day2-Day8 6 Priority3-Day3-Day8 2 Priority3-Day3-Day9 2 Priority3-Day4-Day10 2 Priority3-Day5-Day11 3 Priority3-Day6-Day11 4 Priority3-Day6-Day12 3 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 3 Priority1-Day1-Day3(r) 1 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 5 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 5 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day3(r) 1 Priority2-Day1-Day4(r) 2 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day2-Day6(r) 1 Priority2-Day2-Day7(r) 1 Priority2-Day2-Day8(r) 1 Priority2-Day2-Day9(r) 1 Priority2-Day2-Day10(r) 1 Priority2-Day2-Day11(r) 1 Priority2-Day2-Day12(r) 1 Priority2-Day2-Day13(r) 1 Priority2-Day2-Day14(r) 1 Priority2-Day2-Day15(r) 1 Priority2-Day2-Day16(r) 1 Priority2-Day2-Day17(r) 1 Priority2-Day2-Day18(r) 1 Priority2-Day2-Day19(r) 1 Priority2-Day2-Day20(r) 1 Priority2-Day3-Day7(r) 5 Priority2-Day3-Day8(r) 5 Priority2-Day3-Day9(r) 5 Priority2-Day3-Day10(r) 5 Priority2-Day3-Day11(r) 5 Priority2-Day3-Day12(r) 5 Priority2-Day3-Day13(r) 5 Priority2-Day3-Day14(r) 5 Priority2-Day3-Day15(r) 5 Priority2-Day3-Day16(r) 5 Priority2-Day3-Day17(r) 5 Priority2-Day3-Day18(r) 5 Priority2-Day3-Day19(r) 5 Priority2-Day3-Day20(r) 5 Priority2-Day5-Day6(r) 3 Priority2-Day5-Day7(r) 5 Priority2-Day5-Day8(r) 5 Priority2-Day5-Day9(r) 5 Priority2-Day5-Day10(r) 5 Priority2-Day5-Day11(r) 5 Priority2-Day5-Day12(r) 5 Priority2-Day5-Day13(r) 5 Priority2-Day5-Day14(r) 5 Priority2-Day5-Day15(r) 5 Priority2-Day5-Day16(r) 5 Priority2-Day5-Day17(r) 5 Priority2-Day5-Day18(r) 5 Priority2-Day5-Day19(r) 5 Priority2-Day5-Day20(r) 5 Priority2-Day6-Day10(r) 2 Priority2-Day6-Day11(r) 2 Priority2-Day6-Day12(r) 2 Priority2-Day6-Day13(r) 2 Priority2-Day6-Day14(r) 2 Priority2-Day6-Day15(r) 2 Priority2-Day6-Day16(r) 2 Priority2-Day6-Day17(r) 2 Priority2-Day6-Day18(r) 2 Priority2-Day6-Day19(r) 2 Priority2-Day6-Day20(r) 2 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day8(r) 2 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day11(r) 4 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day1-Day3(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day2-Day3(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day4-Day5(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day5-Day6(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority2-Day1-Day3(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day2-Day6(w) 1 Priority2-Day2-Day7(w) 1 Priority2-Day2-Day8(w) 1 Priority2-Day2-Day9(w) 1 Priority2-Day2-Day10(w) 1 Priority2-Day2-Day11(w) 1 Priority2-Day2-Day12(w) 1 Priority2-Day2-Day13(w) 1 Priority2-Day2-Day14(w) 1 Priority2-Day2-Day15(w) 1 Priority2-Day2-Day16(w) 1 Priority2-Day2-Day17(w) 1 Priority2-Day2-Day18(w) 1 Priority2-Day2-Day19(w) 1 Priority2-Day2-Day20(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day6(w) 1 Priority2-Day5-Day7(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority2-Day6-Day10(w) 1 Priority2-Day6-Day11(w) 1 Priority2-Day6-Day12(w) 1 Priority2-Day6-Day13(w) 1 Priority2-Day6-Day14(w) 1 Priority2-Day6-Day15(w) 1 Priority2-Day6-Day16(w) 1 Priority2-Day6-Day17(w) 1 Priority2-Day6-Day18(w) 1 Priority2-Day6-Day19(w) 1 Priority2-Day6-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day8(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day11(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1304 rows and 665 columns Presolve time: 0.03s Presolved: 634 rows, 433 columns, 4988 nonzeros Variable types: 0 continuous, 433 integer (190 binary) Root relaxation: objective 2.150000e+03, 371 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2150.00000 0 3 7500.00000 2150.00000 71.3% - 0s H 0 0 2270.0000000 2150.00000 5.29% - 0s 0 0 2178.01948 0 26 2270.00000 2178.01948 4.05% - 0s 0 0 2215.00000 0 1 2270.00000 2215.00000 2.42% - 0s 0 0 2215.00000 0 6 2270.00000 2215.00000 2.42% - 0s 0 0 2217.66667 0 11 2270.00000 2217.66667 2.31% - 0s 0 0 2238.75000 0 11 2270.00000 2238.75000 1.38% - 0s 0 0 2240.57143 0 16 2270.00000 2240.57143 1.30% - 0s 0 0 2240.57143 0 16 2270.00000 2240.57143 1.30% - 0s 0 0 2240.57143 0 16 2270.00000 2240.57143 1.30% - 0s H 0 0 2260.0000000 2240.57143 0.86% - 0s 0 0 2240.57143 0 16 2260.00000 2240.57143 0.86% - 0s 0 0 2240.57143 0 17 2260.00000 2240.57143 0.86% - 0s 0 0 2240.57143 0 1 2260.00000 2240.57143 0.86% - 0s 0 0 2243.33333 0 12 2260.00000 2243.33333 0.74% - 0s Cutting planes: Gomory: 2 Implied bound: 1 MIR: 2 Explored 0 nodes (668 simplex iterations) in 0.18 seconds Thread count was 4 (of 4 available processors) Solution count 4: 2260 2260 2270 7500 Pool objective bound 2260 Optimal solution found (tolerance 1.00e-04) Best objective 2.260000000000e+03, best bound 2.260000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day1--Day1 4 Priority1--Day2--Day2 1 Priority2--Day1--Day1 6 Priority2--Day3--Day3 1 Priority1-Day1-Day1 3 Priority1-Day2-Day2 6 Priority1-Day3-Day3 4 Priority1-Day4-Day4 3 Priority1-Day4-Day5 3 Priority1-Day5-Day5 1 Priority1-Day5-Day6 2 Priority1-Day6-Day6 3 Priority2-Day1-Day5 3 Priority2-Day2-Day6 1 Priority2-Day3-Day3 4 Priority2-Day5-Day7 5 Priority2-Day6-Day6 2 Priority3-Day1-Day7 1 Priority3-Day2-Day8 6 Priority3-Day3-Day7 1 Priority3-Day3-Day8 1 Priority3-Day3-Day9 2 Priority3-Day4-Day10 2 Priority3-Day5-Day11 3 Priority3-Day6-Day12 7 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 4 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 1 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 3 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day5-Day6(r) 2 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day4(r) 2 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day2-Day6(r) 1 Priority2-Day2-Day7(r) 1 Priority2-Day2-Day8(r) 1 Priority2-Day2-Day9(r) 1 Priority2-Day2-Day10(r) 1 Priority2-Day2-Day11(r) 1 Priority2-Day2-Day12(r) 1 Priority2-Day2-Day13(r) 1 Priority2-Day2-Day14(r) 1 Priority2-Day2-Day15(r) 1 Priority2-Day2-Day16(r) 1 Priority2-Day2-Day17(r) 1 Priority2-Day2-Day18(r) 1 Priority2-Day2-Day19(r) 1 Priority2-Day2-Day20(r) 1 Priority2-Day3-Day7(r) 1 Priority2-Day3-Day8(r) 1 Priority2-Day3-Day9(r) 1 Priority2-Day3-Day10(r) 1 Priority2-Day3-Day11(r) 1 Priority2-Day3-Day12(r) 1 Priority2-Day3-Day13(r) 1 Priority2-Day3-Day14(r) 1 Priority2-Day3-Day15(r) 1 Priority2-Day3-Day16(r) 1 Priority2-Day3-Day17(r) 1 Priority2-Day3-Day18(r) 1 Priority2-Day3-Day19(r) 1 Priority2-Day3-Day20(r) 1 Priority2-Day5-Day7(r) 5 Priority2-Day5-Day8(r) 5 Priority2-Day5-Day9(r) 5 Priority2-Day5-Day10(r) 5 Priority2-Day5-Day11(r) 5 Priority2-Day5-Day12(r) 5 Priority2-Day5-Day13(r) 5 Priority2-Day5-Day14(r) 5 Priority2-Day5-Day15(r) 5 Priority2-Day5-Day16(r) 5 Priority2-Day5-Day17(r) 5 Priority2-Day5-Day18(r) 5 Priority2-Day5-Day19(r) 5 Priority2-Day5-Day20(r) 5 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day7(r) 1 Priority3-Day3-Day8(r) 2 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day2-Day3(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day4-Day5(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day5-Day6(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day2-Day6(w) 1 Priority2-Day2-Day7(w) 1 Priority2-Day2-Day8(w) 1 Priority2-Day2-Day9(w) 1 Priority2-Day2-Day10(w) 1 Priority2-Day2-Day11(w) 1 Priority2-Day2-Day12(w) 1 Priority2-Day2-Day13(w) 1 Priority2-Day2-Day14(w) 1 Priority2-Day2-Day15(w) 1 Priority2-Day2-Day16(w) 1 Priority2-Day2-Day17(w) 1 Priority2-Day2-Day18(w) 1 Priority2-Day2-Day19(w) 1 Priority2-Day2-Day20(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day7(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day7(w) 1 Priority3-Day3-Day8(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1511 rows and 805 columns Presolve time: 0.05s Presolved: 427 rows, 293 columns, 4233 nonzeros Variable types: 0 continuous, 293 integer (132 binary) Root relaxation: objective 3.292000e+03, 186 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3292.00000 0 6 7500.00000 3292.00000 56.1% - 0s H 0 0 3325.0000000 3292.00000 0.99% - 0s 0 0 cutoff 0 3325.00000 3320.00333 0.15% - 0s Explored 0 nodes (211 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 2: 3325 7500 Pool objective bound 3325 Optimal solution found (tolerance 1.00e-04) Best objective 3.325000000000e+03, best bound 3.325000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day1--Day1 1 Priority1--Day2--Day2 6 Priority1--Day3--Day3 2 Priority2--Day1--Day1 9 Priority2--Day2--Day2 1 Priority2--Day3--Day3 5 Priority1-Day1-Day1 6 Priority1-Day2-Day2 1 Priority1-Day3-Day3 1 Priority1-Day3-Day4 1 Priority1-Day4-Day4 6 Priority1-Day5-Day5 3 Priority1-Day6-Day6 3 Priority2-Day5-Day7 3 Priority2-Day5-Day9 2 Priority2-Day6-Day10 2 Priority3-Day1-Day7 1 Priority3-Day2-Day7 2 Priority3-Day2-Day8 4 Priority3-Day3-Day9 4 Priority3-Day4-Day10 2 Priority3-Day5-Day11 3 Priority3-Day6-Day12 7 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 1 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 6 Priority1-Day2-Day4(r) 5 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day3-Day4(r) 3 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day4(r) 6 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day2-Day6(r) 1 Priority2-Day2-Day7(r) 1 Priority2-Day2-Day8(r) 1 Priority2-Day2-Day9(r) 1 Priority2-Day2-Day10(r) 1 Priority2-Day2-Day11(r) 1 Priority2-Day2-Day12(r) 1 Priority2-Day2-Day13(r) 1 Priority2-Day2-Day14(r) 1 Priority2-Day2-Day15(r) 1 Priority2-Day2-Day16(r) 1 Priority2-Day2-Day17(r) 1 Priority2-Day2-Day18(r) 1 Priority2-Day2-Day19(r) 1 Priority2-Day2-Day20(r) 1 Priority2-Day3-Day6(r) 2 Priority2-Day3-Day7(r) 5 Priority2-Day3-Day8(r) 5 Priority2-Day3-Day9(r) 5 Priority2-Day3-Day10(r) 5 Priority2-Day3-Day11(r) 5 Priority2-Day3-Day12(r) 5 Priority2-Day3-Day13(r) 5 Priority2-Day3-Day14(r) 5 Priority2-Day3-Day15(r) 5 Priority2-Day3-Day16(r) 5 Priority2-Day3-Day17(r) 5 Priority2-Day3-Day18(r) 5 Priority2-Day3-Day19(r) 5 Priority2-Day3-Day20(r) 5 Priority2-Day5-Day7(r) 3 Priority2-Day5-Day8(r) 3 Priority2-Day5-Day9(r) 5 Priority2-Day5-Day10(r) 5 Priority2-Day5-Day11(r) 5 Priority2-Day5-Day12(r) 5 Priority2-Day5-Day13(r) 5 Priority2-Day5-Day14(r) 5 Priority2-Day5-Day15(r) 5 Priority2-Day5-Day16(r) 5 Priority2-Day5-Day17(r) 5 Priority2-Day5-Day18(r) 5 Priority2-Day5-Day19(r) 5 Priority2-Day5-Day20(r) 5 Priority2-Day6-Day10(r) 2 Priority2-Day6-Day11(r) 2 Priority2-Day6-Day12(r) 2 Priority2-Day6-Day13(r) 2 Priority2-Day6-Day14(r) 2 Priority2-Day6-Day15(r) 2 Priority2-Day6-Day16(r) 2 Priority2-Day6-Day17(r) 2 Priority2-Day6-Day18(r) 2 Priority2-Day6-Day19(r) 2 Priority2-Day6-Day20(r) 2 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day7(r) 2 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day1-Day3(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day2-Day3(w) 1 Priority1-Day2-Day4(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day3-Day4(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day2-Day6(w) 1 Priority2-Day2-Day7(w) 1 Priority2-Day2-Day8(w) 1 Priority2-Day2-Day9(w) 1 Priority2-Day2-Day10(w) 1 Priority2-Day2-Day11(w) 1 Priority2-Day2-Day12(w) 1 Priority2-Day2-Day13(w) 1 Priority2-Day2-Day14(w) 1 Priority2-Day2-Day15(w) 1 Priority2-Day2-Day16(w) 1 Priority2-Day2-Day17(w) 1 Priority2-Day2-Day18(w) 1 Priority2-Day2-Day19(w) 1 Priority2-Day2-Day20(w) 1 Priority2-Day3-Day6(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day7(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority2-Day6-Day10(w) 1 Priority2-Day6-Day11(w) 1 Priority2-Day6-Day12(w) 1 Priority2-Day6-Day13(w) 1 Priority2-Day6-Day14(w) 1 Priority2-Day6-Day15(w) 1 Priority2-Day6-Day16(w) 1 Priority2-Day6-Day17(w) 1 Priority2-Day6-Day18(w) 1 Priority2-Day6-Day19(w) 1 Priority2-Day6-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day7(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1154 rows and 538 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1322 rows and 679 columns Presolve time: 0.05s Presolved: 616 rows, 419 columns, 7202 nonzeros Variable types: 0 continuous, 419 integer (184 binary) Root relaxation: objective 3.415000e+03, 279 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3415.00000 0 1 7500.00000 3415.00000 54.5% - 0s H 0 0 3435.0000000 3415.00000 0.58% - 0s Explored 0 nodes (303 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 2: 3435 7500 Pool objective bound 3435 Optimal solution found (tolerance 1.00e-04) Best objective 3.435000000000e+03, best bound 3.435000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day1--Day1 3 Priority1--Day2--Day2 6 Priority1--Day5--Day5 1 Priority2--Day1--Day1 8 Priority2--Day2--Day2 1 Priority2--Day3--Day3 3 Priority3--Day1--Day1 1 Priority3--Day2--Day2 3 Priority1-Day1-Day1 4 Priority1-Day2-Day2 1 Priority1-Day3-Day3 4 Priority1-Day4-Day4 6 Priority1-Day5-Day5 2 Priority1-Day6-Day6 3 Priority2-Day1-Day4 1 Priority2-Day3-Day3 2 Priority2-Day5-Day7 2 Priority2-Day5-Day9 3 Priority2-Day6-Day10 2 Priority3-Day2-Day8 3 Priority3-Day3-Day9 4 Priority3-Day4-Day10 2 Priority3-Day5-Day10 1 Priority3-Day5-Day11 2 Priority3-Day6-Day12 7 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 3 Priority1-Day1-Day3(r) 2 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 6 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day5-Day6(r) 1 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day4(r) 7 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day2-Day6(r) 1 Priority2-Day2-Day7(r) 1 Priority2-Day2-Day8(r) 1 Priority2-Day2-Day9(r) 1 Priority2-Day2-Day10(r) 1 Priority2-Day2-Day11(r) 1 Priority2-Day2-Day12(r) 1 Priority2-Day2-Day13(r) 1 Priority2-Day2-Day14(r) 1 Priority2-Day2-Day15(r) 1 Priority2-Day2-Day16(r) 1 Priority2-Day2-Day17(r) 1 Priority2-Day2-Day18(r) 1 Priority2-Day2-Day19(r) 1 Priority2-Day2-Day20(r) 1 Priority2-Day3-Day6(r) 1 Priority2-Day3-Day7(r) 3 Priority2-Day3-Day8(r) 3 Priority2-Day3-Day9(r) 3 Priority2-Day3-Day10(r) 3 Priority2-Day3-Day11(r) 3 Priority2-Day3-Day12(r) 3 Priority2-Day3-Day13(r) 3 Priority2-Day3-Day14(r) 3 Priority2-Day3-Day15(r) 3 Priority2-Day3-Day16(r) 3 Priority2-Day3-Day17(r) 3 Priority2-Day3-Day18(r) 3 Priority2-Day3-Day19(r) 3 Priority2-Day3-Day20(r) 3 Priority2-Day5-Day7(r) 2 Priority2-Day5-Day8(r) 2 Priority2-Day5-Day9(r) 5 Priority2-Day5-Day10(r) 5 Priority2-Day5-Day11(r) 5 Priority2-Day5-Day12(r) 5 Priority2-Day5-Day13(r) 5 Priority2-Day5-Day14(r) 5 Priority2-Day5-Day15(r) 5 Priority2-Day5-Day16(r) 5 Priority2-Day5-Day17(r) 5 Priority2-Day5-Day18(r) 5 Priority2-Day5-Day19(r) 5 Priority2-Day5-Day20(r) 5 Priority2-Day6-Day10(r) 2 Priority2-Day6-Day11(r) 2 Priority2-Day6-Day12(r) 2 Priority2-Day6-Day13(r) 2 Priority2-Day6-Day14(r) 2 Priority2-Day6-Day15(r) 2 Priority2-Day6-Day16(r) 2 Priority2-Day6-Day17(r) 2 Priority2-Day6-Day18(r) 2 Priority2-Day6-Day19(r) 2 Priority2-Day6-Day20(r) 2 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day6(r) 1 Priority3-Day2-Day7(r) 3 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day10(r) 1 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day1-Day3(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day2-Day3(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day5-Day6(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority1-Day6-Day7(w) 1 Priority1-Day6-Day8(w) 1 Priority1-Day6-Day9(w) 1 Priority1-Day6-Day10(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day2-Day6(w) 1 Priority2-Day2-Day7(w) 1 Priority2-Day2-Day8(w) 1 Priority2-Day2-Day9(w) 1 Priority2-Day2-Day10(w) 1 Priority2-Day2-Day11(w) 1 Priority2-Day2-Day12(w) 1 Priority2-Day2-Day13(w) 1 Priority2-Day2-Day14(w) 1 Priority2-Day2-Day15(w) 1 Priority2-Day2-Day16(w) 1 Priority2-Day2-Day17(w) 1 Priority2-Day2-Day18(w) 1 Priority2-Day2-Day19(w) 1 Priority2-Day2-Day20(w) 1 Priority2-Day3-Day6(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day7(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority2-Day6-Day10(w) 1 Priority2-Day6-Day11(w) 1 Priority2-Day6-Day12(w) 1 Priority2-Day6-Day13(w) 1 Priority2-Day6-Day14(w) 1 Priority2-Day6-Day15(w) 1 Priority2-Day6-Day16(w) 1 Priority2-Day6-Day17(w) 1 Priority2-Day6-Day18(w) 1 Priority2-Day6-Day19(w) 1 Priority2-Day6-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day6(w) 1 Priority3-Day2-Day7(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day10(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1508 rows and 803 columns Presolve time: 0.06s Presolved: 430 rows, 295 columns, 3573 nonzeros Variable types: 0 continuous, 295 integer (130 binary) Root relaxation: objective 2.015000e+03, 180 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2015.00000 0 3 7500.00000 2015.00000 73.1% - 0s H 0 0 2420.0000000 2015.00000 16.7% - 0s H 0 0 2270.0000000 2015.00000 11.2% - 0s 0 0 2025.00000 0 20 2270.00000 2025.00000 10.8% - 0s H 0 0 2085.0000000 2025.00000 2.88% - 0s 0 0 2028.33333 0 23 2085.00000 2028.33333 2.72% - 0s 0 0 2028.33333 0 12 2085.00000 2028.33333 2.72% - 0s 0 0 2032.50000 0 20 2085.00000 2032.50000 2.52% - 0s 0 0 2032.50000 0 21 2085.00000 2032.50000 2.52% - 0s 0 0 2032.50000 0 23 2085.00000 2032.50000 2.52% - 0s H 0 0 2055.0000000 2032.50000 1.09% - 0s 0 0 2037.00000 0 19 2055.00000 2037.00000 0.88% - 0s 0 0 2037.00000 0 1 2055.00000 2037.00000 0.88% - 0s 0 0 2045.00000 0 8 2055.00000 2045.00000 0.49% - 0s H 0 0 2050.0000000 2045.00000 0.24% - 0s H 0 0 2045.0000000 2045.00000 0.00% - 0s Cutting planes: Implied bound: 2 MIR: 1 Flow cover: 1 Explored 0 nodes (427 simplex iterations) in 0.17 seconds Thread count was 4 (of 4 available processors) Solution count 9: 2045 2050 2055 ... 7500 Pool objective bound 2045 Optimal solution found (tolerance 1.00e-04) Best objective 2.045000000000e+03, best bound 2.045000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day1--Day1 1 Priority2--Day1--Day1 9 Priority2--Day3--Day3 2 Priority1-Day1-Day1 6 Priority1-Day2-Day2 7 Priority1-Day3-Day3 4 Priority1-Day4-Day4 6 Priority1-Day5-Day5 3 Priority1-Day6-Day6 3 Priority2-Day2-Day2 1 Priority2-Day3-Day6 1 Priority2-Day3-Day7 2 Priority2-Day5-Day7 1 Priority2-Day5-Day9 4 Priority2-Day6-Day6 2 Priority3-Day1-Day7 1 Priority3-Day2-Day8 6 Priority3-Day3-Day9 4 Priority3-Day4-Day4 2 Priority3-Day5-Day11 3 Priority3-Day6-Day7 1 Priority3-Day6-Day10 5 Priority3-Day6-Day12 1 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 1 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day4(r) 6 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day3-Day6(r) 1 Priority2-Day3-Day7(r) 5 Priority2-Day3-Day8(r) 5 Priority2-Day3-Day9(r) 5 Priority2-Day3-Day10(r) 5 Priority2-Day3-Day11(r) 5 Priority2-Day3-Day12(r) 5 Priority2-Day3-Day13(r) 5 Priority2-Day3-Day14(r) 5 Priority2-Day3-Day15(r) 5 Priority2-Day3-Day16(r) 5 Priority2-Day3-Day17(r) 5 Priority2-Day3-Day18(r) 5 Priority2-Day3-Day19(r) 5 Priority2-Day3-Day20(r) 5 Priority2-Day5-Day7(r) 1 Priority2-Day5-Day8(r) 1 Priority2-Day5-Day9(r) 5 Priority2-Day5-Day10(r) 5 Priority2-Day5-Day11(r) 5 Priority2-Day5-Day12(r) 5 Priority2-Day5-Day13(r) 5 Priority2-Day5-Day14(r) 5 Priority2-Day5-Day15(r) 5 Priority2-Day5-Day16(r) 5 Priority2-Day5-Day17(r) 5 Priority2-Day5-Day18(r) 5 Priority2-Day5-Day19(r) 5 Priority2-Day5-Day20(r) 5 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day7(r) 1 Priority3-Day6-Day8(r) 1 Priority3-Day6-Day9(r) 1 Priority3-Day6-Day10(r) 6 Priority3-Day6-Day11(r) 6 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day5-Day6(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day3-Day6(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day7(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority2-Day6-Day10(w) 1 Priority2-Day6-Day11(w) 1 Priority2-Day6-Day12(w) 1 Priority2-Day6-Day13(w) 1 Priority2-Day6-Day14(w) 1 Priority2-Day6-Day15(w) 1 Priority2-Day6-Day16(w) 1 Priority2-Day6-Day17(w) 1 Priority2-Day6-Day18(w) 1 Priority2-Day6-Day19(w) 1 Priority2-Day6-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day7(w) 1 Priority3-Day6-Day8(w) 1 Priority3-Day6-Day9(w) 1 Priority3-Day6-Day10(w) 1 Priority3-Day6-Day11(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1332 rows and 683 columns Presolve time: 0.05s Presolved: 606 rows, 415 columns, 4981 nonzeros Variable types: 0 continuous, 415 integer (185 binary) Root relaxation: objective 2.275000e+03, 341 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2275.00000 0 3 7500.00000 2275.00000 69.7% - 0s H 0 0 2665.0000000 2275.00000 14.6% - 0s 0 0 2286.66667 0 17 2665.00000 2286.66667 14.2% - 0s 0 0 2295.21739 0 22 2665.00000 2295.21739 13.9% - 0s 0 0 2295.21739 0 2 2665.00000 2295.21739 13.9% - 0s H 0 0 2635.0000000 2295.21739 12.9% - 0s 0 0 2301.66667 0 11 2635.00000 2301.66667 12.7% - 0s 0 0 2302.97101 0 19 2635.00000 2302.97101 12.6% - 0s 0 0 2310.11111 0 29 2635.00000 2310.11111 12.3% - 0s H 0 0 2365.0000000 2310.11111 2.32% - 0s 0 0 2312.60870 0 19 2365.00000 2312.60870 2.22% - 0s 0 0 2314.79620 0 43 2365.00000 2314.79620 2.12% - 0s 0 0 2317.07928 0 43 2365.00000 2317.07928 2.03% - 0s 0 0 2317.60870 0 21 2365.00000 2317.60870 2.00% - 0s 0 0 2317.60870 0 21 2365.00000 2317.60870 2.00% - 0s 0 0 2325.00000 0 39 2365.00000 2325.00000 1.69% - 0s 0 0 2325.00000 0 41 2365.00000 2325.00000 1.69% - 0s 0 0 2325.43478 0 44 2365.00000 2325.43478 1.67% - 0s 0 0 2325.68627 0 40 2365.00000 2325.68627 1.66% - 0s 0 0 2328.21429 0 36 2365.00000 2328.21429 1.56% - 0s 0 0 2328.27586 0 39 2365.00000 2328.27586 1.55% - 0s 0 0 2328.30357 0 41 2365.00000 2328.30357 1.55% - 0s 0 0 2328.35118 0 41 2365.00000 2328.35118 1.55% - 0s 0 0 2355.90909 0 3 2365.00000 2355.90909 0.38% - 0s Cutting planes: Gomory: 1 MIR: 5 Flow cover: 1 Explored 0 nodes (727 simplex iterations) in 0.25 seconds Thread count was 4 (of 4 available processors) Solution count 4: 2365 2635 2665 7500 Pool objective bound 2365 Optimal solution found (tolerance 1.00e-04) Best objective 2.365000000000e+03, best bound 2.365000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day1--Day1 1 Priority2--Day1--Day1 9 Priority2--Day2--Day2 1 Priority2--Day3--Day3 3 Priority2--Day6--Day6 2 Priority1-Day1-Day1 6 Priority1-Day2-Day2 7 Priority1-Day3-Day3 4 Priority1-Day4-Day4 6 Priority1-Day5-Day5 3 Priority1-Day6-Day6 3 Priority2-Day3-Day7 2 Priority2-Day5-Day5 2 Priority2-Day5-Day9 3 Priority3-Day1-Day7 1 Priority3-Day2-Day8 6 Priority3-Day3-Day9 4 Priority3-Day4-Day10 2 Priority3-Day5-Day11 3 Priority3-Day6-Day7 3 Priority3-Day6-Day8 2 Priority3-Day6-Day10 1 Priority3-Day6-Day12 1 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 1 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day4(r) 4 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day2-Day6(r) 1 Priority2-Day2-Day7(r) 1 Priority2-Day2-Day8(r) 1 Priority2-Day2-Day9(r) 1 Priority2-Day2-Day10(r) 1 Priority2-Day2-Day11(r) 1 Priority2-Day2-Day12(r) 1 Priority2-Day2-Day13(r) 1 Priority2-Day2-Day14(r) 1 Priority2-Day2-Day15(r) 1 Priority2-Day2-Day16(r) 1 Priority2-Day2-Day17(r) 1 Priority2-Day2-Day18(r) 1 Priority2-Day2-Day19(r) 1 Priority2-Day2-Day20(r) 1 Priority2-Day3-Day7(r) 5 Priority2-Day3-Day8(r) 5 Priority2-Day3-Day9(r) 5 Priority2-Day3-Day10(r) 5 Priority2-Day3-Day11(r) 5 Priority2-Day3-Day12(r) 5 Priority2-Day3-Day13(r) 5 Priority2-Day3-Day14(r) 5 Priority2-Day3-Day15(r) 5 Priority2-Day3-Day16(r) 5 Priority2-Day3-Day17(r) 5 Priority2-Day3-Day18(r) 5 Priority2-Day3-Day19(r) 5 Priority2-Day3-Day20(r) 5 Priority2-Day5-Day9(r) 3 Priority2-Day5-Day10(r) 3 Priority2-Day5-Day11(r) 3 Priority2-Day5-Day12(r) 3 Priority2-Day5-Day13(r) 3 Priority2-Day5-Day14(r) 3 Priority2-Day5-Day15(r) 3 Priority2-Day5-Day16(r) 3 Priority2-Day5-Day17(r) 3 Priority2-Day5-Day18(r) 3 Priority2-Day5-Day19(r) 3 Priority2-Day5-Day20(r) 3 Priority2-Day6-Day8(r) 1 Priority2-Day6-Day9(r) 1 Priority2-Day6-Day10(r) 2 Priority2-Day6-Day11(r) 2 Priority2-Day6-Day12(r) 2 Priority2-Day6-Day13(r) 2 Priority2-Day6-Day14(r) 2 Priority2-Day6-Day15(r) 2 Priority2-Day6-Day16(r) 2 Priority2-Day6-Day17(r) 2 Priority2-Day6-Day18(r) 2 Priority2-Day6-Day19(r) 2 Priority2-Day6-Day20(r) 2 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day7(r) 3 Priority3-Day6-Day8(r) 5 Priority3-Day6-Day9(r) 5 Priority3-Day6-Day10(r) 6 Priority3-Day6-Day11(r) 6 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day2-Day3(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day3-Day4(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day4-Day5(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day2-Day6(w) 1 Priority2-Day2-Day7(w) 1 Priority2-Day2-Day8(w) 1 Priority2-Day2-Day9(w) 1 Priority2-Day2-Day10(w) 1 Priority2-Day2-Day11(w) 1 Priority2-Day2-Day12(w) 1 Priority2-Day2-Day13(w) 1 Priority2-Day2-Day14(w) 1 Priority2-Day2-Day15(w) 1 Priority2-Day2-Day16(w) 1 Priority2-Day2-Day17(w) 1 Priority2-Day2-Day18(w) 1 Priority2-Day2-Day19(w) 1 Priority2-Day2-Day20(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority2-Day6-Day8(w) 1 Priority2-Day6-Day9(w) 1 Priority2-Day6-Day10(w) 1 Priority2-Day6-Day11(w) 1 Priority2-Day6-Day12(w) 1 Priority2-Day6-Day13(w) 1 Priority2-Day6-Day14(w) 1 Priority2-Day6-Day15(w) 1 Priority2-Day6-Day16(w) 1 Priority2-Day6-Day17(w) 1 Priority2-Day6-Day18(w) 1 Priority2-Day6-Day19(w) 1 Priority2-Day6-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day10(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day7(w) 1 Priority3-Day6-Day8(w) 1 Priority3-Day6-Day9(w) 1 Priority3-Day6-Day10(w) 1 Priority3-Day6-Day11(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1327 rows and 686 columns Presolve time: 0.04s Presolved: 611 rows, 412 columns, 5599 nonzeros Variable types: 0 continuous, 412 integer (184 binary) Root relaxation: objective 3.118810e+03, 298 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3118.80952 0 6 7500.00000 3118.80952 58.4% - 0s H 0 0 3145.0000000 3118.80952 0.83% - 0s Explored 0 nodes (309 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 2: 3145 7500 Pool objective bound 3145 Optimal solution found (tolerance 1.00e-04) Best objective 3.145000000000e+03, best bound 3.145000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day1--Day1 4 Priority1--Day4--Day4 3 Priority1--Day5--Day5 1 Priority2--Day1--Day1 9 Priority2--Day2--Day2 1 Priority2--Day3--Day3 4 Priority3--Day1--Day1 1 Priority3--Day2--Day2 1 Priority1-Day1-Day1 3 Priority1-Day2-Day2 7 Priority1-Day3-Day3 4 Priority1-Day4-Day4 3 Priority1-Day5-Day5 2 Priority1-Day6-Day6 3 Priority2-Day3-Day3 1 Priority2-Day5-Day5 2 Priority2-Day5-Day7 3 Priority2-Day6-Day10 2 Priority3-Day2-Day8 5 Priority3-Day3-Day8 3 Priority3-Day3-Day9 1 Priority3-Day4-Day10 2 Priority3-Day5-Day11 3 Priority3-Day6-Day11 2 Priority3-Day6-Day12 5 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 4 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 3 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day3(r) 2 Priority2-Day1-Day4(r) 5 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day2-Day6(r) 1 Priority2-Day2-Day7(r) 1 Priority2-Day2-Day8(r) 1 Priority2-Day2-Day9(r) 1 Priority2-Day2-Day10(r) 1 Priority2-Day2-Day11(r) 1 Priority2-Day2-Day12(r) 1 Priority2-Day2-Day13(r) 1 Priority2-Day2-Day14(r) 1 Priority2-Day2-Day15(r) 1 Priority2-Day2-Day16(r) 1 Priority2-Day2-Day17(r) 1 Priority2-Day2-Day18(r) 1 Priority2-Day2-Day19(r) 1 Priority2-Day2-Day20(r) 1 Priority2-Day3-Day6(r) 1 Priority2-Day3-Day7(r) 4 Priority2-Day3-Day8(r) 4 Priority2-Day3-Day9(r) 4 Priority2-Day3-Day10(r) 4 Priority2-Day3-Day11(r) 4 Priority2-Day3-Day12(r) 4 Priority2-Day3-Day13(r) 4 Priority2-Day3-Day14(r) 4 Priority2-Day3-Day15(r) 4 Priority2-Day3-Day16(r) 4 Priority2-Day3-Day17(r) 4 Priority2-Day3-Day18(r) 4 Priority2-Day3-Day19(r) 4 Priority2-Day3-Day20(r) 4 Priority2-Day5-Day7(r) 3 Priority2-Day5-Day8(r) 3 Priority2-Day5-Day9(r) 3 Priority2-Day5-Day10(r) 3 Priority2-Day5-Day11(r) 3 Priority2-Day5-Day12(r) 3 Priority2-Day5-Day13(r) 3 Priority2-Day5-Day14(r) 3 Priority2-Day5-Day15(r) 3 Priority2-Day5-Day16(r) 3 Priority2-Day5-Day17(r) 3 Priority2-Day5-Day18(r) 3 Priority2-Day5-Day19(r) 3 Priority2-Day5-Day20(r) 3 Priority2-Day6-Day10(r) 2 Priority2-Day6-Day11(r) 2 Priority2-Day6-Day12(r) 2 Priority2-Day6-Day13(r) 2 Priority2-Day6-Day14(r) 2 Priority2-Day6-Day15(r) 2 Priority2-Day6-Day16(r) 2 Priority2-Day6-Day17(r) 2 Priority2-Day6-Day18(r) 2 Priority2-Day6-Day19(r) 2 Priority2-Day6-Day20(r) 2 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day8(r) 3 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day11(r) 2 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day4-Day5(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority2-Day1-Day3(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day2-Day6(w) 1 Priority2-Day2-Day7(w) 1 Priority2-Day2-Day8(w) 1 Priority2-Day2-Day9(w) 1 Priority2-Day2-Day10(w) 1 Priority2-Day2-Day11(w) 1 Priority2-Day2-Day12(w) 1 Priority2-Day2-Day13(w) 1 Priority2-Day2-Day14(w) 1 Priority2-Day2-Day15(w) 1 Priority2-Day2-Day16(w) 1 Priority2-Day2-Day17(w) 1 Priority2-Day2-Day18(w) 1 Priority2-Day2-Day19(w) 1 Priority2-Day2-Day20(w) 1 Priority2-Day3-Day6(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day7(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority2-Day6-Day10(w) 1 Priority2-Day6-Day11(w) 1 Priority2-Day6-Day12(w) 1 Priority2-Day6-Day13(w) 1 Priority2-Day6-Day14(w) 1 Priority2-Day6-Day15(w) 1 Priority2-Day6-Day16(w) 1 Priority2-Day6-Day17(w) 1 Priority2-Day6-Day18(w) 1 Priority2-Day6-Day19(w) 1 Priority2-Day6-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day8(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day11(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1228 rows and 564 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1131 rows and 523 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1112 rows and 496 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1624 rows and 818 columns Presolve time: 0.02s Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1411 rows and 701 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1134 rows and 523 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1652 rows and 808 columns Presolve time: 0.02s Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1695 rows and 855 columns Presolve time: 0.03s Explored 0 nodes (0 simplex iterations) in 0.05 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1755 rows and 886 columns Presolve time: 0.02s Explored 0 nodes (0 simplex iterations) in 0.05 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1312 rows and 635 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1459 rows and 728 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1451 rows and 714 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1178 rows and 540 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1085 rows and 470 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1107 rows and 488 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1168 rows and 545 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1206 rows and 551 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1215 rows and 570 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1112 rows and 494 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1515 rows and 749 columns Presolve time: 0.03s Explored 0 nodes (0 simplex iterations) in 0.05 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 968 rows and 456 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1336 rows and 687 columns Presolve time: 0.04s Presolved: 602 rows, 411 columns, 5283 nonzeros Variable types: 0 continuous, 411 integer (185 binary) Root relaxation: objective 2.602500e+03, 321 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2602.50000 0 4 7500.00000 2602.50000 65.3% - 0s H 0 0 2605.0000000 2602.50000 0.10% - 0s Explored 0 nodes (327 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 2605 7500 Pool objective bound 2605 Optimal solution found (tolerance 1.00e-04) Best objective 2.605000000000e+03, best bound 2.605000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day1--Day1 4 Priority1--Day2--Day2 1 Priority1--Day3--Day3 3 Priority2--Day1--Day1 6 Priority1-Day1-Day1 3 Priority1-Day2-Day2 6 Priority1-Day3-Day3 1 Priority1-Day4-Day4 5 Priority1-Day4-Day5 1 Priority1-Day5-Day5 3 Priority1-Day6-Day6 3 Priority2-Day1-Day5 3 Priority2-Day2-Day6 1 Priority2-Day3-Day7 5 Priority2-Day5-Day5 1 Priority2-Day5-Day8 1 Priority2-Day5-Day9 3 Priority2-Day6-Day6 2 Priority3-Day1-Day7 1 Priority3-Day2-Day8 6 Priority3-Day3-Day9 4 Priority3-Day4-Day10 2 Priority3-Day5-Day11 3 Priority3-Day6-Day11 4 Priority3-Day6-Day12 3 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 4 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 1 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day3-Day4(r) 3 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 1 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day4(r) 1 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day2-Day6(r) 1 Priority2-Day2-Day7(r) 1 Priority2-Day2-Day8(r) 1 Priority2-Day2-Day9(r) 1 Priority2-Day2-Day10(r) 1 Priority2-Day2-Day11(r) 1 Priority2-Day2-Day12(r) 1 Priority2-Day2-Day13(r) 1 Priority2-Day2-Day14(r) 1 Priority2-Day2-Day15(r) 1 Priority2-Day2-Day16(r) 1 Priority2-Day2-Day17(r) 1 Priority2-Day2-Day18(r) 1 Priority2-Day2-Day19(r) 1 Priority2-Day2-Day20(r) 1 Priority2-Day3-Day7(r) 5 Priority2-Day3-Day8(r) 5 Priority2-Day3-Day9(r) 5 Priority2-Day3-Day10(r) 5 Priority2-Day3-Day11(r) 5 Priority2-Day3-Day12(r) 5 Priority2-Day3-Day13(r) 5 Priority2-Day3-Day14(r) 5 Priority2-Day3-Day15(r) 5 Priority2-Day3-Day16(r) 5 Priority2-Day3-Day17(r) 5 Priority2-Day3-Day18(r) 5 Priority2-Day3-Day19(r) 5 Priority2-Day3-Day20(r) 5 Priority2-Day5-Day8(r) 1 Priority2-Day5-Day9(r) 4 Priority2-Day5-Day10(r) 4 Priority2-Day5-Day11(r) 4 Priority2-Day5-Day12(r) 4 Priority2-Day5-Day13(r) 4 Priority2-Day5-Day14(r) 4 Priority2-Day5-Day15(r) 4 Priority2-Day5-Day16(r) 4 Priority2-Day5-Day17(r) 4 Priority2-Day5-Day18(r) 4 Priority2-Day5-Day19(r) 4 Priority2-Day5-Day20(r) 4 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day11(r) 4 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day2-Day3(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day3-Day4(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day4-Day5(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day2-Day6(w) 1 Priority2-Day2-Day7(w) 1 Priority2-Day2-Day8(w) 1 Priority2-Day2-Day9(w) 1 Priority2-Day2-Day10(w) 1 Priority2-Day2-Day11(w) 1 Priority2-Day2-Day12(w) 1 Priority2-Day2-Day13(w) 1 Priority2-Day2-Day14(w) 1 Priority2-Day2-Day15(w) 1 Priority2-Day2-Day16(w) 1 Priority2-Day2-Day17(w) 1 Priority2-Day2-Day18(w) 1 Priority2-Day2-Day19(w) 1 Priority2-Day2-Day20(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day11(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1362 rows and 709 columns Presolve time: 0.06s Presolved: 576 rows, 389 columns, 4642 nonzeros Variable types: 0 continuous, 389 integer (171 binary) Root relaxation: objective 2.545000e+03, 314 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2545.00000 0 3 7500.00000 2545.00000 66.1% - 0s H 0 0 2655.0000000 2545.00000 4.14% - 0s 0 0 2546.66667 0 24 2655.00000 2546.66667 4.08% - 0s H 0 0 2580.0000000 2546.66667 1.29% - 0s 0 0 2553.85965 0 43 2580.00000 2553.85965 1.01% - 0s 0 0 2565.00000 0 2 2580.00000 2565.00000 0.58% - 0s Cutting planes: Gomory: 2 Flow cover: 1 Explored 0 nodes (442 simplex iterations) in 0.13 seconds Thread count was 4 (of 4 available processors) Solution count 3: 2580 2655 7500 Pool objective bound 2580 Optimal solution found (tolerance 1.00e-04) Best objective 2.580000000000e+03, best bound 2.580000000000e+03, gap 0.0000% Variable x ------------------------- Priority1--Day1--Day1 5 Priority1--Day2--Day2 2 Priority2--Day1--Day1 8 Priority1-Day1-Day1 2 Priority1-Day2-Day2 5 Priority1-Day3-Day3 4 Priority1-Day4-Day4 3 Priority1-Day4-Day5 3 Priority1-Day5-Day5 3 Priority1-Day6-Day6 3 Priority2-Day1-Day5 1 Priority2-Day2-Day6 1 Priority2-Day3-Day3 3 Priority2-Day3-Day7 2 Priority2-Day5-Day8 1 Priority2-Day5-Day9 4 Priority2-Day6-Day6 2 Priority3-Day1-Day7 1 Priority3-Day2-Day8 6 Priority3-Day3-Day9 4 Priority3-Day4-Day10 2 Priority3-Day5-Day11 3 Priority3-Day6-Day10 2 Priority3-Day6-Day11 3 Priority3-Day6-Day12 2 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 5 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 2 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 3 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day4(r) 2 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day2-Day6(r) 1 Priority2-Day2-Day7(r) 1 Priority2-Day2-Day8(r) 1 Priority2-Day2-Day9(r) 1 Priority2-Day2-Day10(r) 1 Priority2-Day2-Day11(r) 1 Priority2-Day2-Day12(r) 1 Priority2-Day2-Day13(r) 1 Priority2-Day2-Day14(r) 1 Priority2-Day2-Day15(r) 1 Priority2-Day2-Day16(r) 1 Priority2-Day2-Day17(r) 1 Priority2-Day2-Day18(r) 1 Priority2-Day2-Day19(r) 1 Priority2-Day2-Day20(r) 1 Priority2-Day3-Day7(r) 2 Priority2-Day3-Day8(r) 2 Priority2-Day3-Day9(r) 2 Priority2-Day3-Day10(r) 2 Priority2-Day3-Day11(r) 2 Priority2-Day3-Day12(r) 2 Priority2-Day3-Day13(r) 2 Priority2-Day3-Day14(r) 2 Priority2-Day3-Day15(r) 2 Priority2-Day3-Day16(r) 2 Priority2-Day3-Day17(r) 2 Priority2-Day3-Day18(r) 2 Priority2-Day3-Day19(r) 2 Priority2-Day3-Day20(r) 2 Priority2-Day5-Day8(r) 1 Priority2-Day5-Day9(r) 5 Priority2-Day5-Day10(r) 5 Priority2-Day5-Day11(r) 5 Priority2-Day5-Day12(r) 5 Priority2-Day5-Day13(r) 5 Priority2-Day5-Day14(r) 5 Priority2-Day5-Day15(r) 5 Priority2-Day5-Day16(r) 5 Priority2-Day5-Day17(r) 5 Priority2-Day5-Day18(r) 5 Priority2-Day5-Day19(r) 5 Priority2-Day5-Day20(r) 5 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day10(r) 2 Priority3-Day6-Day11(r) 5 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day2-Day3(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day4-Day5(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day2-Day6(w) 1 Priority2-Day2-Day7(w) 1 Priority2-Day2-Day8(w) 1 Priority2-Day2-Day9(w) 1 Priority2-Day2-Day10(w) 1 Priority2-Day2-Day11(w) 1 Priority2-Day2-Day12(w) 1 Priority2-Day2-Day13(w) 1 Priority2-Day2-Day14(w) 1 Priority2-Day2-Day15(w) 1 Priority2-Day2-Day16(w) 1 Priority2-Day2-Day17(w) 1 Priority2-Day2-Day18(w) 1 Priority2-Day2-Day19(w) 1 Priority2-Day2-Day20(w) 1 Priority2-Day3-Day6(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority2-Day6-Day10(w) 1 Priority2-Day6-Day11(w) 1 Priority2-Day6-Day12(w) 1 Priority2-Day6-Day13(w) 1 Priority2-Day6-Day14(w) 1 Priority2-Day6-Day15(w) 1 Priority2-Day6-Day16(w) 1 Priority2-Day6-Day17(w) 1 Priority2-Day6-Day18(w) 1 Priority2-Day6-Day19(w) 1 Priority2-Day6-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day10(w) 1 Priority3-Day6-Day11(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1319 rows and 677 columns Presolve time: 0.06s Presolved: 619 rows, 421 columns, 5445 nonzeros Variable types: 0 continuous, 421 integer (186 binary) Root relaxation: objective 2.515870e+03, 307 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2515.86957 0 5 7500.00000 2515.86957 66.5% - 0s H 0 0 2540.0000000 2515.86957 0.95% - 0s Cutting planes: MIR: 1 Explored 0 nodes (322 simplex iterations) in 0.10 seconds Thread count was 4 (of 4 available processors) Solution count 2: 2540 7500 Pool objective bound 2540 Optimal solution found (tolerance 1.00e-04) Best objective 2.540000000000e+03, best bound 2.540000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1206 rows and 601 columns Presolve time: 0.05s Presolved: 732 rows, 497 columns, 7296 nonzeros Variable types: 0 continuous, 497 integer (233 binary) Root relaxation: objective 2.475000e+03, 396 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2475.00000 0 1 7500.00000 2475.00000 67.0% - 0s H 0 0 2480.0000000 2475.00000 0.20% - 0s Explored 0 nodes (409 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 2: 2480 7500 Pool objective bound 2480 Optimal solution found (tolerance 1.00e-04) Best objective 2.480000000000e+03, best bound 2.480000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1243 rows and 628 columns Presolve time: 0.07s Presolved: 695 rows, 470 columns, 7825 nonzeros Variable types: 0 continuous, 470 integer (214 binary) Root relaxation: objective 2.955000e+03, 323 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2955.00000 0 4 7500.00000 2955.00000 60.6% - 0s H 0 0 3160.0000000 2955.00000 6.49% - 0s H 0 0 3090.0000000 2955.00000 4.37% - 0s 0 0 2981.66667 0 11 3090.00000 2981.66667 3.51% - 0s H 0 0 3010.0000000 2981.66667 0.94% - 0s 0 0 2996.66667 0 9 3010.00000 2996.66667 0.44% - 0s Cutting planes: Gomory: 1 Implied bound: 2 MIR: 7 Flow cover: 6 Explored 0 nodes (351 simplex iterations) in 0.15 seconds Thread count was 4 (of 4 available processors) Solution count 4: 3010 3090 3160 7500 Pool objective bound 3010 Optimal solution found (tolerance 1.00e-04) Best objective 3.010000000000e+03, best bound 3.010000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7230 Presolve removed 1208 rows and 604 columns Presolve time: 0.05s Presolved: 730 rows, 494 columns, 7014 nonzeros Variable types: 0 continuous, 494 integer (218 binary) Root relaxation: objective 2.115000e+03, 378 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2115.00000 0 3 7230.00000 2115.00000 70.7% - 0s H 0 0 2375.0000000 2115.00000 10.9% - 0s H 0 0 2195.0000000 2115.00000 3.64% - 0s 0 0 2117.72727 0 7 2195.00000 2117.72727 3.52% - 0s 0 0 2128.75000 0 18 2195.00000 2128.75000 3.02% - 0s 0 0 2128.75000 0 1 2195.00000 2128.75000 3.02% - 0s H 0 0 2135.0000000 2128.75000 0.29% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (546 simplex iterations) in 0.16 seconds Thread count was 4 (of 4 available processors) Solution count 5: 2135 2195 2195 ... 7230 Pool objective bound 2135 Optimal solution found (tolerance 1.00e-04) Best objective 2.135000000000e+03, best bound 2.135000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1797 rows and 956 columns Presolve time: 0.02s Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1243 rows and 576 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1257 rows and 635 columns Presolve time: 0.05s Presolved: 681 rows, 463 columns, 6627 nonzeros Variable types: 0 continuous, 463 integer (218 binary) Root relaxation: objective 2.405000e+03, 305 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2405.00000 0 2 7500.00000 2405.00000 67.9% - 0s H 0 0 2545.0000000 2405.00000 5.50% - 0s 0 0 2405.00000 0 6 2545.00000 2405.00000 5.50% - 0s 0 0 2405.00000 0 16 2545.00000 2405.00000 5.50% - 0s 0 0 2406.57895 0 21 2545.00000 2406.57895 5.44% - 0s 0 0 2406.57895 0 3 2545.00000 2406.57895 5.44% - 0s H 0 0 2485.0000000 2406.57895 3.16% - 0s 0 0 2409.13793 0 28 2485.00000 2409.13793 3.05% - 0s 0 0 2411.00000 0 25 2485.00000 2411.00000 2.98% - 0s 0 0 2415.71429 0 27 2485.00000 2415.71429 2.79% - 0s H 0 0 2475.0000000 2415.71429 2.40% - 0s 0 0 2415.86207 0 40 2475.00000 2415.86207 2.39% - 0s 0 0 2415.86207 0 38 2475.00000 2415.86207 2.39% - 0s 0 0 2424.76190 0 38 2475.00000 2424.76190 2.03% - 0s H 0 0 2425.0000000 2424.76190 0.01% - 0s Cutting planes: Learned: 1 Implied bound: 1 MIR: 10 Flow cover: 1 Mod-K: 1 Explored 0 nodes (764 simplex iterations) in 0.23 seconds Thread count was 4 (of 4 available processors) Solution count 5: 2425 2475 2485 ... 7500 Pool objective bound 2425 Optimal solution found (tolerance 1.00e-04) Best objective 2.425000000000e+03, best bound 2.425000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1678 rows and 854 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1273 rows and 647 columns Presolve time: 0.05s Presolved: 665 rows, 451 columns, 6636 nonzeros Variable types: 0 continuous, 451 integer (207 binary) Root relaxation: objective 2.680000e+03, 260 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2680.00000 0 4 7500.00000 2680.00000 64.3% - 0s H 0 0 3285.0000000 2680.00000 18.4% - 0s 0 0 2680.00000 0 33 3285.00000 2680.00000 18.4% - 0s H 0 0 3060.0000000 2680.00000 12.4% - 0s H 0 0 2950.0000000 2680.00000 9.15% - 0s 0 0 2680.00000 0 34 2950.00000 2680.00000 9.15% - 0s 0 0 2680.00000 0 24 2950.00000 2680.00000 9.15% - 0s 0 0 2680.00000 0 2 2950.00000 2680.00000 9.15% - 0s H 0 0 2780.0000000 2680.00000 3.60% - 0s 0 0 2680.00000 0 15 2780.00000 2680.00000 3.60% - 0s H 0 0 2770.0000000 2680.00000 3.25% - 0s 0 0 2680.00000 0 4 2770.00000 2680.00000 3.25% - 0s * 0 0 0 2685.0000000 2685.00000 0.00% - 0s Cutting planes: Gomory: 3 Implied bound: 2 MIR: 7 Flow cover: 3 Zero half: 2 Explored 0 nodes (586 simplex iterations) in 0.22 seconds Thread count was 4 (of 4 available processors) Solution count 8: 2685 2770 2780 ... 7500 Pool objective bound 2685 Optimal solution found (tolerance 1.00e-04) Best objective 2.685000000000e+03, best bound 2.685000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1195 rows and 593 columns Presolve time: 0.06s Presolved: 743 rows, 505 columns, 7213 nonzeros Variable types: 0 continuous, 505 integer (231 binary) Root relaxation: objective 2.390000e+03, 296 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 2390.0000000 2390.00000 0.00% - 0s Explored 0 nodes (311 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 2: 2390 7500 Pool objective bound 2390 Optimal solution found (tolerance 1.00e-04) Best objective 2.390000000000e+03, best bound 2.390000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2163 rows, 1104 columns and 34578 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 967 rows and 447 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2163 rows, 1104 columns and 34578 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1375 rows and 610 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2058 rows, 1104 columns and 33423 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 140 Presolve removed 1361 rows and 630 columns Presolve time: 0.07s Presolved: 697 rows, 474 columns, 8089 nonzeros Variable types: 0 continuous, 474 integer (218 binary) Root relaxation: objective 0.000000e+00, 1 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 0.0000000 0.00000 0.00% - 0s Explored 0 nodes (1 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 2: 0 140 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2058 rows, 1104 columns and 33423 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 0 Presolve removed 1549 rows and 758 columns Presolve time: 0.07s Presolved: 509 rows, 346 columns, 4256 nonzeros Variable types: 0 continuous, 346 integer (156 binary) Explored 0 nodes (0 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% Variable x ------------------------- zDay1-Day1 1 zDay2-Day2 1 zDay3-Day3 1 zDay4-Day4 1 zDay5-Day5 1 zDay6-Day6 1 Priority1--Day1--Day1 7 Priority1--Day2--Day2 7 Priority1--Day3--Day3 4 Priority1--Day4--Day4 6 Priority1--Day5--Day5 3 Priority1--Day6--Day6 3 Priority2--Day1--Day1 9 Priority2--Day2--Day2 1 Priority2--Day3--Day3 5 Priority2--Day5--Day5 5 Priority2--Day6--Day6 2 Priority3--Day1--Day1 1 Priority3--Day2--Day2 6 Priority3--Day4--Day4 2 Priority3--Day6--Day6 7 Priority3-Day3-Day3 4 Priority3-Day5-Day5 3 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 1 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 1 Priority1-Day3-Day1(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day5-Day1(r) 3 Priority1-Day6-Day1(r) 3 Priority2-Day1-Day5(r) 3 Priority2-Day1-Day6(r) 3 Priority2-Day1-Day7(r) 3 Priority2-Day1-Day8(r) 3 Priority2-Day1-Day9(r) 3 Priority2-Day1-Day10(r) 3 Priority2-Day1-Day11(r) 3 Priority2-Day1-Day12(r) 3 Priority2-Day1-Day13(r) 3 Priority2-Day1-Day14(r) 3 Priority2-Day1-Day15(r) 3 Priority2-Day1-Day16(r) 3 Priority2-Day1-Day17(r) 3 Priority2-Day1-Day18(r) 3 Priority2-Day1-Day19(r) 3 Priority2-Day1-Day20(r) 3 Priority2-Day5-Day9(r) 2 Priority2-Day5-Day10(r) 2 Priority2-Day5-Day11(r) 2 Priority2-Day5-Day12(r) 2 Priority2-Day5-Day13(r) 2 Priority2-Day5-Day14(r) 2 Priority2-Day5-Day15(r) 2 Priority2-Day5-Day16(r) 2 Priority2-Day5-Day17(r) 2 Priority2-Day5-Day18(r) 2 Priority2-Day5-Day19(r) 2 Priority2-Day5-Day20(r) 2 Priority3-Day6-Day12(r) 1 Priority3-Day6-Day13(r) 1 Priority3-Day6-Day14(r) 1 Priority3-Day6-Day15(r) 1 Priority3-Day6-Day16(r) 1 Priority3-Day6-Day17(r) 1 Priority3-Day6-Day18(r) 1 Priority3-Day6-Day19(r) 1 Priority3-Day6-Day20(r) 1 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day6-Day1(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1944 rows, 1104 columns and 32967 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 0 Presolve removed 1415 rows and 746 columns Presolve time: 0.07s Presolved: 529 rows, 358 columns, 4860 nonzeros Variable types: 0 continuous, 358 integer (163 binary) Explored 0 nodes (0 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% Variable x ------------------------- zDay1-Day1 1 zDay2-Day2 1 zDay3-Day3 1 zDay4-Day4 1 zDay5-Day5 1 zDay6-Day6 1 Priority1--Day1--Day1 7 Priority1--Day2--Day2 7 Priority1--Day3--Day3 4 Priority1--Day4--Day4 6 Priority1--Day5--Day5 3 Priority1--Day6--Day6 3 Priority2--Day1--Day1 9 Priority2--Day2--Day2 1 Priority2--Day3--Day3 5 Priority2--Day5--Day5 5 Priority2--Day6--Day6 2 Priority3--Day1--Day1 1 Priority3--Day2--Day2 6 Priority3--Day4--Day4 2 Priority3--Day6--Day6 7 Priority3-Day3-Day3 4 Priority3-Day5-Day5 3 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 6 Priority1-Day1-Day3(r) 4 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 6 Priority1-Day2-Day3(r) 4 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 3 Priority1-Day3-Day3(r) 1 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 5 Priority1-Day4-Day3(r) 3 Priority1-Day4-Day4(r) 1 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 2 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 2 Priority2-Day1-Day3(r) 2 Priority2-Day1-Day4(r) 5 Priority2-Day1-Day5(r) 8 Priority2-Day1-Day6(r) 8 Priority2-Day1-Day7(r) 8 Priority2-Day1-Day8(r) 8 Priority2-Day1-Day9(r) 8 Priority2-Day1-Day10(r) 8 Priority2-Day1-Day11(r) 8 Priority2-Day1-Day12(r) 8 Priority2-Day1-Day13(r) 8 Priority2-Day1-Day14(r) 8 Priority2-Day1-Day15(r) 8 Priority2-Day1-Day16(r) 8 Priority2-Day1-Day17(r) 8 Priority2-Day1-Day18(r) 8 Priority2-Day1-Day19(r) 8 Priority2-Day1-Day20(r) 8 Priority2-Day5-Day9(r) 2 Priority2-Day5-Day10(r) 2 Priority2-Day5-Day11(r) 2 Priority2-Day5-Day12(r) 2 Priority2-Day5-Day13(r) 2 Priority2-Day5-Day14(r) 2 Priority2-Day5-Day15(r) 2 Priority2-Day5-Day16(r) 2 Priority2-Day5-Day17(r) 2 Priority2-Day5-Day18(r) 2 Priority2-Day5-Day19(r) 2 Priority2-Day5-Day20(r) 2 Priority3-Day2-Day6(r) 2 Priority3-Day2-Day7(r) 3 Priority3-Day2-Day8(r) 4 Priority3-Day2-Day9(r) 4 Priority3-Day2-Day10(r) 4 Priority3-Day2-Day11(r) 4 Priority3-Day2-Day12(r) 4 Priority3-Day2-Day13(r) 4 Priority3-Day2-Day14(r) 4 Priority3-Day2-Day15(r) 4 Priority3-Day2-Day16(r) 4 Priority3-Day2-Day17(r) 4 Priority3-Day2-Day18(r) 4 Priority3-Day2-Day19(r) 4 Priority3-Day2-Day20(r) 4 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day1-Day3(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day2-Day3(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority2-Day1-Day3(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority3-Day2-Day6(w) 1 Priority3-Day2-Day7(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1944 rows, 1104 columns and 32967 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 0 Presolve removed 1565 rows and 845 columns Presolve time: 0.05s Presolved: 379 rows, 259 columns, 2865 nonzeros Variable types: 0 continuous, 259 integer (112 binary) Explored 0 nodes (0 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% Variable x ------------------------- z[Day1-Day1] 1 z[Day2-Day2] 1 z[Day3-Day3] 1 z[Day4-Day4] 1 z[Day5-Day5] 1 z[Day6-Day6] 1 Priority1--Day1--Day1 7 Priority1--Day2--Day2 7 Priority1--Day3--Day3 4 Priority1--Day4--Day4 6 Priority1--Day5--Day5 3 Priority1--Day6--Day6 3 Priority2--Day1--Day1 9 Priority2--Day3--Day3 5 Priority2--Day5--Day5 5 Priority2--Day6--Day6 2 Priority3--Day1--Day1 1 Priority3--Day2--Day2 6 Priority3--Day4--Day4 2 Priority3--Day5--Day5 1 Priority3--Day6--Day6 7 Priority2-Day2-Day2 1 Priority3-Day3-Day3 4 Priority3-Day5-Day5 2 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 1 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 1 Priority1-Day3-Day1(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day5-Day1(r) 3 Priority1-Day6-Day1(r) 3 Priority2-Day1-Day4(r) 1 Priority2-Day1-Day5(r) 3 Priority2-Day1-Day6(r) 3 Priority2-Day1-Day7(r) 3 Priority2-Day1-Day8(r) 3 Priority2-Day1-Day9(r) 3 Priority2-Day1-Day10(r) 3 Priority2-Day1-Day11(r) 3 Priority2-Day1-Day12(r) 3 Priority2-Day1-Day13(r) 3 Priority2-Day1-Day14(r) 3 Priority2-Day1-Day15(r) 3 Priority2-Day1-Day16(r) 3 Priority2-Day1-Day17(r) 3 Priority2-Day1-Day18(r) 3 Priority2-Day1-Day19(r) 3 Priority2-Day1-Day20(r) 3 Priority2-Day3-Day7(r) 1 Priority2-Day3-Day8(r) 1 Priority2-Day3-Day9(r) 1 Priority2-Day3-Day10(r) 1 Priority2-Day3-Day11(r) 1 Priority2-Day3-Day12(r) 1 Priority2-Day3-Day13(r) 1 Priority2-Day3-Day14(r) 1 Priority2-Day3-Day15(r) 1 Priority2-Day3-Day16(r) 1 Priority2-Day3-Day17(r) 1 Priority2-Day3-Day18(r) 1 Priority2-Day3-Day19(r) 1 Priority2-Day3-Day20(r) 1 Priority2-Day5-Day9(r) 3 Priority2-Day5-Day10(r) 3 Priority2-Day5-Day11(r) 3 Priority2-Day5-Day12(r) 3 Priority2-Day5-Day13(r) 3 Priority2-Day5-Day14(r) 3 Priority2-Day5-Day15(r) 3 Priority2-Day5-Day16(r) 3 Priority2-Day5-Day17(r) 3 Priority2-Day5-Day18(r) 3 Priority2-Day5-Day19(r) 3 Priority2-Day5-Day20(r) 3 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day5-Day11(r) 1 Priority3-Day5-Day12(r) 1 Priority3-Day5-Day13(r) 1 Priority3-Day5-Day14(r) 1 Priority3-Day5-Day15(r) 1 Priority3-Day5-Day16(r) 1 Priority3-Day5-Day17(r) 1 Priority3-Day5-Day18(r) 1 Priority3-Day5-Day19(r) 1 Priority3-Day5-Day20(r) 1 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day6-Day1(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1944 rows, 1104 columns and 32967 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 0 Presolve removed 1394 rows and 737 columns Presolve time: 0.07s Presolved: 550 rows, 367 columns, 4292 nonzeros Variable types: 0 continuous, 367 integer (170 binary) Explored 0 nodes (0 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% Variable x ------------------------- z[Day1-Day1] 1 z[Day2-Day2] 1 z[Day3-Day3] 1 z[Day4-Day4] 1 z[Day5-Day5] 1 z[Day6-Day6] 1 Priority1--Day1--Day1 7 Priority1--Day2--Day2 7 Priority1--Day3--Day3 4 Priority1--Day5--Day5 3 Priority1--Day6--Day6 3 Priority2--Day1--Day1 9 Priority2--Day3--Day3 5 Priority2--Day5--Day5 5 Priority2--Day6--Day6 2 Priority3--Day2--Day2 6 Priority3--Day4--Day4 2 Priority3--Day5--Day5 2 Priority3--Day6--Day6 7 Priority1-Day4-Day4 6 Priority2-Day2-Day2 1 Priority3-Day1-Day1 1 Priority3-Day3-Day3 4 Priority3-Day5-Day5 1 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 2 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 3 Priority1-Day3-Day1(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 2 Priority1-Day5-Day1(r) 3 Priority1-Day6-Day1(r) 3 Priority2-Day1-Day4(r) 3 Priority2-Day1-Day5(r) 4 Priority2-Day1-Day6(r) 4 Priority2-Day1-Day7(r) 4 Priority2-Day1-Day8(r) 4 Priority2-Day1-Day9(r) 4 Priority2-Day1-Day10(r) 4 Priority2-Day1-Day11(r) 4 Priority2-Day1-Day12(r) 4 Priority2-Day1-Day13(r) 4 Priority2-Day1-Day14(r) 4 Priority2-Day1-Day15(r) 4 Priority2-Day1-Day16(r) 4 Priority2-Day1-Day17(r) 4 Priority2-Day1-Day18(r) 4 Priority2-Day1-Day19(r) 4 Priority2-Day1-Day20(r) 4 Priority2-Day5-Day9(r) 4 Priority2-Day5-Day10(r) 4 Priority2-Day5-Day11(r) 4 Priority2-Day5-Day12(r) 4 Priority2-Day5-Day13(r) 4 Priority2-Day5-Day14(r) 4 Priority2-Day5-Day15(r) 4 Priority2-Day5-Day16(r) 4 Priority2-Day5-Day17(r) 4 Priority2-Day5-Day18(r) 4 Priority2-Day5-Day19(r) 4 Priority2-Day5-Day20(r) 4 Priority3-Day5-Day11(r) 2 Priority3-Day5-Day12(r) 2 Priority3-Day5-Day13(r) 2 Priority3-Day5-Day14(r) 2 Priority3-Day5-Day15(r) 2 Priority3-Day5-Day16(r) 2 Priority3-Day5-Day17(r) 2 Priority3-Day5-Day18(r) 2 Priority3-Day5-Day19(r) 2 Priority3-Day5-Day20(r) 2 Priority3-Day6-Day11(r) 3 Priority3-Day6-Day12(r) 5 Priority3-Day6-Day13(r) 5 Priority3-Day6-Day14(r) 5 Priority3-Day6-Day15(r) 5 Priority3-Day6-Day16(r) 5 Priority3-Day6-Day17(r) 5 Priority3-Day6-Day18(r) 5 Priority3-Day6-Day19(r) 5 Priority3-Day6-Day20(r) 5 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day6-Day1(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day11(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1446 rows and 708 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2049 rows, 1104 columns and 34122 nonzeros Variable types: 0 continuous, 1104 integer (366 binary) Coefficient statistics: Matrix range [1e-01, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1180 rows and 545 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2316 rows, 1116 columns and 38469 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [6e-01, 1e+02] Presolve removed 387 rows and 0 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 0 Presolve removed 1385 rows and 728 columns Presolve time: 0.06s Presolved: 571 rows, 388 columns, 4110 nonzeros Variable types: 0 continuous, 388 integer (176 binary) Explored 0 nodes (0 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% Variable x ------------------------- Priority1-Day1 1 Priority1-Day2 1 Priority1-Day3 1 Priority1-Day4 1 Priority1-Day5 1 Priority1-Day6 1 Priority2-Day1 1 Priority2-Day2 1 Priority2-Day3 1 Priority2-Day4 1 Priority2-Day5 1 Priority2-Day6 1 Priority3-Day1 1 Priority3-Day2 1 Priority3-Day3 1 Priority3-Day4 1 Priority3-Day5 1 Priority3-Day6 1 Priority1--Day1--Day1 7 Priority1--Day2--Day2 6 Priority1--Day3--Day3 4 Priority1--Day4--Day4 6 Priority1--Day5--Day5 3 Priority1--Day6--Day6 3 Priority2--Day1--Day1 9 Priority2--Day2--Day2 1 Priority2--Day3--Day3 5 Priority2--Day5--Day5 5 Priority2--Day6--Day6 2 Priority3--Day1--Day1 1 Priority3--Day2--Day2 6 Priority3--Day4--Day4 2 Priority3--Day6--Day6 7 Priority1-Day2-Day2 1 Priority3-Day3-Day3 4 Priority3-Day5-Day5 3 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 5 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 5 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 2 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 4 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 1 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 1 Priority2-Day1-Day5(r) 7 Priority2-Day1-Day6(r) 7 Priority2-Day1-Day7(r) 7 Priority2-Day1-Day8(r) 7 Priority2-Day1-Day9(r) 7 Priority2-Day1-Day10(r) 7 Priority2-Day1-Day11(r) 7 Priority2-Day1-Day12(r) 7 Priority2-Day1-Day13(r) 7 Priority2-Day1-Day14(r) 7 Priority2-Day1-Day15(r) 7 Priority2-Day1-Day16(r) 7 Priority2-Day1-Day17(r) 7 Priority2-Day1-Day18(r) 7 Priority2-Day1-Day19(r) 7 Priority2-Day1-Day20(r) 7 Priority3-Day2-Day8(r) 2 Priority3-Day2-Day9(r) 2 Priority3-Day2-Day10(r) 2 Priority3-Day2-Day11(r) 2 Priority3-Day2-Day12(r) 2 Priority3-Day2-Day13(r) 2 Priority3-Day2-Day14(r) 2 Priority3-Day2-Day15(r) 2 Priority3-Day2-Day16(r) 2 Priority3-Day2-Day17(r) 2 Priority3-Day2-Day18(r) 2 Priority3-Day2-Day19(r) 2 Priority3-Day2-Day20(r) 2 Priority3-Day4-Day10(r) 1 Priority3-Day4-Day11(r) 1 Priority3-Day4-Day12(r) 1 Priority3-Day4-Day13(r) 1 Priority3-Day4-Day14(r) 1 Priority3-Day4-Day15(r) 1 Priority3-Day4-Day16(r) 1 Priority3-Day4-Day17(r) 1 Priority3-Day4-Day18(r) 1 Priority3-Day4-Day19(r) 1 Priority3-Day4-Day20(r) 1 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 2298 rows, 1116 columns and 38433 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Presolve removed 0 rows and 43 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33633 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+02] Presolve removed 1137 rows and 575 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1322 rows and 663 columns Presolve time: 0.06s Presolved: 652 rows, 453 columns, 7217 nonzeros Variable types: 0 continuous, 453 integer (209 binary) Root relaxation: objective 5.676027e+02, 200 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 567.60265 0 75 - 567.60265 - - 0s 0 0 731.86622 0 62 - 731.86622 - - 0s 0 0 754.95804 0 63 - 754.95804 - - 0s 0 0 818.72461 0 61 - 818.72461 - - 0s 0 0 818.72461 0 37 - 818.72461 - - 0s H 0 0 1255.0000000 818.72461 34.8% - 0s 0 0 884.88674 0 51 1255.00000 884.88674 29.5% - 0s 0 0 886.48657 0 51 1255.00000 886.48657 29.4% - 0s 0 0 914.65540 0 53 1255.00000 914.65540 27.1% - 0s H 0 0 965.0000000 914.65540 5.22% - 0s 0 0 915.45385 0 69 965.00000 915.45385 5.13% - 0s 0 0 919.84692 0 69 965.00000 919.84692 4.68% - 0s 0 0 923.74310 0 68 965.00000 923.74310 4.28% - 0s 0 0 926.47922 0 68 965.00000 926.47922 3.99% - 0s 0 0 937.57826 0 67 965.00000 937.57826 2.84% - 0s 0 0 940.30867 0 75 965.00000 940.30867 2.56% - 0s 0 0 940.39361 0 75 965.00000 940.39361 2.55% - 0s 0 0 941.27503 0 61 965.00000 941.27503 2.46% - 0s 0 0 942.04327 0 71 965.00000 942.04327 2.38% - 0s 0 0 942.19300 0 79 965.00000 942.19300 2.36% - 0s 0 0 942.46808 0 76 965.00000 942.46808 2.33% - 0s 0 0 942.46808 0 76 965.00000 942.46808 2.33% - 0s 0 0 942.46808 0 76 965.00000 942.46808 2.33% - 0s 0 0 952.76404 0 56 965.00000 952.76404 1.27% - 0s 0 0 954.22896 0 50 965.00000 954.22896 1.12% - 0s 0 0 955.33963 0 71 965.00000 955.33963 1.00% - 0s 0 0 955.39044 0 70 965.00000 955.39044 1.00% - 0s 0 0 955.75172 0 73 965.00000 955.75172 0.96% - 0s 0 0 955.75172 0 6 965.00000 955.75172 0.96% - 0s 0 0 cutoff 0 965.00000 965.00000 0.00% - 0s Cutting planes: Gomory: 1 Cover: 1 MIR: 7 GUB cover: 1 Explored 0 nodes (1014 simplex iterations) in 0.50 seconds Thread count was 4 (of 4 available processors) Solution count 2: 965 1255 Pool objective bound 965 Optimal solution found (tolerance 1.00e-04) Best objective 9.650000000000e+02, best bound 9.650000000000e+02, gap 0.0000% Variable x ------------------------- Priority1-Day1 1 Priority1-Day3 1 Priority1-Day4 1 Priority1-Day6 1 Priority2-Day1 1 Priority2-Day3 1 Priority2-Day6 1 Priority3-Day3 1 Priority3-Day6 1 Priority1--Day1--Day1 2 Priority1--Day3--Day3 4 Priority1--Day4--Day4 6 Priority1--Day6--Day6 3 Priority2--Day1--Day1 5 Priority2--Day3--Day3 4 Priority2--Day6--Day6 2 Priority3--Day3--Day3 4 Priority3--Day6--Day6 7 Priority1-Day1-Day1 1 Priority1-Day1-Day2 4 Priority1-Day2-Day2 3 Priority1-Day2-Day3 2 Priority1-Day2-Day4 2 Priority1-Day5-Day5 3 Priority2-Day1-Day5 4 Priority2-Day2-Day6 1 Priority2-Day3-Day5 1 Priority2-Day5-Day9 5 Priority3-Day1-Day1 1 Priority3-Day2-Day7 1 Priority3-Day2-Day8 5 Priority3-Day4-Day4 1 Priority3-Day4-Day10 1 Priority3-Day5-Day11 3 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 5 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 4 Priority1-Day2-Day4(r) 2 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day3-Day4(r) 4 Priority1-Day3-Day5(r) 3 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 5 Priority1-Day4-Day6(r) 2 Priority1-Day4-Day7(r) 2 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority1-Day6-Day7(r) 3 Priority2-Day1-Day5(r) 8 Priority2-Day1-Day6(r) 8 Priority2-Day1-Day7(r) 8 Priority2-Day1-Day8(r) 8 Priority2-Day1-Day9(r) 8 Priority2-Day1-Day10(r) 8 Priority2-Day1-Day11(r) 8 Priority2-Day1-Day12(r) 8 Priority2-Day1-Day13(r) 8 Priority2-Day1-Day14(r) 8 Priority2-Day1-Day15(r) 8 Priority2-Day1-Day16(r) 8 Priority2-Day1-Day17(r) 8 Priority2-Day1-Day18(r) 8 Priority2-Day1-Day19(r) 8 Priority2-Day1-Day20(r) 8 Priority2-Day2-Day6(r) 1 Priority2-Day2-Day7(r) 1 Priority2-Day2-Day8(r) 1 Priority2-Day2-Day9(r) 1 Priority2-Day2-Day10(r) 1 Priority2-Day2-Day11(r) 1 Priority2-Day2-Day12(r) 1 Priority2-Day2-Day13(r) 1 Priority2-Day2-Day14(r) 1 Priority2-Day2-Day15(r) 1 Priority2-Day2-Day16(r) 1 Priority2-Day2-Day17(r) 1 Priority2-Day2-Day18(r) 1 Priority2-Day2-Day19(r) 1 Priority2-Day2-Day20(r) 1 Priority2-Day3-Day5(r) 2 Priority2-Day3-Day6(r) 2 Priority2-Day3-Day7(r) 5 Priority2-Day3-Day8(r) 5 Priority2-Day3-Day9(r) 5 Priority2-Day3-Day10(r) 5 Priority2-Day3-Day11(r) 5 Priority2-Day3-Day12(r) 5 Priority2-Day3-Day13(r) 5 Priority2-Day3-Day14(r) 5 Priority2-Day3-Day15(r) 5 Priority2-Day3-Day16(r) 5 Priority2-Day3-Day17(r) 5 Priority2-Day3-Day18(r) 5 Priority2-Day3-Day19(r) 5 Priority2-Day3-Day20(r) 5 Priority2-Day5-Day9(r) 5 Priority2-Day5-Day10(r) 5 Priority2-Day5-Day11(r) 5 Priority2-Day5-Day12(r) 5 Priority2-Day5-Day13(r) 5 Priority2-Day5-Day14(r) 5 Priority2-Day5-Day15(r) 5 Priority2-Day5-Day16(r) 5 Priority2-Day5-Day17(r) 5 Priority2-Day5-Day18(r) 5 Priority2-Day5-Day19(r) 5 Priority2-Day5-Day20(r) 5 Priority2-Day6-Day7(r) 2 Priority2-Day6-Day8(r) 2 Priority2-Day6-Day9(r) 2 Priority2-Day6-Day10(r) 2 Priority2-Day6-Day11(r) 2 Priority2-Day6-Day12(r) 2 Priority2-Day6-Day13(r) 2 Priority2-Day6-Day14(r) 2 Priority2-Day6-Day15(r) 2 Priority2-Day6-Day16(r) 2 Priority2-Day6-Day17(r) 2 Priority2-Day6-Day18(r) 2 Priority2-Day6-Day19(r) 2 Priority2-Day6-Day20(r) 2 Priority3-Day2-Day7(r) 1 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 1 Priority3-Day4-Day11(r) 1 Priority3-Day4-Day12(r) 1 Priority3-Day4-Day13(r) 1 Priority3-Day4-Day14(r) 1 Priority3-Day4-Day15(r) 1 Priority3-Day4-Day16(r) 1 Priority3-Day4-Day17(r) 1 Priority3-Day4-Day18(r) 1 Priority3-Day4-Day19(r) 1 Priority3-Day4-Day20(r) 1 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day7(r) 3 Priority3-Day6-Day8(r) 3 Priority3-Day6-Day9(r) 3 Priority3-Day6-Day10(r) 3 Priority3-Day6-Day11(r) 4 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day2-Day3(w) 1 Priority1-Day2-Day4(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day3-Day4(w) 1 Priority1-Day3-Day5(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day4-Day5(w) 1 Priority1-Day4-Day6(w) 1 Priority1-Day4-Day7(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day5-Day6(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority1-Day6-Day7(w) 1 Priority1-Day6-Day8(w) 1 Priority1-Day6-Day9(w) 1 Priority1-Day6-Day10(w) 1 Priority1-Day6-Day11(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day2-Day6(w) 1 Priority2-Day2-Day7(w) 1 Priority2-Day2-Day8(w) 1 Priority2-Day2-Day9(w) 1 Priority2-Day2-Day10(w) 1 Priority2-Day2-Day11(w) 1 Priority2-Day2-Day12(w) 1 Priority2-Day2-Day13(w) 1 Priority2-Day2-Day14(w) 1 Priority2-Day2-Day15(w) 1 Priority2-Day2-Day16(w) 1 Priority2-Day2-Day17(w) 1 Priority2-Day2-Day18(w) 1 Priority2-Day2-Day19(w) 1 Priority2-Day2-Day20(w) 1 Priority2-Day3-Day5(w) 1 Priority2-Day3-Day6(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day7(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority2-Day6-Day7(w) 1 Priority2-Day6-Day8(w) 1 Priority2-Day6-Day9(w) 1 Priority2-Day6-Day10(w) 1 Priority2-Day6-Day11(w) 1 Priority2-Day6-Day12(w) 1 Priority2-Day6-Day13(w) 1 Priority2-Day6-Day14(w) 1 Priority2-Day6-Day15(w) 1 Priority2-Day6-Day16(w) 1 Priority2-Day6-Day17(w) 1 Priority2-Day6-Day18(w) 1 Priority2-Day6-Day19(w) 1 Priority2-Day6-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day7(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day9(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day1(w) 1 Priority3-Day6-Day2(w) 1 Priority3-Day6-Day3(w) 1 Priority3-Day6-Day4(w) 1 Priority3-Day6-Day5(w) 1 Priority3-Day6-Day6(w) 1 Priority3-Day6-Day7(w) 1 Priority3-Day6-Day8(w) 1 Priority3-Day6-Day9(w) 1 Priority3-Day6-Day10(w) 1 Priority3-Day6-Day11(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1862 rows and 1035 columns Presolve time: 0.02s Presolved: 112 rows, 81 columns, 517 nonzeros Variable types: 0 continuous, 81 integer (34 binary) Found heuristic solution: objective 1575.0000000 Root relaxation: objective 1.390536e+03, 53 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1390.53571 0 13 1575.00000 1390.53571 11.7% - 0s 0 0 1519.59016 0 4 1575.00000 1519.59016 3.52% - 0s H 0 0 1565.0000000 1519.59016 2.90% - 0s 0 0 1555.70175 0 7 1565.00000 1555.70175 0.59% - 0s 0 0 1555.70175 0 4 1565.00000 1555.70175 0.59% - 0s 0 0 cutoff 0 1565.00000 1565.00000 0.00% - 0s Cutting planes: Gomory: 1 MIR: 1 Explored 0 nodes (142 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 3: 1565 1565 1575 Pool objective bound 1565 Optimal solution found (tolerance 1.00e-04) Best objective 1.565000000000e+03, best bound 1.565000000000e+03, gap 0.0000% Variable x ------------------------- Priority1-Day4 1 Priority1-Day6 1 Priority2-Day5 1 Priority2-Day6 1 Priority3-Day4 1 Priority1--Day4--Day4 4 Priority1--Day6--Day6 3 Priority2--Day5--Day5 2 Priority2--Day6--Day6 2 Priority3--Day4--Day4 2 Priority1-Day1-Day1 5 Priority1-Day1-Day2 2 Priority1-Day2-Day2 3 Priority1-Day2-Day3 4 Priority1-Day3-Day3 4 Priority1-Day4-Day4 1 Priority1-Day4-Day6 1 Priority1-Day5-Day6 3 Priority2-Day1-Day4 3 Priority2-Day1-Day5 6 Priority2-Day2-Day6 1 Priority2-Day3-Day7 5 Priority2-Day5-Day8 2 Priority2-Day5-Day9 1 Priority3-Day1-Day7 1 Priority3-Day2-Day8 6 Priority3-Day3-Day9 4 Priority3-Day5-Day10 2 Priority3-Day5-Day11 1 Priority3-Day6-Day12 7 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 2 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 4 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 5 Priority1-Day4-Day6(r) 5 Priority1-Day4-Day7(r) 1 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day5-Day6(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority1-Day6-Day7(r) 3 Priority1-Day6-Day8(r) 1 Priority1-Day6-Day9(r) 1 Priority2-Day1-Day4(r) 3 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day2-Day6(r) 1 Priority2-Day2-Day7(r) 1 Priority2-Day2-Day8(r) 1 Priority2-Day2-Day9(r) 1 Priority2-Day2-Day10(r) 1 Priority2-Day2-Day11(r) 1 Priority2-Day2-Day12(r) 1 Priority2-Day2-Day13(r) 1 Priority2-Day2-Day14(r) 1 Priority2-Day2-Day15(r) 1 Priority2-Day2-Day16(r) 1 Priority2-Day2-Day17(r) 1 Priority2-Day2-Day18(r) 1 Priority2-Day2-Day19(r) 1 Priority2-Day2-Day20(r) 1 Priority2-Day3-Day7(r) 5 Priority2-Day3-Day8(r) 5 Priority2-Day3-Day9(r) 5 Priority2-Day3-Day10(r) 5 Priority2-Day3-Day11(r) 5 Priority2-Day3-Day12(r) 5 Priority2-Day3-Day13(r) 5 Priority2-Day3-Day14(r) 5 Priority2-Day3-Day15(r) 5 Priority2-Day3-Day16(r) 5 Priority2-Day3-Day17(r) 5 Priority2-Day3-Day18(r) 5 Priority2-Day3-Day19(r) 5 Priority2-Day3-Day20(r) 5 Priority2-Day5-Day8(r) 2 Priority2-Day5-Day9(r) 5 Priority2-Day5-Day10(r) 5 Priority2-Day5-Day11(r) 5 Priority2-Day5-Day12(r) 5 Priority2-Day5-Day13(r) 5 Priority2-Day5-Day14(r) 5 Priority2-Day5-Day15(r) 5 Priority2-Day5-Day16(r) 5 Priority2-Day5-Day17(r) 5 Priority2-Day5-Day18(r) 5 Priority2-Day5-Day19(r) 5 Priority2-Day5-Day20(r) 5 Priority2-Day6-Day10(r) 2 Priority2-Day6-Day11(r) 2 Priority2-Day6-Day12(r) 2 Priority2-Day6-Day13(r) 2 Priority2-Day6-Day14(r) 2 Priority2-Day6-Day15(r) 2 Priority2-Day6-Day16(r) 2 Priority2-Day6-Day17(r) 2 Priority2-Day6-Day18(r) 2 Priority2-Day6-Day19(r) 2 Priority2-Day6-Day20(r) 2 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day10(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day2-Day3(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day3-Day4(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day4-Day5(w) 1 Priority1-Day4-Day6(w) 1 Priority1-Day4-Day7(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day5-Day6(w) 1 Priority1-Day5-Day7(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority1-Day6-Day7(w) 1 Priority1-Day6-Day8(w) 1 Priority1-Day6-Day9(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day2-Day6(w) 1 Priority2-Day2-Day7(w) 1 Priority2-Day2-Day8(w) 1 Priority2-Day2-Day9(w) 1 Priority2-Day2-Day10(w) 1 Priority2-Day2-Day11(w) 1 Priority2-Day2-Day12(w) 1 Priority2-Day2-Day13(w) 1 Priority2-Day2-Day14(w) 1 Priority2-Day2-Day15(w) 1 Priority2-Day2-Day16(w) 1 Priority2-Day2-Day17(w) 1 Priority2-Day2-Day18(w) 1 Priority2-Day2-Day19(w) 1 Priority2-Day2-Day20(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority2-Day6-Day10(w) 1 Priority2-Day6-Day11(w) 1 Priority2-Day6-Day12(w) 1 Priority2-Day6-Day13(w) 1 Priority2-Day6-Day14(w) 1 Priority2-Day6-Day15(w) 1 Priority2-Day6-Day16(w) 1 Priority2-Day6-Day17(w) 1 Priority2-Day6-Day18(w) 1 Priority2-Day6-Day19(w) 1 Priority2-Day6-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day10(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Gurobi 7.0.2 (mac64, Python) logging started Mon May 15 12:19:56 2017 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1411 rows and 719 columns Presolve time: 0.03s Explored 0 nodes (0 simplex iterations) in 0.05 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1974 rows and 1116 columns Presolve time: 0.03s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.06 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1175 Pool objective bound 1175 Optimal solution found (tolerance 1.00e-04) Best objective 1.175000000000e+03, best bound 1.175000000000e+03, gap 0.0000% Variable x ------------------------- Priority1-Day3 1 Priority1-Day4 1 Priority1-Day6 1 Priority2-Day3 1 Priority2-Day6 1 Priority3-Day3 1 Priority3-Day4 1 Priority3-Day6 1 Priority1--Day3--Day3 4 Priority1--Day4--Day4 6 Priority1--Day6--Day6 3 Priority2--Day3--Day3 3 Priority2--Day6--Day6 2 Priority3--Day3--Day3 3 Priority3--Day4--Day4 2 Priority3--Day6--Day6 7 Priority1-Day1-Day1 5 Priority1-Day1-Day2 2 Priority1-Day2-Day2 6 Priority1-Day2-Day3 1 Priority1-Day5-Day7 3 Priority2-Day1-Day3 1 Priority2-Day1-Day4 1 Priority2-Day1-Day5 7 Priority2-Day2-Day6 1 Priority2-Day3-Day7 2 Priority2-Day5-Day9 5 Priority3-Day1-Day7 1 Priority3-Day2-Day8 6 Priority3-Day3-Day3 1 Priority3-Day5-Day11 3 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 2 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 1 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day3-Day4(r) 3 Priority1-Day3-Day5(r) 3 Priority1-Day3-Day6(r) 3 Priority1-Day3-Day7(r) 3 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 6 Priority1-Day4-Day6(r) 6 Priority1-Day4-Day7(r) 6 Priority1-Day4-Day8(r) 2 Priority1-Day4-Day9(r) 2 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day5-Day6(r) 3 Priority1-Day5-Day7(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority1-Day6-Day7(r) 3 Priority1-Day6-Day8(r) 2 Priority1-Day6-Day9(r) 2 Priority2-Day1-Day3(r) 1 Priority2-Day1-Day4(r) 2 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day2-Day6(r) 1 Priority2-Day2-Day7(r) 1 Priority2-Day2-Day8(r) 1 Priority2-Day2-Day9(r) 1 Priority2-Day2-Day10(r) 1 Priority2-Day2-Day11(r) 1 Priority2-Day2-Day12(r) 1 Priority2-Day2-Day13(r) 1 Priority2-Day2-Day14(r) 1 Priority2-Day2-Day15(r) 1 Priority2-Day2-Day16(r) 1 Priority2-Day2-Day17(r) 1 Priority2-Day2-Day18(r) 1 Priority2-Day2-Day19(r) 1 Priority2-Day2-Day20(r) 1 Priority2-Day3-Day7(r) 4 Priority2-Day3-Day8(r) 4 Priority2-Day3-Day9(r) 4 Priority2-Day3-Day10(r) 4 Priority2-Day3-Day11(r) 4 Priority2-Day3-Day12(r) 4 Priority2-Day3-Day13(r) 4 Priority2-Day3-Day14(r) 4 Priority2-Day3-Day15(r) 4 Priority2-Day3-Day16(r) 4 Priority2-Day3-Day17(r) 4 Priority2-Day3-Day18(r) 4 Priority2-Day3-Day19(r) 4 Priority2-Day3-Day20(r) 4 Priority2-Day5-Day9(r) 5 Priority2-Day5-Day10(r) 5 Priority2-Day5-Day11(r) 5 Priority2-Day5-Day12(r) 5 Priority2-Day5-Day13(r) 5 Priority2-Day5-Day14(r) 5 Priority2-Day5-Day15(r) 5 Priority2-Day5-Day16(r) 5 Priority2-Day5-Day17(r) 5 Priority2-Day5-Day18(r) 5 Priority2-Day5-Day19(r) 5 Priority2-Day5-Day20(r) 5 Priority2-Day6-Day10(r) 2 Priority2-Day6-Day11(r) 2 Priority2-Day6-Day12(r) 2 Priority2-Day6-Day13(r) 2 Priority2-Day6-Day14(r) 2 Priority2-Day6-Day15(r) 2 Priority2-Day6-Day16(r) 2 Priority2-Day6-Day17(r) 2 Priority2-Day6-Day18(r) 2 Priority2-Day6-Day19(r) 2 Priority2-Day6-Day20(r) 2 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day9(r) 3 Priority3-Day3-Day10(r) 3 Priority3-Day3-Day11(r) 3 Priority3-Day3-Day12(r) 3 Priority3-Day3-Day13(r) 3 Priority3-Day3-Day14(r) 3 Priority3-Day3-Day15(r) 3 Priority3-Day3-Day16(r) 3 Priority3-Day3-Day17(r) 3 Priority3-Day3-Day18(r) 3 Priority3-Day3-Day19(r) 3 Priority3-Day3-Day20(r) 3 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day2-Day3(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day3-Day4(w) 1 Priority1-Day3-Day5(w) 1 Priority1-Day3-Day6(w) 1 Priority1-Day3-Day7(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day4-Day5(w) 1 Priority1-Day4-Day6(w) 1 Priority1-Day4-Day7(w) 1 Priority1-Day4-Day8(w) 1 Priority1-Day4-Day9(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day5-Day6(w) 1 Priority1-Day5-Day7(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority1-Day6-Day7(w) 1 Priority1-Day6-Day8(w) 1 Priority1-Day6-Day9(w) 1 Priority1-Day6-Day10(w) 1 Priority2-Day1-Day3(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day2-Day6(w) 1 Priority2-Day2-Day7(w) 1 Priority2-Day2-Day8(w) 1 Priority2-Day2-Day9(w) 1 Priority2-Day2-Day10(w) 1 Priority2-Day2-Day11(w) 1 Priority2-Day2-Day12(w) 1 Priority2-Day2-Day13(w) 1 Priority2-Day2-Day14(w) 1 Priority2-Day2-Day15(w) 1 Priority2-Day2-Day16(w) 1 Priority2-Day2-Day17(w) 1 Priority2-Day2-Day18(w) 1 Priority2-Day2-Day19(w) 1 Priority2-Day2-Day20(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority2-Day6-Day10(w) 1 Priority2-Day6-Day11(w) 1 Priority2-Day6-Day12(w) 1 Priority2-Day6-Day13(w) 1 Priority2-Day6-Day14(w) 1 Priority2-Day6-Day15(w) 1 Priority2-Day6-Day16(w) 1 Priority2-Day6-Day17(w) 1 Priority2-Day6-Day18(w) 1 Priority2-Day6-Day19(w) 1 Priority2-Day6-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1306 rows and 649 columns Presolve time: 0.05s Presolved: 668 rows, 467 columns, 7139 nonzeros Variable types: 0 continuous, 467 integer (220 binary) Root relaxation: objective 2.760529e+02, 227 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 276.05292 0 74 - 276.05292 - - 0s 0 0 463.04544 0 117 - 463.04544 - - 0s 0 0 463.87670 0 119 - 463.87670 - - 0s 0 0 540.95152 0 109 - 540.95152 - - 0s 0 0 540.95152 0 56 - 540.95152 - - 0s 0 0 662.37740 0 65 - 662.37740 - - 0s 0 0 665.02053 0 65 - 665.02053 - - 0s 0 0 670.24638 0 77 - 670.24638 - - 0s 0 0 671.41658 0 83 - 671.41658 - - 0s 0 0 684.32028 0 97 - 684.32028 - - 0s 0 0 688.16672 0 95 - 688.16672 - - 0s 0 0 712.42627 0 92 - 712.42627 - - 0s 0 0 719.18368 0 93 - 719.18368 - - 0s 0 0 725.22174 0 92 - 725.22174 - - 0s 0 0 727.23731 0 91 - 727.23731 - - 0s 0 0 733.06970 0 105 - 733.06970 - - 0s 0 0 734.64801 0 104 - 734.64801 - - 0s 0 0 736.21485 0 104 - 736.21485 - - 0s 0 0 737.85508 0 96 - 737.85508 - - 0s 0 0 739.68759 0 101 - 739.68759 - - 0s 0 0 740.61637 0 101 - 740.61637 - - 0s 0 0 751.51818 0 55 - 751.51818 - - 0s 0 0 752.61913 0 97 - 752.61913 - - 0s 0 0 755.00228 0 109 - 755.00228 - - 0s 0 0 755.20833 0 111 - 755.20833 - - 0s 0 0 763.14514 0 112 - 763.14514 - - 0s 0 0 763.44803 0 119 - 763.44803 - - 0s 0 0 764.03766 0 125 - 764.03766 - - 0s 0 0 764.03766 0 125 - 764.03766 - - 0s 0 2 764.03766 0 125 - 764.03766 - - 0s H 109 21 975.0000000 896.54417 8.05% 13.8 0s H 116 8 930.0000000 896.57895 3.59% 13.4 0s * 118 7 6 910.0000000 900.98708 0.99% 13.3 0s Cutting planes: Learned: 2 Implied bound: 3 Clique: 5 MIR: 61 Flow cover: 14 Explored 143 nodes (3186 simplex iterations) in 0.65 seconds Thread count was 4 (of 4 available processors) Solution count 3: 910 930 975 Pool objective bound 910 Optimal solution found (tolerance 1.00e-04) Best objective 9.100000000000e+02, best bound 9.100000000000e+02, gap 0.0000% Variable x ------------------------- Priority1-Day1 1 Priority1-Day2 1 Priority1-Day6 1 Priority2-Day1 1 Priority2-Day5 1 Priority2-Day6 1 Priority3-Day6 1 Priority1--Day1--Day1 5 Priority1--Day2--Day2 6 Priority1--Day6--Day6 3 Priority2--Day1--Day1 7 Priority2--Day5--Day5 1 Priority2--Day6--Day6 2 Priority3--Day6--Day6 7 Priority1-Day1-Day3 2 Priority1-Day2-Day2 1 Priority1-Day3-Day3 4 Priority1-Day4-Day4 5 Priority1-Day4-Day5 1 Priority1-Day5-Day5 3 Priority2-Day1-Day4 2 Priority2-Day2-Day2 1 Priority2-Day3-Day7 5 Priority2-Day5-Day6 1 Priority2-Day5-Day8 2 Priority2-Day5-Day9 1 Priority3-Day1-Day1 1 Priority3-Day2-Day8 6 Priority3-Day3-Day9 4 Priority3-Day4-Day9 1 Priority3-Day4-Day10 1 Priority3-Day5-Day5 1 Priority3-Day5-Day11 2 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 6 Priority1-Day1-Day3(r) 4 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 5 Priority1-Day2-Day4(r) 1 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 1 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority1-Day6-Day7(r) 3 Priority1-Day6-Day8(r) 3 Priority1-Day6-Day9(r) 3 Priority1-Day6-Day10(r) 3 Priority1-Day6-Day11(r) 3 Priority2-Day1-Day4(r) 3 Priority2-Day1-Day5(r) 8 Priority2-Day1-Day6(r) 8 Priority2-Day1-Day7(r) 8 Priority2-Day1-Day8(r) 8 Priority2-Day1-Day9(r) 8 Priority2-Day1-Day10(r) 8 Priority2-Day1-Day11(r) 8 Priority2-Day1-Day12(r) 8 Priority2-Day1-Day13(r) 8 Priority2-Day1-Day14(r) 8 Priority2-Day1-Day15(r) 8 Priority2-Day1-Day16(r) 8 Priority2-Day1-Day17(r) 8 Priority2-Day1-Day18(r) 8 Priority2-Day1-Day19(r) 8 Priority2-Day1-Day20(r) 8 Priority2-Day3-Day7(r) 5 Priority2-Day3-Day8(r) 5 Priority2-Day3-Day9(r) 5 Priority2-Day3-Day10(r) 5 Priority2-Day3-Day11(r) 5 Priority2-Day3-Day12(r) 5 Priority2-Day3-Day13(r) 5 Priority2-Day3-Day14(r) 5 Priority2-Day3-Day15(r) 5 Priority2-Day3-Day16(r) 5 Priority2-Day3-Day17(r) 5 Priority2-Day3-Day18(r) 5 Priority2-Day3-Day19(r) 5 Priority2-Day3-Day20(r) 5 Priority2-Day5-Day6(r) 1 Priority2-Day5-Day7(r) 1 Priority2-Day5-Day8(r) 3 Priority2-Day5-Day9(r) 4 Priority2-Day5-Day10(r) 4 Priority2-Day5-Day11(r) 4 Priority2-Day5-Day12(r) 4 Priority2-Day5-Day13(r) 4 Priority2-Day5-Day14(r) 4 Priority2-Day5-Day15(r) 4 Priority2-Day5-Day16(r) 4 Priority2-Day5-Day17(r) 4 Priority2-Day5-Day18(r) 4 Priority2-Day5-Day19(r) 4 Priority2-Day5-Day20(r) 4 Priority2-Day6-Day1(r) 2 Priority2-Day6-Day2(r) 2 Priority2-Day6-Day3(r) 2 Priority2-Day6-Day4(r) 2 Priority2-Day6-Day5(r) 2 Priority2-Day6-Day6(r) 2 Priority2-Day6-Day7(r) 2 Priority2-Day6-Day8(r) 2 Priority2-Day6-Day9(r) 2 Priority2-Day6-Day10(r) 2 Priority2-Day6-Day11(r) 2 Priority2-Day6-Day12(r) 2 Priority2-Day6-Day13(r) 2 Priority2-Day6-Day14(r) 2 Priority2-Day6-Day15(r) 2 Priority2-Day6-Day16(r) 2 Priority2-Day6-Day17(r) 2 Priority2-Day6-Day18(r) 2 Priority2-Day6-Day19(r) 2 Priority2-Day6-Day20(r) 2 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day9(r) 1 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day11(r) 2 Priority3-Day5-Day12(r) 2 Priority3-Day5-Day13(r) 2 Priority3-Day5-Day14(r) 2 Priority3-Day5-Day15(r) 2 Priority3-Day5-Day16(r) 2 Priority3-Day5-Day17(r) 2 Priority3-Day5-Day18(r) 2 Priority3-Day5-Day19(r) 2 Priority3-Day5-Day20(r) 2 Priority3-Day6-Day1(r) 1 Priority3-Day6-Day2(r) 1 Priority3-Day6-Day3(r) 1 Priority3-Day6-Day4(r) 1 Priority3-Day6-Day5(r) 1 Priority3-Day6-Day6(r) 1 Priority3-Day6-Day7(r) 1 Priority3-Day6-Day8(r) 1 Priority3-Day6-Day9(r) 1 Priority3-Day6-Day10(r) 1 Priority3-Day6-Day11(r) 6 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day1-Day3(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day2-Day3(w) 1 Priority1-Day2-Day4(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day3-Day4(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day4-Day5(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority1-Day6-Day7(w) 1 Priority1-Day6-Day8(w) 1 Priority1-Day6-Day9(w) 1 Priority1-Day6-Day10(w) 1 Priority1-Day6-Day11(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day3-Day6(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day6(w) 1 Priority2-Day5-Day7(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority2-Day6-Day1(w) 1 Priority2-Day6-Day2(w) 1 Priority2-Day6-Day3(w) 1 Priority2-Day6-Day4(w) 1 Priority2-Day6-Day5(w) 1 Priority2-Day6-Day6(w) 1 Priority2-Day6-Day7(w) 1 Priority2-Day6-Day8(w) 1 Priority2-Day6-Day9(w) 1 Priority2-Day6-Day10(w) 1 Priority2-Day6-Day11(w) 1 Priority2-Day6-Day12(w) 1 Priority2-Day6-Day13(w) 1 Priority2-Day6-Day14(w) 1 Priority2-Day6-Day15(w) 1 Priority2-Day6-Day16(w) 1 Priority2-Day6-Day17(w) 1 Priority2-Day6-Day18(w) 1 Priority2-Day6-Day19(w) 1 Priority2-Day6-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day9(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day1(w) 1 Priority3-Day6-Day2(w) 1 Priority3-Day6-Day3(w) 1 Priority3-Day6-Day4(w) 1 Priority3-Day6-Day5(w) 1 Priority3-Day6-Day6(w) 1 Priority3-Day6-Day7(w) 1 Priority3-Day6-Day8(w) 1 Priority3-Day6-Day9(w) 1 Priority3-Day6-Day10(w) 1 Priority3-Day6-Day11(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1321 rows and 703 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1762 rows and 962 columns Presolve time: 0.02s Presolved: 212 rows, 154 columns, 1651 nonzeros Variable types: 0 continuous, 154 integer (66 binary) Root relaxation: objective 7.249798e+02, 29 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 724.97983 0 30 - 724.97983 - - 0s 0 0 815.20541 0 33 - 815.20541 - - 0s 0 0 816.12648 0 43 - 816.12648 - - 0s 0 0 847.90706 0 56 - 847.90706 - - 0s 0 0 847.90706 0 31 - 847.90706 - - 0s 0 0 855.16328 0 44 - 855.16328 - - 0s 0 0 858.90004 0 47 - 858.90004 - - 0s 0 0 876.94289 0 56 - 876.94289 - - 0s 0 0 882.32464 0 52 - 882.32464 - - 0s 0 0 889.07033 0 56 - 889.07033 - - 0s 0 0 891.67606 0 51 - 891.67606 - - 0s 0 0 895.09101 0 61 - 895.09101 - - 0s 0 0 895.28624 0 61 - 895.28624 - - 0s 0 0 896.32315 0 58 - 896.32315 - - 0s 0 0 896.81414 0 58 - 896.81414 - - 0s 0 0 898.39060 0 60 - 898.39060 - - 0s 0 0 898.94205 0 59 - 898.94205 - - 0s 0 0 899.93318 0 64 - 899.93318 - - 0s 0 0 917.10667 0 56 - 917.10667 - - 0s 0 0 917.10667 0 56 - 917.10667 - - 0s 0 2 917.10667 0 56 - 917.10667 - - 0s Cutting planes: Gomory: 3 Implied bound: 4 Clique: 1 MIR: 16 Flow cover: 5 Explored 36 nodes (785 simplex iterations) in 0.20 seconds Thread count was 4 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1378 rows and 703 columns Presolve time: 0.05s Presolved: 596 rows, 413 columns, 5281 nonzeros Variable types: 0 continuous, 413 integer (182 binary) Found heuristic solution: objective 1495.0000000 Root relaxation: objective 4.090416e+02, 271 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 409.04162 0 107 1495.00000 409.04162 72.6% - 0s 0 0 786.23686 0 103 1495.00000 786.23686 47.4% - 0s 0 0 786.68997 0 103 1495.00000 786.68997 47.4% - 0s 0 0 917.77195 0 78 1495.00000 917.77195 38.6% - 0s 0 0 1265.71429 0 5 1495.00000 1265.71429 15.3% - 0s H 0 0 1300.0000000 1265.71429 2.64% - 0s 0 0 cutoff 0 1300.00000 1300.00000 0.00% - 0s Cutting planes: MIR: 1 Explored 0 nodes (666 simplex iterations) in 0.24 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1300 1495 Pool objective bound 1300 Optimal solution found (tolerance 1.00e-04) Best objective 1.300000000000e+03, best bound 1.300000000000e+03, gap 0.0000% Variable x ------------------------- Priority1-Day1 1 Priority1-Day2 1 Priority1-Day4 1 Priority1-Day5 1 Priority2-Day5 1 Priority3-Day2 1 Priority3-Day4 1 Priority1--Day1--Day1 1 Priority1--Day2--Day2 6 Priority1--Day4--Day4 6 Priority1--Day5--Day5 3 Priority2--Day5--Day5 4 Priority3--Day4--Day4 2 Priority1-Day1-Day1 3 Priority1-Day1-Day2 3 Priority1-Day2-Day3 1 Priority1-Day3-Day3 4 Priority1-Day6-Day6 3 Priority2-Day1-Day3 3 Priority2-Day1-Day4 2 Priority2-Day1-Day5 4 Priority2-Day2-Day6 1 Priority2-Day3-Day6 2 Priority2-Day3-Day7 3 Priority2-Day5-Day6 1 Priority2-Day6-Day10 2 Priority3-Day1-Day7 1 Priority3-Day2-Day8 6 Priority3-Day3-Day9 4 Priority3-Day5-Day11 3 Priority3-Day6-Day11 4 Priority3-Day6-Day12 3 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 4 Priority1-Day1-Day3(r) 1 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 7 Priority1-Day2-Day4(r) 2 Priority1-Day2-Day5(r) 2 Priority1-Day2-Day6(r) 2 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 6 Priority1-Day4-Day6(r) 6 Priority1-Day4-Day7(r) 2 Priority1-Day4-Day8(r) 2 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day5-Day6(r) 3 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority2-Day1-Day3(r) 3 Priority2-Day1-Day4(r) 5 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day2-Day6(r) 1 Priority2-Day2-Day7(r) 1 Priority2-Day2-Day8(r) 1 Priority2-Day2-Day9(r) 1 Priority2-Day2-Day10(r) 1 Priority2-Day2-Day11(r) 1 Priority2-Day2-Day12(r) 1 Priority2-Day2-Day13(r) 1 Priority2-Day2-Day14(r) 1 Priority2-Day2-Day15(r) 1 Priority2-Day2-Day16(r) 1 Priority2-Day2-Day17(r) 1 Priority2-Day2-Day18(r) 1 Priority2-Day2-Day19(r) 1 Priority2-Day2-Day20(r) 1 Priority2-Day3-Day6(r) 2 Priority2-Day3-Day7(r) 5 Priority2-Day3-Day8(r) 5 Priority2-Day3-Day9(r) 5 Priority2-Day3-Day10(r) 5 Priority2-Day3-Day11(r) 5 Priority2-Day3-Day12(r) 5 Priority2-Day3-Day13(r) 5 Priority2-Day3-Day14(r) 5 Priority2-Day3-Day15(r) 5 Priority2-Day3-Day16(r) 5 Priority2-Day3-Day17(r) 5 Priority2-Day3-Day18(r) 5 Priority2-Day3-Day19(r) 5 Priority2-Day3-Day20(r) 5 Priority2-Day5-Day6(r) 3 Priority2-Day5-Day7(r) 3 Priority2-Day5-Day8(r) 5 Priority2-Day5-Day9(r) 5 Priority2-Day5-Day10(r) 5 Priority2-Day5-Day11(r) 5 Priority2-Day5-Day12(r) 5 Priority2-Day5-Day13(r) 5 Priority2-Day5-Day14(r) 5 Priority2-Day5-Day15(r) 5 Priority2-Day5-Day16(r) 5 Priority2-Day5-Day17(r) 5 Priority2-Day5-Day18(r) 5 Priority2-Day5-Day19(r) 5 Priority2-Day5-Day20(r) 5 Priority2-Day6-Day10(r) 2 Priority2-Day6-Day11(r) 2 Priority2-Day6-Day12(r) 2 Priority2-Day6-Day13(r) 2 Priority2-Day6-Day14(r) 2 Priority2-Day6-Day15(r) 2 Priority2-Day6-Day16(r) 2 Priority2-Day6-Day17(r) 2 Priority2-Day6-Day18(r) 2 Priority2-Day6-Day19(r) 2 Priority2-Day6-Day20(r) 2 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day11(r) 4 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day1-Day3(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day2-Day3(w) 1 Priority1-Day2-Day4(w) 1 Priority1-Day2-Day5(w) 1 Priority1-Day2-Day6(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day3-Day4(w) 1 Priority1-Day3-Day5(w) 1 Priority1-Day3-Day6(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day4-Day5(w) 1 Priority1-Day4-Day6(w) 1 Priority1-Day4-Day7(w) 1 Priority1-Day4-Day8(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day5-Day6(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority2-Day1-Day3(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day2-Day6(w) 1 Priority2-Day2-Day7(w) 1 Priority2-Day2-Day8(w) 1 Priority2-Day2-Day9(w) 1 Priority2-Day2-Day10(w) 1 Priority2-Day2-Day11(w) 1 Priority2-Day2-Day12(w) 1 Priority2-Day2-Day13(w) 1 Priority2-Day2-Day14(w) 1 Priority2-Day2-Day15(w) 1 Priority2-Day2-Day16(w) 1 Priority2-Day2-Day17(w) 1 Priority2-Day2-Day18(w) 1 Priority2-Day2-Day19(w) 1 Priority2-Day2-Day20(w) 1 Priority2-Day3-Day6(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day6(w) 1 Priority2-Day5-Day7(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority2-Day6-Day10(w) 1 Priority2-Day6-Day11(w) 1 Priority2-Day6-Day12(w) 1 Priority2-Day6-Day13(w) 1 Priority2-Day6-Day14(w) 1 Priority2-Day6-Day15(w) 1 Priority2-Day6-Day16(w) 1 Priority2-Day6-Day17(w) 1 Priority2-Day6-Day18(w) 1 Priority2-Day6-Day19(w) 1 Priority2-Day6-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day11(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1692 rows and 923 columns Presolve time: 0.02s Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1375 rows and 698 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1746 rows and 967 columns Presolve time: 0.04s Explored 0 nodes (0 simplex iterations) in 0.06 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1318 rows and 673 columns Presolve time: 0.02s Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+02] Presolve removed 1488 rows and 776 columns Presolve time: 0.03s Explored 0 nodes (0 simplex iterations) in 0.05 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+02] Presolve removed 1308 rows and 658 columns Presolve time: 0.04s Explored 0 nodes (0 simplex iterations) in 0.06 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1684 rows and 912 columns Presolve time: 0.04s Explored 0 nodes (0 simplex iterations) in 0.06 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1048 rows and 511 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1252 rows and 785 columns Presolve time: 0.05s Explored 0 nodes (0 simplex iterations) in 0.06 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1367 rows and 704 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+02] Presolve removed 1498 rows and 799 columns Presolve time: 0.02s Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1798 rows and 984 columns Presolve time: 0.05s Presolved: 176 rows, 132 columns, 1352 nonzeros Variable types: 0 continuous, 132 integer (57 binary) Root relaxation: objective 8.329452e+02, 71 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 832.94517 0 32 - 832.94517 - - 0s 0 0 infeasible 0 - infeasible - - 0s Cutting planes: Gomory: 4 MIR: 5 Zero half: 1 Explored 0 nodes (80 simplex iterations) in 0.10 seconds Thread count was 4 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1956 rows and 1099 columns Presolve time: 0.03s Presolved: 18 rows, 17 columns, 73 nonzeros Variable types: 0 continuous, 17 integer (8 binary) Found heuristic solution: objective 1570.0000000 Root relaxation: cutoff, 0 iterations, 0.00 seconds Explored 0 nodes (0 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1570 Pool objective bound 1570 Optimal solution found (tolerance 1.00e-04) Best objective 1.570000000000e+03, best bound 1.570000000000e+03, gap 0.0000% Variable x ------------------------- Priority1-Day3 1 Priority1-Day5 1 Priority2-Day5 1 Priority3-Day5 1 Priority1--Day3--Day3 3 Priority1--Day5--Day5 3 Priority2--Day5--Day5 5 Priority3--Day5--Day5 3 Priority1-Day1-Day1 5 Priority1-Day1-Day2 2 Priority1-Day2-Day2 5 Priority1-Day2-Day3 2 Priority1-Day3-Day4 1 Priority1-Day4-Day6 6 Priority1-Day6-Day6 1 Priority1-Day6-Day7 2 Priority2-Day1-Day4 6 Priority2-Day1-Day5 3 Priority2-Day2-Day6 1 Priority2-Day3-Day3 3 Priority2-Day3-Day7 2 Priority2-Day6-Day10 2 Priority3-Day1-Day7 1 Priority3-Day2-Day8 6 Priority3-Day3-Day9 4 Priority3-Day4-Day10 2 Priority3-Day6-Day11 1 Priority3-Day6-Day12 6 Priority1-Day1-Day1(r) 7 Priority1-Day1-Day2(r) 2 Priority1-Day2-Day1(r) 7 Priority1-Day2-Day2(r) 7 Priority1-Day2-Day3(r) 2 Priority1-Day3-Day1(r) 4 Priority1-Day3-Day2(r) 4 Priority1-Day3-Day3(r) 4 Priority1-Day3-Day4(r) 1 Priority1-Day4-Day1(r) 6 Priority1-Day4-Day2(r) 6 Priority1-Day4-Day3(r) 6 Priority1-Day4-Day4(r) 6 Priority1-Day4-Day5(r) 6 Priority1-Day4-Day6(r) 6 Priority1-Day5-Day1(r) 3 Priority1-Day5-Day2(r) 3 Priority1-Day5-Day3(r) 3 Priority1-Day5-Day4(r) 3 Priority1-Day5-Day5(r) 3 Priority1-Day5-Day6(r) 3 Priority1-Day5-Day7(r) 2 Priority1-Day6-Day1(r) 3 Priority1-Day6-Day2(r) 3 Priority1-Day6-Day3(r) 3 Priority1-Day6-Day4(r) 3 Priority1-Day6-Day5(r) 3 Priority1-Day6-Day6(r) 3 Priority1-Day6-Day7(r) 2 Priority2-Day1-Day4(r) 6 Priority2-Day1-Day5(r) 9 Priority2-Day1-Day6(r) 9 Priority2-Day1-Day7(r) 9 Priority2-Day1-Day8(r) 9 Priority2-Day1-Day9(r) 9 Priority2-Day1-Day10(r) 9 Priority2-Day1-Day11(r) 9 Priority2-Day1-Day12(r) 9 Priority2-Day1-Day13(r) 9 Priority2-Day1-Day14(r) 9 Priority2-Day1-Day15(r) 9 Priority2-Day1-Day16(r) 9 Priority2-Day1-Day17(r) 9 Priority2-Day1-Day18(r) 9 Priority2-Day1-Day19(r) 9 Priority2-Day1-Day20(r) 9 Priority2-Day2-Day6(r) 1 Priority2-Day2-Day7(r) 1 Priority2-Day2-Day8(r) 1 Priority2-Day2-Day9(r) 1 Priority2-Day2-Day10(r) 1 Priority2-Day2-Day11(r) 1 Priority2-Day2-Day12(r) 1 Priority2-Day2-Day13(r) 1 Priority2-Day2-Day14(r) 1 Priority2-Day2-Day15(r) 1 Priority2-Day2-Day16(r) 1 Priority2-Day2-Day17(r) 1 Priority2-Day2-Day18(r) 1 Priority2-Day2-Day19(r) 1 Priority2-Day2-Day20(r) 1 Priority2-Day3-Day7(r) 2 Priority2-Day3-Day8(r) 2 Priority2-Day3-Day9(r) 2 Priority2-Day3-Day10(r) 2 Priority2-Day3-Day11(r) 2 Priority2-Day3-Day12(r) 2 Priority2-Day3-Day13(r) 2 Priority2-Day3-Day14(r) 2 Priority2-Day3-Day15(r) 2 Priority2-Day3-Day16(r) 2 Priority2-Day3-Day17(r) 2 Priority2-Day3-Day18(r) 2 Priority2-Day3-Day19(r) 2 Priority2-Day3-Day20(r) 2 Priority2-Day5-Day7(r) 2 Priority2-Day5-Day8(r) 4 Priority2-Day5-Day9(r) 5 Priority2-Day5-Day10(r) 5 Priority2-Day5-Day11(r) 5 Priority2-Day5-Day12(r) 5 Priority2-Day5-Day13(r) 5 Priority2-Day5-Day14(r) 5 Priority2-Day5-Day15(r) 5 Priority2-Day5-Day16(r) 5 Priority2-Day5-Day17(r) 5 Priority2-Day5-Day18(r) 5 Priority2-Day5-Day19(r) 5 Priority2-Day5-Day20(r) 5 Priority2-Day6-Day10(r) 2 Priority2-Day6-Day11(r) 2 Priority2-Day6-Day12(r) 2 Priority2-Day6-Day13(r) 2 Priority2-Day6-Day14(r) 2 Priority2-Day6-Day15(r) 2 Priority2-Day6-Day16(r) 2 Priority2-Day6-Day17(r) 2 Priority2-Day6-Day18(r) 2 Priority2-Day6-Day19(r) 2 Priority2-Day6-Day20(r) 2 Priority3-Day1-Day7(r) 1 Priority3-Day1-Day8(r) 1 Priority3-Day1-Day9(r) 1 Priority3-Day1-Day10(r) 1 Priority3-Day1-Day11(r) 1 Priority3-Day1-Day12(r) 1 Priority3-Day1-Day13(r) 1 Priority3-Day1-Day14(r) 1 Priority3-Day1-Day15(r) 1 Priority3-Day1-Day16(r) 1 Priority3-Day1-Day17(r) 1 Priority3-Day1-Day18(r) 1 Priority3-Day1-Day19(r) 1 Priority3-Day1-Day20(r) 1 Priority3-Day2-Day8(r) 6 Priority3-Day2-Day9(r) 6 Priority3-Day2-Day10(r) 6 Priority3-Day2-Day11(r) 6 Priority3-Day2-Day12(r) 6 Priority3-Day2-Day13(r) 6 Priority3-Day2-Day14(r) 6 Priority3-Day2-Day15(r) 6 Priority3-Day2-Day16(r) 6 Priority3-Day2-Day17(r) 6 Priority3-Day2-Day18(r) 6 Priority3-Day2-Day19(r) 6 Priority3-Day2-Day20(r) 6 Priority3-Day3-Day9(r) 4 Priority3-Day3-Day10(r) 4 Priority3-Day3-Day11(r) 4 Priority3-Day3-Day12(r) 4 Priority3-Day3-Day13(r) 4 Priority3-Day3-Day14(r) 4 Priority3-Day3-Day15(r) 4 Priority3-Day3-Day16(r) 4 Priority3-Day3-Day17(r) 4 Priority3-Day3-Day18(r) 4 Priority3-Day3-Day19(r) 4 Priority3-Day3-Day20(r) 4 Priority3-Day4-Day10(r) 2 Priority3-Day4-Day11(r) 2 Priority3-Day4-Day12(r) 2 Priority3-Day4-Day13(r) 2 Priority3-Day4-Day14(r) 2 Priority3-Day4-Day15(r) 2 Priority3-Day4-Day16(r) 2 Priority3-Day4-Day17(r) 2 Priority3-Day4-Day18(r) 2 Priority3-Day4-Day19(r) 2 Priority3-Day4-Day20(r) 2 Priority3-Day5-Day11(r) 3 Priority3-Day5-Day12(r) 3 Priority3-Day5-Day13(r) 3 Priority3-Day5-Day14(r) 3 Priority3-Day5-Day15(r) 3 Priority3-Day5-Day16(r) 3 Priority3-Day5-Day17(r) 3 Priority3-Day5-Day18(r) 3 Priority3-Day5-Day19(r) 3 Priority3-Day5-Day20(r) 3 Priority3-Day6-Day11(r) 1 Priority3-Day6-Day12(r) 7 Priority3-Day6-Day13(r) 7 Priority3-Day6-Day14(r) 7 Priority3-Day6-Day15(r) 7 Priority3-Day6-Day16(r) 7 Priority3-Day6-Day17(r) 7 Priority3-Day6-Day18(r) 7 Priority3-Day6-Day19(r) 7 Priority3-Day6-Day20(r) 7 Priority1-Day1-Day1(w) 1 Priority1-Day1-Day2(w) 1 Priority1-Day2-Day1(w) 1 Priority1-Day2-Day2(w) 1 Priority1-Day2-Day3(w) 1 Priority1-Day3-Day1(w) 1 Priority1-Day3-Day2(w) 1 Priority1-Day3-Day3(w) 1 Priority1-Day3-Day4(w) 1 Priority1-Day4-Day1(w) 1 Priority1-Day4-Day2(w) 1 Priority1-Day4-Day3(w) 1 Priority1-Day4-Day4(w) 1 Priority1-Day4-Day5(w) 1 Priority1-Day4-Day6(w) 1 Priority1-Day5-Day1(w) 1 Priority1-Day5-Day2(w) 1 Priority1-Day5-Day3(w) 1 Priority1-Day5-Day4(w) 1 Priority1-Day5-Day5(w) 1 Priority1-Day5-Day6(w) 1 Priority1-Day5-Day7(w) 1 Priority1-Day5-Day8(w) 1 Priority1-Day6-Day1(w) 1 Priority1-Day6-Day2(w) 1 Priority1-Day6-Day3(w) 1 Priority1-Day6-Day4(w) 1 Priority1-Day6-Day5(w) 1 Priority1-Day6-Day6(w) 1 Priority1-Day6-Day7(w) 1 Priority1-Day6-Day8(w) 1 Priority2-Day1-Day4(w) 1 Priority2-Day1-Day5(w) 1 Priority2-Day1-Day6(w) 1 Priority2-Day1-Day7(w) 1 Priority2-Day1-Day8(w) 1 Priority2-Day1-Day9(w) 1 Priority2-Day1-Day10(w) 1 Priority2-Day1-Day11(w) 1 Priority2-Day1-Day12(w) 1 Priority2-Day1-Day13(w) 1 Priority2-Day1-Day14(w) 1 Priority2-Day1-Day15(w) 1 Priority2-Day1-Day16(w) 1 Priority2-Day1-Day17(w) 1 Priority2-Day1-Day18(w) 1 Priority2-Day1-Day19(w) 1 Priority2-Day1-Day20(w) 1 Priority2-Day2-Day6(w) 1 Priority2-Day2-Day7(w) 1 Priority2-Day2-Day8(w) 1 Priority2-Day2-Day9(w) 1 Priority2-Day2-Day10(w) 1 Priority2-Day2-Day11(w) 1 Priority2-Day2-Day12(w) 1 Priority2-Day2-Day13(w) 1 Priority2-Day2-Day14(w) 1 Priority2-Day2-Day15(w) 1 Priority2-Day2-Day16(w) 1 Priority2-Day2-Day17(w) 1 Priority2-Day2-Day18(w) 1 Priority2-Day2-Day19(w) 1 Priority2-Day2-Day20(w) 1 Priority2-Day3-Day7(w) 1 Priority2-Day3-Day8(w) 1 Priority2-Day3-Day9(w) 1 Priority2-Day3-Day10(w) 1 Priority2-Day3-Day11(w) 1 Priority2-Day3-Day12(w) 1 Priority2-Day3-Day13(w) 1 Priority2-Day3-Day14(w) 1 Priority2-Day3-Day15(w) 1 Priority2-Day3-Day16(w) 1 Priority2-Day3-Day17(w) 1 Priority2-Day3-Day18(w) 1 Priority2-Day3-Day19(w) 1 Priority2-Day3-Day20(w) 1 Priority2-Day5-Day7(w) 1 Priority2-Day5-Day8(w) 1 Priority2-Day5-Day9(w) 1 Priority2-Day5-Day10(w) 1 Priority2-Day5-Day11(w) 1 Priority2-Day5-Day12(w) 1 Priority2-Day5-Day13(w) 1 Priority2-Day5-Day14(w) 1 Priority2-Day5-Day15(w) 1 Priority2-Day5-Day16(w) 1 Priority2-Day5-Day17(w) 1 Priority2-Day5-Day18(w) 1 Priority2-Day5-Day19(w) 1 Priority2-Day5-Day20(w) 1 Priority2-Day6-Day10(w) 1 Priority2-Day6-Day11(w) 1 Priority2-Day6-Day12(w) 1 Priority2-Day6-Day13(w) 1 Priority2-Day6-Day14(w) 1 Priority2-Day6-Day15(w) 1 Priority2-Day6-Day16(w) 1 Priority2-Day6-Day17(w) 1 Priority2-Day6-Day18(w) 1 Priority2-Day6-Day19(w) 1 Priority2-Day6-Day20(w) 1 Priority3-Day1-Day7(w) 1 Priority3-Day1-Day8(w) 1 Priority3-Day1-Day9(w) 1 Priority3-Day1-Day10(w) 1 Priority3-Day1-Day11(w) 1 Priority3-Day1-Day12(w) 1 Priority3-Day1-Day13(w) 1 Priority3-Day1-Day14(w) 1 Priority3-Day1-Day15(w) 1 Priority3-Day1-Day16(w) 1 Priority3-Day1-Day17(w) 1 Priority3-Day1-Day18(w) 1 Priority3-Day1-Day19(w) 1 Priority3-Day1-Day20(w) 1 Priority3-Day2-Day8(w) 1 Priority3-Day2-Day9(w) 1 Priority3-Day2-Day10(w) 1 Priority3-Day2-Day11(w) 1 Priority3-Day2-Day12(w) 1 Priority3-Day2-Day13(w) 1 Priority3-Day2-Day14(w) 1 Priority3-Day2-Day15(w) 1 Priority3-Day2-Day16(w) 1 Priority3-Day2-Day17(w) 1 Priority3-Day2-Day18(w) 1 Priority3-Day2-Day19(w) 1 Priority3-Day2-Day20(w) 1 Priority3-Day3-Day9(w) 1 Priority3-Day3-Day10(w) 1 Priority3-Day3-Day11(w) 1 Priority3-Day3-Day12(w) 1 Priority3-Day3-Day13(w) 1 Priority3-Day3-Day14(w) 1 Priority3-Day3-Day15(w) 1 Priority3-Day3-Day16(w) 1 Priority3-Day3-Day17(w) 1 Priority3-Day3-Day18(w) 1 Priority3-Day3-Day19(w) 1 Priority3-Day3-Day20(w) 1 Priority3-Day4-Day10(w) 1 Priority3-Day4-Day11(w) 1 Priority3-Day4-Day12(w) 1 Priority3-Day4-Day13(w) 1 Priority3-Day4-Day14(w) 1 Priority3-Day4-Day15(w) 1 Priority3-Day4-Day16(w) 1 Priority3-Day4-Day17(w) 1 Priority3-Day4-Day18(w) 1 Priority3-Day4-Day19(w) 1 Priority3-Day4-Day20(w) 1 Priority3-Day5-Day11(w) 1 Priority3-Day5-Day12(w) 1 Priority3-Day5-Day13(w) 1 Priority3-Day5-Day14(w) 1 Priority3-Day5-Day15(w) 1 Priority3-Day5-Day16(w) 1 Priority3-Day5-Day17(w) 1 Priority3-Day5-Day18(w) 1 Priority3-Day5-Day19(w) 1 Priority3-Day5-Day20(w) 1 Priority3-Day6-Day11(w) 1 Priority3-Day6-Day12(w) 1 Priority3-Day6-Day13(w) 1 Priority3-Day6-Day14(w) 1 Priority3-Day6-Day15(w) 1 Priority3-Day6-Day16(w) 1 Priority3-Day6-Day17(w) 1 Priority3-Day6-Day18(w) 1 Priority3-Day6-Day19(w) 1 Priority3-Day6-Day20(w) 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+02] Presolve removed 1462 rows and 759 columns Presolve time: 0.05s Explored 0 nodes (0 simplex iterations) in 0.06 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1362 rows and 703 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1320 rows and 658 columns Presolve time: 0.05s Presolved: 654 rows, 458 columns, 7226 nonzeros Variable types: 0 continuous, 458 integer (205 binary) Root relaxation: objective 2.889545e+03, 248 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2889.54545 0 13 - 2889.54545 - - 0s 0 0 2925.00000 0 14 - 2925.00000 - - 0s 0 0 2940.00000 0 6 - 2940.00000 - - 0s 0 0 2940.00000 0 15 - 2940.00000 - - 0s 0 0 2941.25000 0 10 - 2941.25000 - - 0s 0 0 2945.17857 0 32 - 2945.17857 - - 0s 0 0 2945.17857 0 37 - 2945.17857 - - 0s 0 0 2954.91837 0 36 - 2954.91837 - - 0s * 0 0 0 2955.0000000 2955.00000 0.00% - 0s Cutting planes: Gomory: 4 MIR: 10 Flow cover: 4 Zero half: 1 Explored 0 nodes (510 simplex iterations) in 0.22 seconds Thread count was 4 (of 4 available processors) Solution count 1: 2955 Pool objective bound 2955 Optimal solution found (tolerance 1.00e-04) Best objective 2.955000000000e+03, best bound 2.955000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1442 rows and 742 columns Presolve time: 0.03s Presolved: 532 rows, 374 columns, 4657 nonzeros Variable types: 0 continuous, 374 integer (164 binary) Root relaxation: objective 3.388845e+03, 257 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3388.84473 0 23 - 3388.84473 - - 0s 0 0 3514.84000 0 49 - 3514.84000 - - 0s 0 0 3515.08625 0 59 - 3515.08625 - - 0s 0 0 3556.02296 0 65 - 3556.02296 - - 0s 0 0 3556.02296 0 24 - 3556.02296 - - 0s 0 0 3587.59419 0 53 - 3587.59419 - - 0s 0 0 3591.09280 0 48 - 3591.09280 - - 0s 0 0 3669.07196 0 47 - 3669.07196 - - 0s 0 0 3672.93771 0 50 - 3672.93771 - - 0s 0 0 3698.42838 0 58 - 3698.42838 - - 0s 0 0 3700.52433 0 51 - 3700.52433 - - 0s 0 0 3718.91896 0 62 - 3718.91896 - - 0s 0 0 3724.50124 0 60 - 3724.50124 - - 0s 0 0 3732.03796 0 60 - 3732.03796 - - 0s 0 0 infeasible 0 - infeasible - - 0s Cutting planes: Gomory: 5 Implied bound: 4 MIR: 13 Flow cover: 3 Mod-K: 4 Explored 0 nodes (686 simplex iterations) in 0.24 seconds Thread count was 4 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+02] Presolve removed 1587 rows and 854 columns Presolve time: 0.02s Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1252 rows and 616 columns Presolve time: 0.05s Presolved: 722 rows, 500 columns, 6695 nonzeros Variable types: 0 continuous, 500 integer (235 binary) Root relaxation: objective 3.333154e+03, 290 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3333.15431 0 68 - 3333.15431 - - 0s 0 0 3524.75528 0 74 - 3524.75528 - - 0s 0 0 3524.75528 0 75 - 3524.75528 - - 0s 0 0 3665.00537 0 84 - 3665.00537 - - 0s 0 0 3665.00537 0 38 - 3665.00537 - - 0s 0 0 infeasible 0 - infeasible - - 0s Cutting planes: Gomory: 7 Implied bound: 2 MIR: 20 Flow cover: 1 Zero half: 1 Explored 0 nodes (1128 simplex iterations) in 0.26 seconds Thread count was 4 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1622 rows and 854 columns Presolve time: 0.05s Explored 0 nodes (0 simplex iterations) in 0.07 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1534 rows and 815 columns Presolve time: 0.03s Explored 0 nodes (0 simplex iterations) in 0.05 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1648 rows and 911 columns Presolve time: 0.02s Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+02] Presolve removed 1491 rows and 793 columns Presolve time: 0.03s Explored 0 nodes (0 simplex iterations) in 0.05 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+02] Presolve removed 1321 rows and 663 columns Presolve time: 0.05s Presolved: 653 rows, 453 columns, 6708 nonzeros Variable types: 0 continuous, 453 integer (196 binary) Root relaxation: objective 2.831420e+03, 301 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2831.42045 0 31 - 2831.42045 - - 0s 0 0 2921.72180 0 32 - 2921.72180 - - 0s 0 0 2921.72180 0 33 - 2921.72180 - - 0s 0 0 2963.03095 0 39 - 2963.03095 - - 0s 0 0 2963.03095 0 29 - 2963.03095 - - 0s 0 0 2973.11563 0 43 - 2973.11563 - - 0s 0 0 2975.22365 0 45 - 2975.22365 - - 0s 0 0 2992.92040 0 56 - 2992.92040 - - 0s 0 0 2992.92329 0 60 - 2992.92329 - - 0s 0 0 3000.22989 0 48 - 3000.22989 - - 0s 0 0 3000.63025 0 50 - 3000.63025 - - 0s 0 0 3003.76938 0 56 - 3003.76938 - - 0s 0 0 3005.03788 0 51 - 3005.03788 - - 0s 0 0 3008.53652 0 63 - 3008.53652 - - 0s 0 0 3008.71294 0 71 - 3008.71294 - - 0s 0 0 3013.87732 0 54 - 3013.87732 - - 0s 0 0 3014.58951 0 65 - 3014.58951 - - 0s 0 0 3017.19603 0 55 - 3017.19603 - - 0s 0 0 3019.78388 0 55 - 3019.78388 - - 0s 0 0 3027.43358 0 54 - 3027.43358 - - 0s 0 0 3029.35043 0 56 - 3029.35043 - - 0s 0 0 3029.63766 0 62 - 3029.63766 - - 0s 0 0 3033.22416 0 61 - 3033.22416 - - 0s 0 0 3033.72537 0 59 - 3033.72537 - - 0s 0 0 3034.97312 0 62 - 3034.97312 - - 0s 0 0 3035.18496 0 69 - 3035.18496 - - 0s 0 0 3035.18496 0 69 - 3035.18496 - - 0s 0 0 3035.60029 0 64 - 3035.60029 - - 0s 0 0 3036.07773 0 63 - 3036.07773 - - 0s 0 0 3036.20024 0 69 - 3036.20024 - - 0s 0 0 3055.50990 0 57 - 3055.50990 - - 0s 0 0 3057.87859 0 44 - 3057.87859 - - 0s 0 0 3057.87859 0 44 - 3057.87859 - - 0s 0 2 3057.87859 0 44 - 3057.87859 - - 0s Cutting planes: Gomory: 4 Implied bound: 3 Clique: 1 MIR: 20 Flow cover: 4 Mod-K: 2 Explored 3 nodes (1220 simplex iterations) in 0.59 seconds Thread count was 4 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+02] Presolve removed 1132 rows and 538 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Variable x ------------------------- Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1447 rows and 769 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1208 rows and 583 columns Presolve time: 0.01s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1829 rows and 1004 columns Presolve time: 0.04s Presolved: 145 rows, 112 columns, 956 nonzeros Variable types: 0 continuous, 112 integer (41 binary) Found heuristic solution: objective 3180.0000000 Root relaxation: objective 3.135000e+03, 46 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3135.00000 0 2 3180.00000 3135.00000 1.42% - 0s H 0 0 3160.0000000 3135.00000 0.79% - 0s 0 0 3137.75862 0 14 3160.00000 3137.75862 0.70% - 0s 0 0 3142.02479 0 18 3160.00000 3142.02479 0.57% - 0s 0 0 cutoff 0 3160.00000 3155.00316 0.16% - 0s Cutting planes: Cover: 1 Implied bound: 3 MIR: 5 Explored 0 nodes (94 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 2: 3160 3180 Pool objective bound 3160 Optimal solution found (tolerance 1.00e-04) Best objective 3.160000000000e+03, best bound 3.160000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+02] Presolve removed 1507 rows and 780 columns Presolve time: 0.04s Presolved: 467 rows, 336 columns, 5152 nonzeros Variable types: 0 continuous, 336 integer (139 binary) Root relaxation: infeasible, 97 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 infeasible 0 - infeasible - - 0s Explored 0 nodes (97 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6700 Presolve removed 1503 rows and 807 columns Presolve time: 0.06s Presolved: 453 rows, 309 columns, 4432 nonzeros Found heuristic solution: objective 4960.0000000 Variable types: 0 continuous, 309 integer (145 binary) Root relaxation: objective 3.055000e+03, 242 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3055.00000 0 2 4960.00000 3055.00000 38.4% - 0s H 0 0 3465.0000000 3055.00000 11.8% - 0s H 0 0 3385.0000000 3055.00000 9.75% - 0s 0 0 3055.00000 0 27 3385.00000 3055.00000 9.75% - 0s H 0 0 3165.0000000 3055.00000 3.48% - 0s 0 0 3055.00000 0 22 3165.00000 3055.00000 3.48% - 0s 0 0 3055.00000 0 2 3165.00000 3055.00000 3.48% - 0s 0 0 3055.00000 0 19 3165.00000 3055.00000 3.48% - 0s 0 0 3055.00000 0 21 3165.00000 3055.00000 3.48% - 0s 0 0 3058.26923 0 36 3165.00000 3058.26923 3.37% - 0s 0 0 3060.76923 0 30 3165.00000 3060.76923 3.29% - 0s 0 0 3064.00000 0 30 3165.00000 3064.00000 3.19% - 0s 0 0 3066.50000 0 32 3165.00000 3066.50000 3.11% - 0s 0 0 3066.94444 0 32 3165.00000 3066.94444 3.10% - 0s 0 0 3077.20000 0 40 3165.00000 3077.20000 2.77% - 0s 0 0 3077.57647 0 44 3165.00000 3077.57647 2.76% - 0s 0 0 3094.75612 0 46 3165.00000 3094.75612 2.22% - 0s 0 0 3096.93333 0 42 3165.00000 3096.93333 2.15% - 0s 0 0 3098.61892 0 46 3165.00000 3098.61892 2.10% - 0s 0 0 3099.94753 0 53 3165.00000 3099.94753 2.06% - 0s 0 0 3116.26708 0 46 3165.00000 3116.26708 1.54% - 0s 0 0 3116.32692 0 46 3165.00000 3116.32692 1.54% - 0s 0 0 3117.52660 0 45 3165.00000 3117.52660 1.50% - 0s H 0 0 3120.0000000 3117.52660 0.08% - 0s Cutting planes: Gomory: 1 Implied bound: 2 MIR: 10 Flow cover: 2 Explored 0 nodes (591 simplex iterations) in 0.22 seconds Thread count was 4 (of 4 available processors) Solution count 7: 3120 3165 3385 ... 6800 Pool objective bound 3120 Optimal solution found (tolerance 1.00e-04) Best objective 3.120000000000e+03, best bound 3.120000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6100 Presolve removed 1317 rows and 680 columns Presolve time: 0.05s Presolved: 639 rows, 436 columns, 6308 nonzeros Variable types: 0 continuous, 436 integer (194 binary) Root relaxation: objective 2.071667e+03, 312 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2071.66667 0 4 6100.00000 2071.66667 66.0% - 0s H 0 0 2105.0000000 2071.66667 1.58% - 0s 0 0 2095.00000 0 1 2105.00000 2095.00000 0.48% - 0s 0 0 cutoff 0 2105.00000 2105.00000 0.00% - 0s Explored 0 nodes (362 simplex iterations) in 0.10 seconds Thread count was 4 (of 4 available processors) Solution count 3: 2105 2105 6100 Pool objective bound 2105 Optimal solution found (tolerance 1.00e-04) Best objective 2.105000000000e+03, best bound 2.105000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6800 Presolve removed 1389 rows and 728 columns Presolve time: 0.06s Presolved: 567 rows, 388 columns, 6614 nonzeros Variable types: 0 continuous, 388 integer (178 binary) Root relaxation: objective 3.740000e+03, 207 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3740.00000 0 3 6800.00000 3740.00000 45.0% - 0s H 0 0 4060.0000000 3740.00000 7.88% - 0s H 0 0 3910.0000000 3740.00000 4.35% - 0s 0 0 3783.33333 0 5 3910.00000 3783.33333 3.24% - 0s 0 0 3800.00000 0 18 3910.00000 3800.00000 2.81% - 0s 0 0 3800.00000 0 1 3910.00000 3800.00000 2.81% - 0s 0 0 3800.00000 0 9 3910.00000 3800.00000 2.81% - 0s 0 0 3800.00000 0 13 3910.00000 3800.00000 2.81% - 0s 0 0 3808.24627 0 27 3910.00000 3808.24627 2.60% - 0s 0 0 3814.96269 0 27 3910.00000 3814.96269 2.43% - 0s 0 0 3814.96667 0 27 3910.00000 3814.96667 2.43% - 0s 0 0 3815.38462 0 26 3910.00000 3815.38462 2.42% - 0s 0 0 3815.38462 0 35 3910.00000 3815.38462 2.42% - 0s 0 0 3815.38462 0 33 3910.00000 3815.38462 2.42% - 0s 0 0 3815.46154 0 34 3910.00000 3815.46154 2.42% - 0s H 0 0 3820.0000000 3815.46154 0.12% - 0s Cutting planes: MIR: 18 Flow cover: 7 Explored 0 nodes (530 simplex iterations) in 0.25 seconds Thread count was 4 (of 4 available processors) Solution count 4: 3820 3910 4060 6800 Pool objective bound 3820 Optimal solution found (tolerance 1.00e-04) Best objective 3.820000000000e+03, best bound 3.820000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6600 Presolve removed 1237 rows and 634 columns Presolve time: 0.04s Presolved: 719 rows, 482 columns, 6630 nonzeros Variable types: 0 continuous, 482 integer (215 binary) Root relaxation: objective 1.970000e+03, 338 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1970.0000000 1970.00000 0.00% - 0s Explored 0 nodes (351 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1970 6600 Pool objective bound 1970 Optimal solution found (tolerance 1.00e-04) Best objective 1.970000000000e+03, best bound 1.970000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6900 Presolve removed 1266 rows and 650 columns Presolve time: 0.07s Presolved: 690 rows, 466 columns, 8499 nonzeros Variable types: 0 continuous, 466 integer (213 binary) Root relaxation: objective 3.685000e+03, 271 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3685.00000 0 7 6900.00000 3685.00000 46.6% - 0s H 0 0 3725.0000000 3685.00000 1.07% - 0s 0 0 3690.00000 0 19 3725.00000 3690.00000 0.94% - 0s 0 0 3693.88889 0 61 3725.00000 3693.88889 0.84% - 0s 0 0 3695.00000 0 2 3725.00000 3695.00000 0.81% - 0s 0 0 3703.33333 0 21 3725.00000 3703.33333 0.58% - 0s 0 0 3705.00000 0 8 3725.00000 3705.00000 0.54% - 0s 0 0 3711.66667 0 11 3725.00000 3711.66667 0.36% - 0s 0 0 cutoff 0 3725.00000 3725.00000 0.00% - 0s Explored 0 nodes (616 simplex iterations) in 0.19 seconds Thread count was 4 (of 4 available processors) Solution count 3: 3725 3725 6900 Pool objective bound 3725 Optimal solution found (tolerance 1.00e-04) Best objective 3.725000000000e+03, best bound 3.725000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6800 Presolve removed 1370 rows and 719 columns Presolve time: 0.06s Presolved: 586 rows, 397 columns, 6583 nonzeros Variable types: 0 continuous, 397 integer (180 binary) Root relaxation: objective 3.155000e+03, 293 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3155.00000 0 2 6800.00000 3155.00000 53.6% - 0s H 0 0 3220.0000000 3155.00000 2.02% - 0s 0 0 3160.58824 0 12 3220.00000 3160.58824 1.85% - 0s H 0 0 3190.0000000 3160.58824 0.92% - 0s 0 0 3170.00000 0 1 3190.00000 3170.00000 0.63% - 0s Explored 0 nodes (350 simplex iterations) in 0.14 seconds Thread count was 4 (of 4 available processors) Solution count 4: 3190 3190 3220 6800 Pool objective bound 3190 Optimal solution found (tolerance 1.00e-04) Best objective 3.190000000000e+03, best bound 3.190000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7100 Presolve removed 1384 rows and 725 columns Presolve time: 0.05s Presolved: 572 rows, 391 columns, 6056 nonzeros Variable types: 0 continuous, 391 integer (175 binary) Root relaxation: objective 3.205000e+03, 265 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3205.00000 0 2 7100.00000 3205.00000 54.9% - 0s H 0 0 3405.0000000 3205.00000 5.87% - 0s H 0 0 3255.0000000 3205.00000 1.54% - 0s 0 0 3215.00000 0 18 3255.00000 3215.00000 1.23% - 0s H 0 0 3215.0000000 3215.00000 0.00% - 0s Cutting planes: MIR: 1 Explored 0 nodes (285 simplex iterations) in 0.11 seconds Thread count was 4 (of 4 available processors) Solution count 4: 3215 3255 3405 7100 Pool objective bound 3215 Optimal solution found (tolerance 1.00e-04) Best objective 3.215000000000e+03, best bound 3.215000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6700 Presolve removed 1227 rows and 621 columns Presolve time: 0.06s Presolved: 729 rows, 495 columns, 7942 nonzeros Variable types: 0 continuous, 495 integer (222 binary) Root relaxation: objective 2.955000e+03, 390 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2955.00000 0 1 6700.00000 2955.00000 55.9% - 0s H 0 0 2985.0000000 2955.00000 1.01% - 0s 0 0 2955.68627 0 18 2985.00000 2955.68627 0.98% - 0s 0 0 2965.00000 0 16 2985.00000 2965.00000 0.67% - 0s 0 0 2965.00000 0 1 2985.00000 2965.00000 0.67% - 0s 0 0 2975.00000 0 14 2985.00000 2975.00000 0.34% - 0s Cutting planes: Flow cover: 1 Explored 0 nodes (612 simplex iterations) in 0.17 seconds Thread count was 4 (of 4 available processors) Solution count 2: 2985 6700 Pool objective bound 2985 Optimal solution found (tolerance 1.00e-04) Best objective 2.985000000000e+03, best bound 2.985000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 5700 Presolve removed 1215 rows and 614 columns Presolve time: 0.05s Presolved: 741 rows, 502 columns, 7177 nonzeros Variable types: 0 continuous, 502 integer (229 binary) Root relaxation: objective 2.085000e+03, 375 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2085.00000 0 2 5700.00000 2085.00000 63.4% - 0s H 0 0 2520.0000000 2085.00000 17.3% - 0s H 0 0 2150.0000000 2085.00000 3.02% - 0s 0 0 2105.00000 0 1 2150.00000 2105.00000 2.09% - 0s 0 0 2119.48413 0 103 2150.00000 2119.48413 1.42% - 0s 0 0 2120.00000 0 1 2150.00000 2120.00000 1.40% - 0s H 0 0 2145.0000000 2120.00000 1.17% - 0s H 0 0 2140.0000000 2120.00000 0.93% - 0s 0 0 2125.00000 0 1 2140.00000 2125.00000 0.70% - 0s 0 0 2130.00000 0 2 2140.00000 2130.00000 0.47% - 0s Explored 0 nodes (673 simplex iterations) in 0.17 seconds Thread count was 4 (of 4 available processors) Solution count 6: 2140 2140 2145 ... 5700 Pool objective bound 2140 Optimal solution found (tolerance 1.00e-04) Best objective 2.140000000000e+03, best bound 2.140000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6800 Presolve removed 1403 rows and 742 columns Presolve time: 0.04s Presolved: 553 rows, 374 columns, 5087 nonzeros Variable types: 0 continuous, 374 integer (163 binary) Root relaxation: objective 2.415000e+03, 261 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2415.00000 0 1 6800.00000 2415.00000 64.5% - 0s H 0 0 2500.0000000 2415.00000 3.40% - 0s H 0 0 2440.0000000 2415.00000 1.02% - 0s 0 0 cutoff 0 2440.00000 2435.00244 0.20% - 0s Cutting planes: Implied bound: 1 MIR: 1 Explored 0 nodes (310 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 3: 2440 2500 6800 Pool objective bound 2440 Optimal solution found (tolerance 1.00e-04) Best objective 2.440000000000e+03, best bound 2.440000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6800 Presolve removed 1487 rows and 791 columns Presolve time: 0.06s Presolved: 469 rows, 325 columns, 5281 nonzeros Variable types: 0 continuous, 325 integer (146 binary) Root relaxation: objective 4.190000e+03, 178 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 4190.00000 0 1 6800.00000 4190.00000 38.4% - 0s H 0 0 4280.0000000 4190.00000 2.10% - 0s 0 0 4190.00000 0 1 4280.00000 4190.00000 2.10% - 0s H 0 0 4200.0000000 4190.00000 0.24% - 0s H 0 0 4195.0000000 4190.00000 0.12% - 0s H 0 0 4190.0000000 4190.00000 0.00% - 0s Cutting planes: Implied bound: 1 MIR: 1 Explored 0 nodes (200 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 5: 4190 4195 4200 ... 6800 Pool objective bound 4190 Optimal solution found (tolerance 1.00e-04) Best objective 4.190000000000e+03, best bound 4.190000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1968 rows and 1114 columns Presolve time: 0.06s Explored 0 nodes (0 simplex iterations) in 0.08 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1974 rows and 1116 columns Presolve time: 0.04s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.05 seconds Thread count was 1 (of 4 available processors) Solution count 1: 4205 Pool objective bound 4205 Optimal solution found (tolerance 1.00e-04) Best objective 4.205000000000e+03, best bound 4.205000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1974 rows and 1116 columns Presolve time: 0.03s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.05 seconds Thread count was 1 (of 4 available processors) Solution count 1: 3670 Pool objective bound 3670 Optimal solution found (tolerance 1.00e-04) Best objective 3.670000000000e+03, best bound 3.670000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1965 rows and 1110 columns Presolve time: 0.02s Presolved: 9 rows, 6 columns, 18 nonzeros Variable types: 0 continuous, 6 integer (3 binary) Found heuristic solution: objective 3510.0000000 Root relaxation: cutoff, 0 iterations, 0.00 seconds Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 4 (of 4 available processors) Solution count 1: 3510 Pool objective bound 3510 Optimal solution found (tolerance 1.00e-04) Best objective 3.510000000000e+03, best bound 3.510000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+02] Presolve removed 1974 rows and 1116 columns Presolve time: 0.05s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.07 seconds Thread count was 1 (of 4 available processors) Solution count 1: 4460 Pool objective bound 4460 Optimal solution found (tolerance 1.00e-04) Best objective 4.460000000000e+03, best bound 4.460000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+02] Presolve removed 1189 rows and 890 columns Presolve time: 0.03s Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [8e-02, 1e+02] Presolve removed 1871 rows and 1039 columns Presolve time: 0.03s Presolved: 103 rows, 77 columns, 617 nonzeros Variable types: 0 continuous, 77 integer (40 binary) Found heuristic solution: objective 2625.0000000 Root relaxation: objective 2.537273e+03, 45 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2537.27273 0 9 2625.00000 2537.27273 3.34% - 0s H 0 0 2605.0000000 2537.27273 2.60% - 0s 0 0 2555.00000 0 17 2605.00000 2555.00000 1.92% - 0s 0 0 2556.11111 0 22 2605.00000 2556.11111 1.88% - 0s 0 0 2567.04545 0 26 2605.00000 2567.04545 1.46% - 0s 0 0 2567.13068 0 26 2605.00000 2567.13068 1.45% - 0s 0 0 2575.87719 0 27 2605.00000 2575.87719 1.12% - 0s 0 0 2576.87500 0 30 2605.00000 2576.87500 1.08% - 0s 0 0 2577.91667 0 25 2605.00000 2577.91667 1.04% - 0s 0 0 2588.33333 0 26 2605.00000 2588.33333 0.64% - 0s 0 0 2590.77465 0 27 2605.00000 2590.77465 0.55% - 0s 0 0 2590.77465 0 11 2605.00000 2590.77465 0.55% - 0s 0 0 cutoff 0 2605.00000 2605.00000 0.00% - 0s Cutting planes: Learned: 1 Gomory: 1 Clique: 1 MIR: 3 Flow cover: 2 Explored 0 nodes (173 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 2: 2605 2625 Pool objective bound 2605 Optimal solution found (tolerance 1.00e-04) Best objective 2.605000000000e+03, best bound 2.605000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1489 rows and 778 columns Presolve time: 0.02s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [6e-01, 1e+02] Presolve removed 1623 rows and 850 columns Presolve time: 0.07s Presolved: 351 rows, 266 columns, 4077 nonzeros Variable types: 0 continuous, 266 integer (128 binary) Root relaxation: objective 5.210733e+03, 203 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 5210.73333 0 30 - 5210.73333 - - 0s 0 0 5273.01546 0 87 - 5273.01546 - - 0s 0 0 5273.03704 0 90 - 5273.03704 - - 0s 0 0 5287.91825 0 71 - 5287.91825 - - 0s 0 0 5288.80404 0 84 - 5288.80404 - - 0s 0 0 5293.87106 0 104 - 5293.87106 - - 0s 0 0 5293.87106 0 104 - 5293.87106 - - 0s 0 0 5295.08720 0 97 - 5295.08720 - - 0s 0 0 5298.44868 0 103 - 5298.44868 - - 0s 0 0 5298.70571 0 109 - 5298.70571 - - 0s 0 0 5309.44098 0 78 - 5309.44098 - - 0s 0 0 5310.09870 0 88 - 5310.09870 - - 0s 0 0 5312.11541 0 103 - 5312.11541 - - 0s 0 0 5313.76263 0 104 - 5313.76263 - - 0s 0 0 5315.00000 0 58 - 5315.00000 - - 0s 0 0 5315.00000 0 44 - 5315.00000 - - 0s 0 0 5316.12000 0 51 - 5316.12000 - - 0s 0 0 5316.91358 0 95 - 5316.91358 - - 0s 0 0 5317.22222 0 59 - 5317.22222 - - 0s 0 0 5317.22222 0 62 - 5317.22222 - - 0s 0 0 5317.22222 0 65 - 5317.22222 - - 0s 0 0 5317.60870 0 66 - 5317.60870 - - 0s 0 0 5318.84615 0 95 - 5318.84615 - - 0s 0 0 5319.42219 0 103 - 5319.42219 - - 0s 0 0 5323.48214 0 89 - 5323.48214 - - 0s 0 0 5323.65113 0 92 - 5323.65113 - - 0s 0 0 5325.19231 0 102 - 5325.19231 - - 0s 0 0 5325.22876 0 107 - 5325.22876 - - 0s 0 0 5327.04458 0 104 - 5327.04458 - - 0s 0 0 5327.19877 0 103 - 5327.19877 - - 0s 0 0 5327.26657 0 105 - 5327.26657 - - 0s 0 0 5327.26657 0 105 - 5327.26657 - - 0s 0 0 5327.26657 0 46 - 5327.26657 - - 0s 0 0 5327.26657 0 67 - 5327.26657 - - 0s 0 0 5327.26657 0 86 - 5327.26657 - - 0s 0 0 5327.26657 0 58 - 5327.26657 - - 0s 0 0 5327.26657 0 85 - 5327.26657 - - 0s 0 0 5327.26657 0 89 - 5327.26657 - - 0s 0 0 5327.57346 0 94 - 5327.57346 - - 0s 0 0 5328.57766 0 98 - 5328.57766 - - 0s 0 0 5328.61195 0 102 - 5328.61195 - - 0s 0 0 5328.89652 0 96 - 5328.89652 - - 0s 0 0 5328.89652 0 97 - 5328.89652 - - 0s 0 0 5329.01556 0 90 - 5329.01556 - - 0s 0 0 5329.23112 0 80 - 5329.23112 - - 0s 0 0 5329.24963 0 84 - 5329.24963 - - 0s 0 0 5329.29800 0 98 - 5329.29800 - - 0s 0 0 5329.32917 0 83 - 5329.32917 - - 0s 0 0 5329.32917 0 87 - 5329.32917 - - 0s 0 0 5329.32917 0 84 - 5329.32917 - - 0s 0 0 5355.00000 0 1 - 5355.00000 - - 0s 0 0 5355.00000 0 1 - 5355.00000 - - 0s H 0 0 5390.0000000 5355.00000 0.65% - 0s H 0 0 5375.0000000 5355.00000 0.37% - 0s 0 0 cutoff 0 5375.00000 5375.00000 0.00% - 0s Cutting planes: Gomory: 1 Implied bound: 1 MIR: 22 StrongCG: 1 Flow cover: 9 Zero half: 5 Mod-K: 1 Explored 0 nodes (1645 simplex iterations) in 0.66 seconds Thread count was 4 (of 4 available processors) Solution count 2: 5375 5390 Pool objective bound 5375 Optimal solution found (tolerance 1.00e-04) Best objective 5.375000000000e+03, best bound 5.375000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+02] Presolve removed 1974 rows and 1116 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 4655 Pool objective bound 4655 Optimal solution found (tolerance 1.00e-04) Best objective 4.655000000000e+03, best bound 4.655000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+02] Presolve removed 1787 rows and 974 columns Presolve time: 0.04s Presolved: 187 rows, 142 columns, 1153 nonzeros Variable types: 0 continuous, 142 integer (63 binary) Root relaxation: objective 4.235000e+03, 77 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 4235.00000 0 6 - 4235.00000 - - 0s H 0 0 4255.0000000 4235.00000 0.47% - 0s 0 0 4237.77778 0 32 4255.00000 4237.77778 0.40% - 0s 0 0 cutoff 0 4255.00000 4250.00426 0.12% - 0s Cutting planes: Gomory: 4 Cover: 2 Implied bound: 8 MIR: 4 Flow cover: 1 Explored 0 nodes (131 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 1: 4255 Pool objective bound 4255 Optimal solution found (tolerance 1.00e-04) Best objective 4.255000000000e+03, best bound 4.255000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1974 rows and 1116 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 3430 Pool objective bound 3430 Optimal solution found (tolerance 1.00e-04) Best objective 3.430000000000e+03, best bound 3.430000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+02] Presolve removed 1974 rows and 1116 columns Presolve time: 0.04s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.05 seconds Thread count was 1 (of 4 available processors) Solution count 1: 4080 Pool objective bound 4080 Optimal solution found (tolerance 1.00e-04) Best objective 4.080000000000e+03, best bound 4.080000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [8e-02, 1e+02] Presolve removed 1709 rows and 936 columns Presolve time: 0.03s Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1952 rows and 1098 columns Presolve time: 0.03s Presolved: 22 rows, 18 columns, 72 nonzeros Variable types: 0 continuous, 18 integer (7 binary) Found heuristic solution: objective 3565.0000000 Root relaxation: objective 3.521667e+03, 19 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3521.66667 0 4 3565.00000 3521.66667 1.22% - 0s H 0 0 3535.0000000 3521.66667 0.38% - 0s H 0 0 3525.0000000 3521.66667 0.09% - 0s Explored 0 nodes (24 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 3: 3525 3535 3565 Pool objective bound 3525 Optimal solution found (tolerance 1.00e-04) Best objective 3.525000000000e+03, best bound 3.525000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1974 rows and 1116 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 1: 2875 Pool objective bound 2875 Optimal solution found (tolerance 1.00e-04) Best objective 2.875000000000e+03, best bound 2.875000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+02] Presolve removed 1297 rows and 647 columns Presolve time: 0.04s Explored 0 nodes (0 simplex iterations) in 0.07 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1974 rows and 1116 columns Presolve time: 0.02s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 3650 Pool objective bound 3650 Optimal solution found (tolerance 1.00e-04) Best objective 3.650000000000e+03, best bound 3.650000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1698 rows and 909 columns Presolve time: 0.02s Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+02] Presolve removed 1974 rows and 1116 columns Presolve time: 0.05s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.06 seconds Thread count was 1 (of 4 available processors) Solution count 1: 4315 Pool objective bound 4315 Optimal solution found (tolerance 1.00e-04) Best objective 4.315000000000e+03, best bound 4.315000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1474 rows and 787 columns Presolve time: 0.03s Explored 0 nodes (0 simplex iterations) in 0.05 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+02] Presolve removed 1458 rows and 759 columns Presolve time: 0.03s Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+02] Presolve removed 1974 rows and 1116 columns Presolve time: 0.05s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.07 seconds Thread count was 1 (of 4 available processors) Solution count 1: 4180 Pool objective bound 4180 Optimal solution found (tolerance 1.00e-04) Best objective 4.180000000000e+03, best bound 4.180000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1974 rows and 1116 columns Presolve time: 0.03s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.04 seconds Thread count was 1 (of 4 available processors) Solution count 1: 3025 Pool objective bound 3025 Optimal solution found (tolerance 1.00e-04) Best objective 3.025000000000e+03, best bound 3.025000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+02] Presolve removed 1959 rows and 1107 columns Presolve time: 0.04s Explored 0 nodes (0 simplex iterations) in 0.06 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6400 Presolve removed 1248 rows and 638 columns Presolve time: 0.06s Presolved: 708 rows, 478 columns, 8448 nonzeros Variable types: 0 continuous, 478 integer (231 binary) Root relaxation: objective 3.065952e+03, 241 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3065.95238 0 4 6400.00000 3065.95238 52.1% - 0s H 0 0 3075.0000000 3065.95238 0.29% - 0s Cutting planes: MIR: 1 Explored 0 nodes (254 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 2: 3075 6400 Pool objective bound 3075 Optimal solution found (tolerance 1.00e-04) Best objective 3.075000000000e+03, best bound 3.075000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7100 Presolve removed 1326 rows and 686 columns Presolve time: 0.05s Presolved: 630 rows, 430 columns, 6433 nonzeros Variable types: 0 continuous, 430 integer (195 binary) Root relaxation: objective 2.981000e+03, 289 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2981.00000 0 4 7100.00000 2981.00000 58.0% - 0s H 0 0 2995.0000000 2981.00000 0.47% - 0s Explored 0 nodes (302 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 2: 2995 7100 Pool objective bound 2995 Optimal solution found (tolerance 1.00e-04) Best objective 2.995000000000e+03, best bound 2.995000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 5800 Presolve removed 1402 rows and 732 columns Presolve time: 0.06s Presolved: 554 rows, 384 columns, 5909 nonzeros Variable types: 0 continuous, 384 integer (169 binary) Root relaxation: objective 2.785000e+03, 250 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2785.00000 0 2 5800.00000 2785.00000 52.0% - 0s H 0 0 3585.0000000 2785.00000 22.3% - 0s H 0 0 2915.0000000 2785.00000 4.46% - 0s 0 0 2810.71429 0 16 2915.00000 2810.71429 3.58% - 0s 0 0 2818.33333 0 26 2915.00000 2818.33333 3.32% - 0s 0 0 2822.14286 0 13 2915.00000 2822.14286 3.19% - 0s H 0 0 2840.0000000 2822.14286 0.63% - 0s 0 0 infeasible 0 2840.00000 2840.00000 0.00% - 0s Cutting planes: MIR: 2 Flow cover: 1 Explored 0 nodes (457 simplex iterations) in 0.18 seconds Thread count was 4 (of 4 available processors) Solution count 5: 2840 2915 2915 ... 5800 Pool objective bound 2840 Optimal solution found (tolerance 1.00e-04) Best objective 2.840000000000e+03, best bound 2.840000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7200 Presolve removed 1446 rows and 761 columns Presolve time: 0.04s Presolved: 510 rows, 355 columns, 6567 nonzeros Variable types: 0 continuous, 355 integer (175 binary) Root relaxation: objective 4.380000e+03, 257 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 4380.00000 0 1 7200.00000 4380.00000 39.2% - 0s H 0 0 4465.0000000 4380.00000 1.90% - 0s 0 0 4380.00000 0 19 4465.00000 4380.00000 1.90% - 0s 0 0 4387.50000 0 43 4465.00000 4387.50000 1.74% - 0s * 0 0 0 4395.0000000 4395.00000 0.00% - 0s Cutting planes: Gomory: 4 Implied bound: 2 MIR: 11 StrongCG: 3 Flow cover: 2 Explored 0 nodes (363 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 3: 4395 4465 7200 Pool objective bound 4395 Optimal solution found (tolerance 1.00e-04) Best objective 4.395000000000e+03, best bound 4.395000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6800 Presolve removed 1300 rows and 671 columns Presolve time: 0.05s Presolved: 656 rows, 445 columns, 6693 nonzeros Variable types: 0 continuous, 445 integer (206 binary) Root relaxation: objective 3.275000e+03, 314 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3275.00000 0 1 6800.00000 3275.00000 51.8% - 0s H 0 0 3285.0000000 3275.00000 0.30% - 0s 0 0 3275.00000 0 4 3285.00000 3275.00000 0.30% - 0s Cutting planes: Gomory: 1 MIR: 2 Explored 0 nodes (377 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 2: 3285 6800 Pool objective bound 3285 Optimal solution found (tolerance 1.00e-04) Best objective 3.285000000000e+03, best bound 3.285000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6700 Presolve removed 1204 rows and 609 columns Presolve time: 0.05s Presolved: 752 rows, 507 columns, 7249 nonzeros Variable types: 0 continuous, 507 integer (231 binary) Root relaxation: objective 2.440000e+03, 377 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2440.00000 0 12 6700.00000 2440.00000 63.6% - 0s H 0 0 2875.0000000 2440.00000 15.1% - 0s H 0 0 2665.0000000 2440.00000 8.44% - 0s 0 0 2480.67752 0 29 2665.00000 2480.67752 6.92% - 0s H 0 0 2570.0000000 2480.67752 3.48% - 0s H 0 0 2530.0000000 2480.67752 1.95% - 0s 0 0 2482.26891 0 29 2530.00000 2482.26891 1.89% - 0s 0 0 2505.14706 0 22 2530.00000 2505.14706 0.98% - 0s 0 0 2505.14706 0 12 2530.00000 2505.14706 0.98% - 0s 0 0 2515.00000 0 1 2530.00000 2515.00000 0.59% - 0s H 0 0 2520.0000000 2515.00000 0.20% - 0s Cutting planes: Gomory: 1 Cover: 1 Implied bound: 1 Clique: 1 MIR: 4 Explored 0 nodes (540 simplex iterations) in 0.16 seconds Thread count was 4 (of 4 available processors) Solution count 7: 2520 2530 2530 ... 6700 Pool objective bound 2520 Optimal solution found (tolerance 1.00e-04) Best objective 2.520000000000e+03, best bound 2.520000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6300 Presolve removed 1285 rows and 664 columns Presolve time: 0.05s Presolved: 671 rows, 452 columns, 6811 nonzeros Variable types: 0 continuous, 452 integer (204 binary) Root relaxation: objective 2.452667e+03, 313 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2452.66667 0 5 6300.00000 2452.66667 61.1% - 0s H 0 0 2500.0000000 2452.66667 1.89% - 0s 0 0 2485.00000 0 1 2500.00000 2485.00000 0.60% - 0s Cutting planes: Implied bound: 2 MIR: 2 Flow cover: 1 Explored 0 nodes (327 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 2: 2500 6300 Pool objective bound 2500 Optimal solution found (tolerance 1.00e-04) Best objective 2.500000000000e+03, best bound 2.500000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6700 Presolve removed 1293 rows and 669 columns Presolve time: 0.04s Presolved: 663 rows, 447 columns, 5256 nonzeros Variable types: 0 continuous, 447 integer (200 binary) Root relaxation: objective 2.170000e+03, 354 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2170.00000 0 1 6700.00000 2170.00000 67.6% - 0s H 0 0 2255.0000000 2170.00000 3.77% - 0s 0 0 2173.33333 0 41 2255.00000 2173.33333 3.62% - 0s H 0 0 2240.0000000 2173.33333 2.98% - 0s 0 0 2173.84615 0 25 2240.00000 2173.84615 2.95% - 0s 0 0 2198.00000 0 33 2240.00000 2198.00000 1.88% - 0s 0 0 2198.00000 0 1 2240.00000 2198.00000 1.88% - 0s 0 0 2198.00000 0 14 2240.00000 2198.00000 1.88% - 0s H 0 0 2210.0000000 2198.00000 0.54% - 0s 0 0 2198.12500 0 15 2210.00000 2198.12500 0.54% - 0s * 0 0 0 2200.0000000 2200.00000 0.00% - 0s Cutting planes: Gomory: 3 Implied bound: 3 MIR: 5 Flow cover: 1 Explored 0 nodes (518 simplex iterations) in 0.13 seconds Thread count was 4 (of 4 available processors) Solution count 6: 2200 2210 2240 ... 6700 Pool objective bound 2200 Optimal solution found (tolerance 1.00e-04) Best objective 2.200000000000e+03, best bound 2.200000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7100 Presolve removed 1334 rows and 692 columns Presolve time: 0.05s Presolved: 622 rows, 424 columns, 7276 nonzeros Variable types: 0 continuous, 424 integer (191 binary) Root relaxation: objective 3.450000e+03, 289 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3450.00000 0 2 7100.00000 3450.00000 51.4% - 0s H 0 0 3495.0000000 3450.00000 1.29% - 0s 0 0 3487.27778 0 8 3495.00000 3487.27778 0.22% - 0s Cutting planes: Gomory: 1 MIR: 1 Flow cover: 1 Explored 0 nodes (307 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 2: 3495 7100 Pool objective bound 3495 Optimal solution found (tolerance 1.00e-04) Best objective 3.495000000000e+03, best bound 3.495000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6900 Presolve removed 1439 rows and 759 columns Presolve time: 0.05s Presolved: 517 rows, 357 columns, 4735 nonzeros Variable types: 0 continuous, 357 integer (157 binary) Root relaxation: objective 2.850000e+03, 284 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2850.00000 0 3 6900.00000 2850.00000 58.7% - 0s H 0 0 3130.0000000 2850.00000 8.95% - 0s 0 0 2866.36364 0 39 3130.00000 2866.36364 8.42% - 0s 0 0 2870.00000 0 35 3130.00000 2870.00000 8.31% - 0s H 0 0 3125.0000000 2870.00000 8.16% - 0s 0 0 2870.00000 0 2 3125.00000 2870.00000 8.16% - 0s 0 0 2870.00000 0 8 3125.00000 2870.00000 8.16% - 0s H 0 0 2905.0000000 2870.00000 1.20% - 0s H 0 0 2900.0000000 2870.00000 1.03% - 0s H 0 0 2890.0000000 2870.00000 0.69% - 0s 0 0 2870.00000 0 8 2890.00000 2870.00000 0.69% - 0s 0 0 2870.93750 0 10 2890.00000 2870.93750 0.66% - 0s 0 0 infeasible 0 2890.00000 2890.00000 0.00% - 0s Cutting planes: Gomory: 4 MIR: 4 Flow cover: 3 Explored 0 nodes (636 simplex iterations) in 0.16 seconds Thread count was 4 (of 4 available processors) Solution count 6: 2890 2900 2905 ... 6900 Pool objective bound 2890 Optimal solution found (tolerance 1.00e-04) Best objective 2.890000000000e+03, best bound 2.890000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6900 Presolve removed 1495 rows and 803 columns Presolve time: 0.04s Presolved: 461 rows, 313 columns, 4283 nonzeros Variable types: 0 continuous, 313 integer (143 binary) Root relaxation: objective 3.255000e+03, 218 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 3255.0000000 3255.00000 0.00% - 0s Explored 0 nodes (221 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 3255 6900 Pool objective bound 3255 Optimal solution found (tolerance 1.00e-04) Best objective 3.255000000000e+03, best bound 3.255000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1956 rows, 1116 columns and 32979 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 6600 Presolve removed 1226 rows and 625 columns Presolve time: 0.05s Presolved: 730 rows, 491 columns, 6374 nonzeros Variable types: 0 continuous, 491 integer (218 binary) Root relaxation: objective 2.000000e+03, 363 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2000.00000 0 2 6600.00000 2000.00000 69.7% - 0s H 0 0 2035.0000000 2000.00000 1.72% - 0s H 0 0 2000.0000000 2000.00000 0.00% - 0s Explored 0 nodes (378 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 3: 2000 2035 6600 Pool objective bound 2000 Optimal solution found (tolerance 1.00e-04) Best objective 2.000000000000e+03, best bound 2.000000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Presolve removed 1642 rows and 892 columns Presolve time: 0.02s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1581 rows and 838 columns Presolve time: 0.03s Presolved: 393 rows, 278 columns, 2797 nonzeros Variable types: 0 continuous, 278 integer (124 binary) Found heuristic solution: objective 3625.0000000 Root relaxation: objective 3.428924e+03, 206 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3428.92361 0 31 3625.00000 3428.92361 5.41% - 0s 0 0 3564.01042 0 40 3625.00000 3564.01042 1.68% - 0s 0 0 3575.77009 0 37 3625.00000 3575.77009 1.36% - 0s 0 0 cutoff 0 3625.00000 3620.00363 0.14% - 0s Cutting planes: Gomory: 7 Cover: 2 Implied bound: 18 Clique: 1 MIR: 10 StrongCG: 1 Flow cover: 9 Zero half: 2 Explored 0 nodes (326 simplex iterations) in 0.10 seconds Thread count was 4 (of 4 available processors) Solution count 1: 3625 Pool objective bound 3625 Optimal solution found (tolerance 1.00e-04) Best objective 3.625000000000e+03, best bound 3.625000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (378 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Presolve removed 1453 rows and 754 columns Presolve time: 0.03s Explored 0 nodes (0 simplex iterations) in 0.05 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Presolve removed 1453 rows and 754 columns Presolve time: 0.03s Explored 0 nodes (0 simplex iterations) in 0.05 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Computing Irreducible Inconsistent Subsystem (IIS)... Constraints Bounds Runtime Min Max Min Max ------------------------------------------------ 0 1974 0 738 0s 0 1684 0 728 5s 0 1192 0 682 10s 0 768 0 592 15s 0 670 0 548 20s 6 551 0 500 25s 14 384 0 412 30s 53 53 50 50 35s IIS computed: 53 constraints, 50 bounds IIS runtime: 34.68 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 0 continuous, 1116 integer (360 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+02] Presolve removed 1942 rows and 1098 columns Presolve time: 0.03s Explored 0 nodes (0 simplex iterations) in 0.05 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+02] Found heuristic solution: objective 5900 Presolve removed 1405 rows and 727 columns Presolve time: 0.05s Presolved: 569 rows, 389 columns, 6761 nonzeros Variable types: 0 continuous, 389 integer (181 binary) Root relaxation: objective 3.330000e+03, 270 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3330.00000 0 1 5900.00000 3330.00000 43.6% - 0s H 0 0 3415.0000000 3330.00000 2.49% - 0s 0 0 3330.00000 0 8 3415.00000 3330.00000 2.49% - 0s 0 0 3353.33333 0 19 3415.00000 3353.33333 1.81% - 0s 0 0 3353.33333 0 1 3415.00000 3353.33333 1.81% - 0s 0 0 3353.33333 0 10 3415.00000 3353.33333 1.81% - 0s 0 0 3369.23077 0 19 3415.00000 3369.23077 1.34% - 0s 0 0 3369.23077 0 19 3415.00000 3369.23077 1.34% - 0s 0 0 3370.00000 0 10 3415.00000 3370.00000 1.32% - 0s 0 0 3371.70455 0 17 3415.00000 3371.70455 1.27% - 0s 0 0 3371.70455 0 17 3415.00000 3371.70455 1.27% - 0s 0 0 3371.70455 0 19 3415.00000 3371.70455 1.27% - 0s 0 0 3371.70455 0 21 3415.00000 3371.70455 1.27% - 0s 0 0 3371.70455 0 1 3415.00000 3371.70455 1.27% - 0s 0 0 3375.00000 0 12 3415.00000 3375.00000 1.17% - 0s 0 0 3376.11111 0 19 3415.00000 3376.11111 1.14% - 0s 0 0 3405.00000 0 17 3415.00000 3405.00000 0.29% - 0s 0 0 3407.85714 0 18 3415.00000 3407.85714 0.21% - 0s 0 0 3407.85714 0 3 3415.00000 3407.85714 0.21% - 0s 0 0 cutoff 0 3415.00000 3415.00000 0.00% - 0s Cutting planes: Learned: 1 Gomory: 3 Implied bound: 2 MIR: 4 Flow cover: 1 Explored 0 nodes (627 simplex iterations) in 0.20 seconds Thread count was 4 (of 4 available processors) Solution count 2: 3415 5900 Pool objective bound 3415 Optimal solution found (tolerance 1.00e-04) Best objective 3.415000000000e+03, best bound 3.415000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+02] Found heuristic solution: objective 6180 Presolve removed 1464 rows and 767 columns Presolve time: 0.03s Presolved: 510 rows, 349 columns, 5012 nonzeros Variable types: 0 continuous, 349 integer (158 binary) Root relaxation: objective 3.200000e+03, 237 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3200.00000 0 1 6180.00000 3200.00000 48.2% - 0s H 0 0 3205.0000000 3200.00000 0.16% - 0s 0 0 infeasible 0 3205.00000 3200.00321 0.16% - 0s Explored 0 nodes (247 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 2: 3205 6180 Pool objective bound 3205 Optimal solution found (tolerance 1.00e-04) Best objective 3.205000000000e+03, best bound 3.205000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+02] Found heuristic solution: objective 6400 Presolve removed 1525 rows and 806 columns Presolve time: 0.04s Presolved: 449 rows, 310 columns, 5191 nonzeros Variable types: 0 continuous, 310 integer (142 binary) Root relaxation: objective 3.520000e+03, 226 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3520.00000 0 2 6400.00000 3520.00000 45.0% - 0s H 0 0 3615.0000000 3520.00000 2.63% - 0s 0 0 3521.33333 0 10 3615.00000 3521.33333 2.59% - 0s H 0 0 3610.0000000 3521.33333 2.46% - 0s 0 0 3532.00000 0 10 3610.00000 3532.00000 2.16% - 0s 0 0 3532.00000 0 10 3610.00000 3532.00000 2.16% - 0s 0 0 3536.99248 0 45 3610.00000 3536.99248 2.02% - 0s 0 0 3536.99248 0 2 3610.00000 3536.99248 2.02% - 0s 0 0 3536.99248 0 10 3610.00000 3536.99248 2.02% - 0s 0 0 3536.99248 0 18 3610.00000 3536.99248 2.02% - 0s 0 0 3550.00000 0 2 3610.00000 3550.00000 1.66% - 0s 0 0 3550.00000 0 19 3610.00000 3550.00000 1.66% - 0s 0 0 3550.00000 0 19 3610.00000 3550.00000 1.66% - 0s 0 0 3550.39216 0 24 3610.00000 3550.39216 1.65% - 0s 0 0 3551.56098 0 24 3610.00000 3551.56098 1.62% - 0s 0 0 3552.34375 0 29 3610.00000 3552.34375 1.60% - 0s 0 0 3552.57143 0 30 3610.00000 3552.57143 1.59% - 0s 0 0 3554.28571 0 21 3610.00000 3554.28571 1.54% - 0s 0 0 3556.50602 0 31 3610.00000 3556.50602 1.48% - 0s 0 0 3556.50602 0 35 3610.00000 3556.50602 1.48% - 0s 0 0 3556.81159 0 26 3610.00000 3556.81159 1.47% - 0s 0 0 3557.61194 0 27 3610.00000 3557.61194 1.45% - 0s 0 0 3582.00000 0 25 3610.00000 3582.00000 0.78% - 0s 0 0 3583.33333 0 13 3610.00000 3583.33333 0.74% - 0s 0 0 3583.33333 0 13 3610.00000 3583.33333 0.74% - 0s 0 0 3583.33333 0 16 3610.00000 3583.33333 0.74% - 0s 0 0 3583.57143 0 14 3610.00000 3583.57143 0.73% - 0s 0 0 3587.50000 0 18 3610.00000 3587.50000 0.62% - 0s 0 0 3590.00000 0 9 3610.00000 3590.00000 0.55% - 0s 0 0 3590.00000 0 8 3610.00000 3590.00000 0.55% - 0s 0 0 3590.00000 0 25 3610.00000 3590.00000 0.55% - 0s 0 0 3593.75000 0 26 3610.00000 3593.75000 0.45% - 0s 0 0 3596.92308 0 30 3610.00000 3596.92308 0.36% - 0s 0 0 3597.27273 0 26 3610.00000 3597.27273 0.35% - 0s 0 0 3603.78378 0 25 3610.00000 3603.78378 0.17% - 0s 0 0 3604.66667 0 19 3610.00000 3604.66667 0.15% - 0s Cutting planes: Learned: 1 Implied bound: 5 MIR: 13 Flow cover: 2 Explored 0 nodes (749 simplex iterations) in 0.25 seconds Thread count was 4 (of 4 available processors) Solution count 4: 3610 3610 3615 6400 Pool objective bound 3610 Optimal solution found (tolerance 1.00e-04) Best objective 3.610000000000e+03, best bound 3.610000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Found heuristic solution: objective 4760 Presolve removed 1384 rows and 714 columns Presolve time: 0.03s Presolved: 590 rows, 402 columns, 4837 nonzeros Variable types: 0 continuous, 402 integer (178 binary) Root relaxation: objective 2.305000e+03, 310 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2305.00000 0 3 4760.00000 2305.00000 51.6% - 0s H 0 0 2525.0000000 2305.00000 8.71% - 0s H 0 0 2380.0000000 2305.00000 3.15% - 0s 0 0 2348.63636 0 12 2380.00000 2348.63636 1.32% - 0s H 0 0 2365.0000000 2348.63636 0.69% - 0s 0 0 cutoff 0 2365.00000 2360.00237 0.21% - 0s Cutting planes: Gomory: 1 Implied bound: 3 MIR: 4 Flow cover: 3 Explored 0 nodes (344 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 4: 2365 2380 2525 4760 Pool objective bound 2365 Optimal solution found (tolerance 1.00e-04) Best objective 2.365000000000e+03, best bound 2.365000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+02] Found heuristic solution: objective 6100 Presolve removed 1412 rows and 732 columns Presolve time: 0.05s Presolved: 562 rows, 384 columns, 6180 nonzeros Variable types: 0 continuous, 384 integer (175 binary) Root relaxation: objective 3.190000e+03, 239 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3190.00000 0 2 6100.00000 3190.00000 47.7% - 0s H 0 0 3265.0000000 3190.00000 2.30% - 0s H 0 0 3260.0000000 3190.00000 2.15% - 0s 0 0 3245.00000 0 1 3260.00000 3245.00000 0.46% - 0s 0 0 3251.42857 0 4 3260.00000 3251.42857 0.26% - 0s Cutting planes: Implied bound: 1 MIR: 2 Flow cover: 2 Explored 0 nodes (256 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 3: 3260 3265 6100 Pool objective bound 3260 Optimal solution found (tolerance 1.00e-04) Best objective 3.260000000000e+03, best bound 3.260000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [8e-02, 1e+02] Found heuristic solution: objective 5660 Presolve removed 1384 rows and 712 columns Presolve time: 0.04s Presolved: 590 rows, 404 columns, 5984 nonzeros Variable types: 0 continuous, 404 integer (189 binary) Root relaxation: objective 2.990000e+03, 242 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2990.00000 0 1 5660.00000 2990.00000 47.2% - 0s H 0 0 3170.0000000 2990.00000 5.68% - 0s 0 0 2990.00000 0 1 3170.00000 2990.00000 5.68% - 0s H 0 0 3055.0000000 2990.00000 2.13% - 0s 0 0 2990.00000 0 4 3055.00000 2990.00000 2.13% - 0s 0 0 2990.00000 0 1 3055.00000 2990.00000 2.13% - 0s 0 0 2990.00000 0 11 3055.00000 2990.00000 2.13% - 0s 0 0 2990.00000 0 14 3055.00000 2990.00000 2.13% - 0s 0 0 2990.00000 0 13 3055.00000 2990.00000 2.13% - 0s 0 0 2990.00000 0 13 3055.00000 2990.00000 2.13% - 0s 0 0 2990.05042 0 25 3055.00000 2990.05042 2.13% - 0s 0 0 2990.16807 0 25 3055.00000 2990.16807 2.12% - 0s 0 0 2990.31813 0 32 3055.00000 2990.31813 2.12% - 0s 0 0 2990.31894 0 37 3055.00000 2990.31894 2.12% - 0s 0 0 2990.58824 0 22 3055.00000 2990.58824 2.11% - 0s 0 0 2991.50000 0 17 3055.00000 2991.50000 2.08% - 0s 0 0 2994.67066 0 23 3055.00000 2994.67066 1.97% - 0s 0 0 2994.67066 0 26 3055.00000 2994.67066 1.97% - 0s 0 0 2994.93671 0 24 3055.00000 2994.93671 1.97% - 0s H 0 0 3045.0000000 2994.93671 1.64% - 0s 0 0 2994.93671 0 24 3045.00000 2994.93671 1.64% - 0s * 0 0 0 2995.0000000 2995.00000 0.00% - 0s Cutting planes: Gomory: 2 Implied bound: 1 MIR: 9 Zero half: 1 Mod-K: 1 Explored 0 nodes (549 simplex iterations) in 0.20 seconds Thread count was 4 (of 4 available processors) Solution count 6: 2995 3045 3055 ... 5660 Pool objective bound 2995 Optimal solution found (tolerance 1.00e-04) Best objective 2.995000000000e+03, best bound 2.995000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Found heuristic solution: objective 6255 Presolve removed 1317 rows and 671 columns Presolve time: 0.04s Presolved: 657 rows, 445 columns, 6579 nonzeros Variable types: 0 continuous, 445 integer (200 binary) Root relaxation: objective 3.055000e+03, 324 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3055.00000 0 5 6255.00000 3055.00000 51.2% - 0s H 0 0 3320.0000000 3055.00000 7.98% - 0s 0 0 3055.50000 0 30 3320.00000 3055.50000 7.97% - 0s H 0 0 3315.0000000 3055.50000 7.83% - 0s 0 0 3056.79252 0 34 3315.00000 3056.79252 7.79% - 0s 0 0 3056.79252 0 5 3315.00000 3056.79252 7.79% - 0s 0 0 3056.79252 0 34 3315.00000 3056.79252 7.79% - 0s H 0 0 3145.0000000 3056.79252 2.80% - 0s 0 0 3057.40646 0 35 3145.00000 3057.40646 2.79% - 0s 0 0 3062.42063 0 25 3145.00000 3062.42063 2.63% - 0s H 0 0 3080.0000000 3062.42063 0.57% - 0s 0 0 3065.27778 0 16 3080.00000 3065.27778 0.48% - 0s 0 0 3065.27778 0 17 3080.00000 3065.27778 0.48% - 0s Cutting planes: Gomory: 4 MIR: 8 Flow cover: 2 Explored 0 nodes (754 simplex iterations) in 0.19 seconds Thread count was 4 (of 4 available processors) Solution count 5: 3080 3145 3315 ... 6255 Pool objective bound 3080 Optimal solution found (tolerance 1.00e-04) Best objective 3.080000000000e+03, best bound 3.080000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+02] Found heuristic solution: objective 5960 Presolve removed 1327 rows and 674 columns Presolve time: 0.04s Presolved: 647 rows, 442 columns, 7495 nonzeros Variable types: 0 continuous, 442 integer (202 binary) Root relaxation: objective 3.010000e+03, 277 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3010.00000 0 3 5960.00000 3010.00000 49.5% - 0s H 0 0 3120.0000000 3010.00000 3.53% - 0s H 0 0 3110.0000000 3010.00000 3.22% - 0s 0 0 3010.45455 0 26 3110.00000 3010.45455 3.20% - 0s H 0 0 3050.0000000 3010.45455 1.30% - 0s 0 0 3011.20130 0 29 3050.00000 3011.20130 1.27% - 0s 0 0 3032.41935 0 11 3050.00000 3032.41935 0.58% - 0s Cutting planes: Gomory: 2 MIR: 3 Flow cover: 2 Explored 0 nodes (335 simplex iterations) in 0.11 seconds Thread count was 4 (of 4 available processors) Solution count 4: 3050 3110 3120 5960 Pool objective bound 3050 Optimal solution found (tolerance 1.00e-04) Best objective 3.050000000000e+03, best bound 3.050000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+02] Found heuristic solution: objective 6590 Presolve removed 1455 rows and 760 columns Presolve time: 0.04s Presolved: 519 rows, 356 columns, 6943 nonzeros Variable types: 0 continuous, 356 integer (156 binary) Root relaxation: objective 4.325000e+03, 196 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 4325.00000 0 2 6590.00000 4325.00000 34.4% - 0s H 0 0 4490.0000000 4325.00000 3.67% - 0s H 0 0 4430.0000000 4325.00000 2.37% - 0s 0 0 4370.17241 0 36 4430.00000 4370.17241 1.35% - 0s 0 0 4370.68182 0 36 4430.00000 4370.68182 1.34% - 0s 0 0 4380.00000 0 19 4430.00000 4380.00000 1.13% - 0s 0 0 cutoff 0 4430.00000 4430.00000 0.00% - 0s Explored 0 nodes (276 simplex iterations) in 0.11 seconds Thread count was 4 (of 4 available processors) Solution count 3: 4430 4490 6590 Pool objective bound 4430 Optimal solution found (tolerance 1.00e-04) Best objective 4.430000000000e+03, best bound 4.430000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Found heuristic solution: objective 4630 Presolve removed 1429 rows and 743 columns Presolve time: 0.04s Presolved: 545 rows, 373 columns, 4584 nonzeros Variable types: 0 continuous, 373 integer (164 binary) Root relaxation: objective 1.880000e+03, 272 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1880.00000 0 5 4630.00000 1880.00000 59.4% - 0s H 0 0 2080.0000000 1880.00000 9.62% - 0s 0 0 1881.25000 0 36 2080.00000 1881.25000 9.56% - 0s H 0 0 1975.0000000 1881.25000 4.75% - 0s 0 0 1881.25000 0 37 1975.00000 1881.25000 4.75% - 0s 0 0 1891.33333 0 8 1975.00000 1891.33333 4.24% - 0s 0 0 1891.33333 0 2 1975.00000 1891.33333 4.24% - 0s 0 0 1891.33333 0 14 1975.00000 1891.33333 4.24% - 0s 0 0 1894.00000 0 8 1975.00000 1894.00000 4.10% - 0s 0 0 1900.00000 0 24 1975.00000 1900.00000 3.80% - 0s H 0 0 1965.0000000 1900.00000 3.31% - 0s 0 0 1900.00000 0 25 1965.00000 1900.00000 3.31% - 0s 0 0 1900.00000 0 1 1965.00000 1900.00000 3.31% - 0s H 0 0 1900.0000000 1900.00000 0.00% - 0s Cutting planes: Gomory: 2 Implied bound: 1 MIR: 10 Explored 0 nodes (539 simplex iterations) in 0.13 seconds Thread count was 4 (of 4 available processors) Solution count 6: 1900 1965 1975 ... 4630 Pool objective bound 1900 Optimal solution found (tolerance 1.00e-04) Best objective 1.900000000000e+03, best bound 1.900000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+02] Found heuristic solution: objective 5560 Presolve removed 1288 rows and 652 columns Presolve time: 0.05s Presolved: 686 rows, 464 columns, 6830 nonzeros Variable types: 0 continuous, 464 integer (210 binary) Root relaxation: objective 2.920000e+03, 298 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2920.00000 0 2 5560.00000 2920.00000 47.5% - 0s H 0 0 3150.0000000 2920.00000 7.30% - 0s H 0 0 3000.0000000 2920.00000 2.67% - 0s 0 0 2925.00000 0 1 3000.00000 2925.00000 2.50% - 0s 0 0 2931.00000 0 21 3000.00000 2931.00000 2.30% - 0s 0 0 2931.00000 0 2 3000.00000 2931.00000 2.30% - 0s 0 0 2968.33333 0 16 3000.00000 2968.33333 1.06% - 0s 0 0 2985.00000 0 1 3000.00000 2985.00000 0.50% - 0s 0 0 2985.00000 0 2 3000.00000 2985.00000 0.50% - 0s 0 0 2988.33333 0 12 3000.00000 2988.33333 0.39% - 0s 0 0 2990.83333 0 9 3000.00000 2990.83333 0.31% - 0s Cutting planes: Learned: 1 Gomory: 2 MIR: 3 Flow cover: 3 Explored 0 nodes (517 simplex iterations) in 0.15 seconds Thread count was 4 (of 4 available processors) Solution count 4: 3000 3000 3150 5560 Pool objective bound 3000 Optimal solution found (tolerance 1.00e-04) Best objective 3.000000000000e+03, best bound 3.000000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+02] Found heuristic solution: objective 6010 Presolve removed 1392 rows and 719 columns Presolve time: 0.04s Presolved: 582 rows, 397 columns, 6873 nonzeros Variable types: 0 continuous, 397 integer (177 binary) Root relaxation: objective 4.040000e+03, 300 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 4040.00000 0 3 6010.00000 4040.00000 32.8% - 0s H 0 0 4135.0000000 4040.00000 2.30% - 0s 0 0 4042.00000 0 11 4135.00000 4042.00000 2.25% - 0s H 0 0 4120.0000000 4042.00000 1.89% - 0s 0 0 4042.54496 0 28 4120.00000 4042.54496 1.88% - 0s H 0 0 4070.0000000 4042.54496 0.67% - 0s 0 0 4045.00000 0 3 4070.00000 4045.00000 0.61% - 0s 0 0 4045.20000 0 19 4070.00000 4045.20000 0.61% - 0s 0 0 4045.20000 0 4 4070.00000 4045.20000 0.61% - 0s 0 0 4045.78042 0 21 4070.00000 4045.78042 0.60% - 0s 0 0 4045.78042 0 21 4070.00000 4045.78042 0.60% - 0s 0 0 4045.83333 0 16 4070.00000 4045.83333 0.59% - 0s 0 0 4045.83333 0 20 4070.00000 4045.83333 0.59% - 0s 0 0 4046.47401 0 24 4070.00000 4046.47401 0.58% - 0s 0 0 4046.80097 0 18 4070.00000 4046.80097 0.57% - 0s 0 0 4048.37064 0 33 4070.00000 4048.37064 0.53% - 0s 0 0 4048.68750 0 37 4070.00000 4048.68750 0.52% - 0s 0 0 4049.33824 0 29 4070.00000 4049.33824 0.51% - 0s 0 0 4049.33824 0 3 4070.00000 4049.33824 0.51% - 0s 0 0 4049.33824 0 19 4070.00000 4049.33824 0.51% - 0s 0 0 4049.33824 0 27 4070.00000 4049.33824 0.51% - 0s 0 0 4049.83660 0 32 4070.00000 4049.83660 0.50% - 0s 0 0 4049.86935 0 33 4070.00000 4049.86935 0.49% - 0s 0 0 4050.32432 0 31 4070.00000 4050.32432 0.48% - 0s 0 0 4050.41090 0 34 4070.00000 4050.41090 0.48% - 0s 0 0 4050.47006 0 38 4070.00000 4050.47006 0.48% - 0s 0 0 4050.53982 0 37 4070.00000 4050.53982 0.48% - 0s 0 0 4056.19231 0 30 4070.00000 4056.19231 0.34% - 0s 0 0 4056.66667 0 17 4070.00000 4056.66667 0.33% - 0s 0 0 4056.66667 0 17 4070.00000 4056.66667 0.33% - 0s 0 0 4060.00000 0 1 4070.00000 4060.00000 0.25% - 0s 0 0 infeasible 0 4070.00000 4070.00000 0.00% - 0s Cutting planes: Implied bound: 1 MIR: 2 Explored 0 nodes (966 simplex iterations) in 0.25 seconds Thread count was 4 (of 4 available processors) Solution count 5: 4070 4070 4120 ... 6010 Pool objective bound 4070 Optimal solution found (tolerance 1.00e-04) Best objective 4.070000000000e+03, best bound 4.070000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+02] Found heuristic solution: objective 5730 Presolve removed 1277 rows and 643 columns Presolve time: 0.04s Presolved: 697 rows, 473 columns, 7728 nonzeros Variable types: 0 continuous, 473 integer (209 binary) Root relaxation: objective 2.580000e+03, 306 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2580.00000 0 2 5730.00000 2580.00000 55.0% - 0s H 0 0 2790.0000000 2580.00000 7.53% - 0s H 0 0 2585.0000000 2580.00000 0.19% - 0s * 0 0 0 2580.0000000 2580.00000 0.00% - 0s Explored 0 nodes (447 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 4: 2580 2585 2790 5730 Pool objective bound 2580 Optimal solution found (tolerance 1.00e-04) Best objective 2.580000000000e+03, best bound 2.580000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1974 rows, 1116 columns and 33942 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Found heuristic solution: objective 5100 Presolve removed 1303 rows and 665 columns Presolve time: 0.06s Presolved: 671 rows, 451 columns, 6958 nonzeros Variable types: 0 continuous, 451 integer (218 binary) Root relaxation: objective 2.555000e+03, 256 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2555.00000 0 2 5100.00000 2555.00000 49.9% - 0s H 0 0 2685.0000000 2555.00000 4.84% - 0s H 0 0 2645.0000000 2555.00000 3.40% - 0s 0 0 2559.08759 0 33 2645.00000 2559.08759 3.25% - 0s H 0 0 2615.0000000 2559.08759 2.14% - 0s 0 0 2559.08759 0 37 2615.00000 2559.08759 2.14% - 0s 0 0 2565.43379 0 4 2615.00000 2565.43379 1.90% - 0s H 0 0 2600.0000000 2565.43379 1.33% - 0s 0 0 2565.43379 0 2 2600.00000 2565.43379 1.33% - 0s H 0 0 2595.0000000 2565.43379 1.14% - 0s H 0 0 2590.0000000 2565.43379 0.95% - 0s 0 0 2565.52239 0 4 2590.00000 2565.52239 0.95% - 0s 0 0 2565.52239 0 2 2590.00000 2565.52239 0.95% - 0s H 0 0 2570.0000000 2565.52239 0.17% - 0s Explored 0 nodes (560 simplex iterations) in 0.15 seconds Thread count was 4 (of 4 available processors) Solution count 9: 2570 2590 2595 ... 5100 Pool objective bound 2570 Optimal solution found (tolerance 1.00e-04) Best objective 2.570000000000e+03, best bound 2.570000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1116 columns and 32943 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1231 rows and 640 columns Presolve time: 0.07s Presolved: 707 rows, 476 columns, 7711 nonzeros Variable types: 0 continuous, 476 integer (208 binary) Root relaxation: objective 2.571176e+03, 355 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2571.17647 0 5 7500.00000 2571.17647 65.7% - 0s H 0 0 2600.0000000 2571.17647 1.11% - 0s 0 0 2595.00000 0 1 2600.00000 2595.00000 0.19% - 0s 0 0 cutoff 0 2600.00000 2600.00000 0.00% - 0s Explored 0 nodes (404 simplex iterations) in 0.13 seconds Thread count was 4 (of 4 available processors) Solution count 3: 2600 2600 7500 Pool objective bound 2600 Optimal solution found (tolerance 1.00e-04) Best objective 2.600000000000e+03, best bound 2.600000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1116 columns and 32943 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1274 rows and 669 columns Presolve time: 0.05s Presolved: 664 rows, 447 columns, 6964 nonzeros Variable types: 0 continuous, 447 integer (198 binary) Root relaxation: objective 2.775000e+03, 306 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 2775.00000 0 3 7500.00000 2775.00000 63.0% - 0s H 0 0 2855.0000000 2775.00000 2.80% - 0s 0 0 2775.00000 0 19 2855.00000 2775.00000 2.80% - 0s H 0 0 2805.0000000 2775.00000 1.07% - 0s 0 0 2775.00000 0 13 2805.00000 2775.00000 1.07% - 0s Explored 0 nodes (430 simplex iterations) in 0.15 seconds Thread count was 4 (of 4 available processors) Solution count 4: 2805 2805 2855 7500 Pool objective bound 2805 Optimal solution found (tolerance 1.00e-04) Best objective 2.805000000000e+03, best bound 2.805000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1116 columns and 32943 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1436 rows and 771 columns Presolve time: 0.03s Presolved: 502 rows, 345 columns, 5368 nonzeros Variable types: 0 continuous, 345 integer (150 binary) Root relaxation: objective 3.290000e+03, 204 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3290.00000 0 3 7500.00000 3290.00000 56.1% - 0s H 0 0 3500.0000000 3290.00000 6.00% - 0s 0 0 3291.42857 0 9 3500.00000 3291.42857 5.96% - 0s H 0 0 3460.0000000 3291.42857 4.87% - 0s 0 0 3291.42857 0 19 3460.00000 3291.42857 4.87% - 0s 0 0 3298.00000 0 19 3460.00000 3298.00000 4.68% - 0s 0 0 3298.00000 0 3 3460.00000 3298.00000 4.68% - 0s 0 0 3302.00000 0 21 3460.00000 3302.00000 4.57% - 0s 0 0 3302.00000 0 20 3460.00000 3302.00000 4.57% - 0s 0 0 3315.83333 0 18 3460.00000 3315.83333 4.17% - 0s H 0 0 3440.0000000 3315.83333 3.61% - 0s 0 0 3321.66667 0 16 3440.00000 3321.66667 3.44% - 0s 0 0 3322.85714 0 26 3440.00000 3322.85714 3.41% - 0s 0 0 3326.00000 0 25 3440.00000 3326.00000 3.31% - 0s 0 0 3330.00000 0 22 3440.00000 3330.00000 3.20% - 0s 0 0 3338.66667 0 35 3440.00000 3338.66667 2.95% - 0s 0 0 3340.00000 0 26 3440.00000 3340.00000 2.91% - 0s 0 0 3355.20000 0 24 3440.00000 3355.20000 2.47% - 0s 0 0 3356.47059 0 23 3440.00000 3356.47059 2.43% - 0s 0 0 3386.66667 0 25 3440.00000 3386.66667 1.55% - 0s 0 0 3387.50000 0 26 3440.00000 3387.50000 1.53% - 0s 0 0 3387.50000 0 28 3440.00000 3387.50000 1.53% - 0s 0 0 3387.50000 0 21 3440.00000 3387.50000 1.53% - 0s 0 0 3387.91667 0 26 3440.00000 3387.91667 1.51% - 0s 0 0 3388.26840 0 33 3440.00000 3388.26840 1.50% - 0s 0 0 3390.00000 0 14 3440.00000 3390.00000 1.45% - 0s 0 0 3390.00000 0 14 3440.00000 3390.00000 1.45% - 0s 0 0 3390.00000 0 4 3440.00000 3390.00000 1.45% - 0s 0 0 3390.00000 0 18 3440.00000 3390.00000 1.45% - 0s 0 0 3390.00000 0 18 3440.00000 3390.00000 1.45% - 0s 0 0 3390.00000 0 20 3440.00000 3390.00000 1.45% - 0s 0 0 3425.00000 0 1 3440.00000 3425.00000 0.44% - 0s 0 0 3432.50000 0 8 3440.00000 3432.50000 0.22% - 0s Cutting planes: Implied bound: 2 MIR: 16 Explored 0 nodes (629 simplex iterations) in 0.26 seconds Thread count was 4 (of 4 available processors) Solution count 5: 3440 3460 3460 ... 7500 Pool objective bound 3440 Optimal solution found (tolerance 1.00e-04) Best objective 3.440000000000e+03, best bound 3.440000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1260 rows and 637 columns Presolve time: 0.05s Presolved: 678 rows, 461 columns, 6996 nonzeros Variable types: 0 continuous, 461 integer (213 binary) Root relaxation: objective 3.090000e+03, 341 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3090.00000 0 1 7500.00000 3090.00000 58.8% - 0s H 0 0 3150.0000000 3090.00000 1.90% - 0s 0 0 3100.00000 0 2 3150.00000 3100.00000 1.59% - 0s H 0 0 3140.0000000 3100.00000 1.27% - 0s 0 0 cutoff 0 3140.00000 3135.00314 0.16% - 0s Cutting planes: Gomory: 1 Implied bound: 1 MIR: 3 Flow cover: 2 Explored 0 nodes (395 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 3: 3140 3150 7500 Pool objective bound 3140 Optimal solution found (tolerance 1.00e-04) Best objective 3.140000000000e+03, best bound 3.140000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1098 columns and 32943 nonzeros Variable types: 0 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1475 rows and 777 columns Presolve time: 0.05s Presolved: 463 rows, 321 columns, 4794 nonzeros Variable types: 0 continuous, 321 integer (154 binary) Root relaxation: objective 3.485000e+03, 220 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3485.00000 0 2 7500.00000 3485.00000 53.5% - 0s H 0 0 3530.0000000 3485.00000 1.27% - 0s 0 0 3491.25000 0 4 3530.00000 3491.25000 1.10% - 0s H 0 0 3495.0000000 3491.25000 0.11% - 0s Cutting planes: Gomory: 1 MIR: 5 StrongCG: 1 Flow cover: 2 Explored 0 nodes (237 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 3: 3495 3530 7500 Pool objective bound 3495 Optimal solution found (tolerance 1.00e-04) Best objective 3.495000000000e+03, best bound 3.495000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1116 columns and 32943 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1288 rows and 671 columns Presolve time: 0.05s Presolved: 650 rows, 445 columns, 7284 nonzeros Variable types: 0 continuous, 445 integer (206 binary) Root relaxation: objective 3.110000e+03, 295 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 3110.00000 0 4 7500.00000 3110.00000 58.5% - 0s H 0 0 3185.0000000 3110.00000 2.35% - 0s 0 0 3110.00000 0 30 3185.00000 3110.00000 2.35% - 0s H 0 0 3125.0000000 3110.00000 0.48% - 0s 0 0 3110.21127 0 34 3125.00000 3110.21127 0.47% - 0s Explored 0 nodes (400 simplex iterations) in 0.16 seconds Thread count was 4 (of 4 available processors) Solution count 4: 3125 3125 3185 7500 Pool objective bound 3125 Optimal solution found (tolerance 1.00e-04) Best objective 3.125000000000e+03, best bound 3.125000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 1938 rows, 1116 columns and 32943 nonzeros Variable types: 18 continuous, 1098 integer (360 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 7500 Presolve removed 1296 rows and 681 columns Presolve time: 0.04s Presolved: 642 rows, 435 columns, 5391 nonzeros Variable types: 0 continuous, 435 integer (193 binary) Root relaxation: objective 1.975000e+03, 338 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1975.00000 0 3 7500.00000 1975.00000 73.7% - 0s H 0 0 2100.0000000 1975.00000 5.95% - 0s 0 0 1975.71429 0 11 2100.00000 1975.71429 5.92% - 0s 0 0 1976.42857 0 25 2100.00000 1976.42857 5.88% - 0s 0 0 1990.50000 0 39 2100.00000 1990.50000 5.21% - 0s 0 0 1990.50000 0 2 2100.00000 1990.50000 5.21% - 0s 0 0 1990.50000 0 26 2100.00000 1990.50000 5.21% - 0s 0 0 1990.50000 0 43 2100.00000 1990.50000 5.21% - 0s 0 0 2015.00000 0 3 2100.00000 2015.00000 4.05% - 0s 0 0 2016.25000 0 24 2100.00000 2016.25000 3.99% - 0s 0 0 2016.25000 0 24 2100.00000 2016.25000 3.99% - 0s 0 0 2016.25000 0 24 2100.00000 2016.25000 3.99% - 0s 0 0 2016.25000 0 24 2100.00000 2016.25000 3.99% - 0s 0 0 2016.66667 0 18 2100.00000 2016.66667 3.97% - 0s 0 0 2016.66667 0 18 2100.00000 2016.66667 3.97% - 0s 0 0 2016.66667 0 18 2100.00000 2016.66667 3.97% - 0s 0 2 2016.66667 0 18 2100.00000 2016.66667 3.97% - 0s * 13 8 5 2085.0000000 2050.00000 1.68% 5.7 0s * 14 8 5 2070.0000000 2050.00000 0.97% 5.6 0s * 16 2 6 2065.0000000 2050.00000 0.73% 5.2 0s Cutting planes: Gomory: 3 Cover: 1 Implied bound: 2 Clique: 1 MIR: 11 Flow cover: 3 Explored 26 nodes (944 simplex iterations) in 0.22 seconds Thread count was 4 (of 4 available processors) Solution count 5: 2065 2070 2085 ... 7500 Pool objective bound 2065 Optimal solution found (tolerance 1.00e-04) Best objective 2.065000000000e+03, best bound 2.065000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 646 rows, 366 columns and 3157 nonzeros Variable types: 0 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 575 rows and 316 columns Presolve time: 0.01s Presolved: 71 rows, 50 columns, 212 nonzeros Found heuristic solution: objective 1910.0000000 Variable types: 0 continuous, 50 integer (24 binary) Root relaxation: objective 8.318750e+02, 50 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 831.87500 0 25 1910.00000 831.87500 56.4% - 0s H 0 0 895.0000000 831.87500 7.05% - 0s 0 0 cutoff 0 895.00000 890.00090 0.56% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (101 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 3: 895 1910 2680 Pool objective bound 895 Optimal solution found (tolerance 1.00e-04) Best objective 8.950000000000e+02, best bound 8.950000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 646 rows, 366 columns and 3157 nonzeros Variable types: 0 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 568 rows and 309 columns Presolve time: 0.01s Presolved: 78 rows, 57 columns, 272 nonzeros Variable types: 0 continuous, 57 integer (29 binary) Root relaxation: objective 1.030000e+03, 49 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1030.0000000 1030.00000 0.00% - 0s Explored 0 nodes (55 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1030 3100 Pool objective bound 1030 Optimal solution found (tolerance 1.00e-04) Best objective 1.030000000000e+03, best bound 1.030000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 646 rows, 366 columns and 3157 nonzeros Variable types: 0 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [1e+00, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+02] Found heuristic solution: objective 3100 Presolve removed 576 rows and 316 columns Presolve time: 0.00s Presolved: 70 rows, 50 columns, 205 nonzeros Variable types: 0 continuous, 50 integer (25 binary) Root relaxation: objective 6.016667e+02, 44 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 601.66667 0 5 3100.00000 601.66667 80.6% - 0s H 0 0 680.0000000 601.66667 11.5% - 0s 0 0 668.00000 0 3 680.00000 668.00000 1.76% - 0s Cutting planes: Flow cover: 1 Explored 0 nodes (57 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 680 3100 Pool objective bound 680 Optimal solution found (tolerance 1.00e-04) Best objective 6.800000000000e+02, best bound 6.800000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 6 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Found heuristic solution: objective 2400 Presolve removed 586 rows and 321 columns Presolve time: 0.00s Presolved: 72 rows, 51 columns, 203 nonzeros Variable types: 0 continuous, 51 integer (23 binary) Root relaxation: objective 4.800000e+02, 46 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 480.00000 0 1 2400.00000 480.00000 80.0% - 0s H 0 0 555.0000000 480.00000 13.5% - 0s H 0 0 495.0000000 480.00000 3.03% - 0s Explored 0 nodes (53 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 3: 495 555 2400 Pool objective bound 495 Optimal solution found (tolerance 1.00e-04) Best objective 4.950000000000e+02, best bound 4.950000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 6 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [2e-02, 1e+02] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+02] Found heuristic solution: objective 2400 Presolve removed 547 rows and 293 columns Presolve time: 0.00s Presolved: 111 rows, 79 columns, 330 nonzeros Variable types: 0 continuous, 79 integer (38 binary) Root relaxation: objective 5.650000e+02, 74 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 565.0000000 565.00000 0.00% - 0s Explored 0 nodes (78 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 565 2400 Pool objective bound 565 Optimal solution found (tolerance 1.00e-04) Best objective 5.650000000000e+02, best bound 5.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 6 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Found heuristic solution: objective 2360 Presolve removed 541 rows and 290 columns Presolve time: 0.01s Presolved: 117 rows, 82 columns, 369 nonzeros Variable types: 0 continuous, 82 integer (39 binary) Root relaxation: objective 8.300000e+02, 69 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 830.0000000 830.00000 0.00% - 0s Explored 0 nodes (72 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 2: 830 2360 Pool objective bound 830 Optimal solution found (tolerance 1.00e-04) Best objective 8.300000000000e+02, best bound 8.300000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 6 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Found heuristic solution: objective 2490 Presolve removed 591 rows and 321 columns Presolve time: 0.00s Presolved: 67 rows, 51 columns, 208 nonzeros Variable types: 0 continuous, 51 integer (24 binary) Root relaxation: objective 1.280000e+03, 41 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1280.0000000 1280.00000 0.00% - 0s Explored 0 nodes (42 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1280 2490 Pool objective bound 1280 Optimal solution found (tolerance 1.00e-04) Best objective 1.280000000000e+03, best bound 1.280000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 0 continuous, 372 integer (120 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+03] Presolve removed 493 rows and 258 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 0 continuous, 372 integer (120 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 509 rows and 262 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 6 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Found heuristic solution: objective 2390 Presolve removed 547 rows and 294 columns Presolve time: 0.00s Presolved: 111 rows, 78 columns, 331 nonzeros Variable types: 0 continuous, 78 integer (37 binary) Root relaxation: objective 8.550000e+02, 72 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 855.0000000 855.00000 0.00% - 0s Explored 0 nodes (76 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 855 2390 Pool objective bound 855 Optimal solution found (tolerance 1.00e-04) Best objective 8.550000000000e+02, best bound 8.550000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 6 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+03] Found heuristic solution: objective 2530 Presolve removed 591 rows and 321 columns Presolve time: 0.00s Presolved: 67 rows, 51 columns, 218 nonzeros Variable types: 0 continuous, 51 integer (25 binary) Root relaxation: objective 1.256667e+03, 40 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1256.66667 0 3 2530.00000 1256.66667 50.3% - 0s H 0 0 1270.0000000 1256.66667 1.05% - 0s Explored 0 nodes (40 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1270 2530 Pool objective bound 1270 Optimal solution found (tolerance 1.00e-04) Best objective 1.270000000000e+03, best bound 1.270000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 6 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Found heuristic solution: objective 2500 Presolve removed 592 rows and 323 columns Presolve time: 0.00s Presolved: 66 rows, 49 columns, 204 nonzeros Variable types: 0 continuous, 49 integer (21 binary) Root relaxation: objective 1.155000e+03, 37 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1155.0000000 1155.00000 0.00% - 0s Explored 0 nodes (40 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1155 2500 Pool objective bound 1155 Optimal solution found (tolerance 1.00e-04) Best objective 1.155000000000e+03, best bound 1.155000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 646 rows, 372 columns and 3157 nonzeros Variable types: 6 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 3100 Presolve removed 537 rows and 295 columns Presolve time: 0.00s Presolved: 109 rows, 77 columns, 352 nonzeros Variable types: 0 continuous, 77 integer (38 binary) Root relaxation: objective 5.402273e+02, 74 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 540.22727 0 22 3100.00000 540.22727 82.6% - 0s H 0 0 840.0000000 540.22727 35.7% - 0s H 0 0 625.0000000 540.22727 13.6% - 0s 0 0 562.27273 0 4 625.00000 562.27273 10.0% - 0s H 0 0 600.0000000 562.27273 6.29% - 0s 0 0 cutoff 0 600.00000 595.00060 0.83% - 0s Cutting planes: Gomory: 2 Flow cover: 1 Explored 0 nodes (98 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 4: 600 625 840 3100 Pool objective bound 600 Optimal solution found (tolerance 1.00e-04) Best objective 6.000000000000e+02, best bound 6.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 646 rows, 372 columns and 3157 nonzeros Variable types: 6 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 3100 Presolve removed 525 rows and 289 columns Presolve time: 0.00s Presolved: 121 rows, 83 columns, 400 nonzeros Variable types: 0 continuous, 83 integer (39 binary) Root relaxation: objective 1.015000e+03, 73 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 1015.00000 0 2 3100.00000 1015.00000 67.3% - 0s H 0 0 1050.0000000 1015.00000 3.33% - 0s 0 0 cutoff 0 1050.00000 1045.00105 0.48% - 0s Cutting planes: Implied bound: 2 MIR: 1 Explored 0 nodes (76 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 1050 3100 Pool objective bound 1050 Optimal solution found (tolerance 1.00e-04) Best objective 1.050000000000e+03, best bound 1.050000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 6 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Found heuristic solution: objective 2300 Presolve removed 554 rows and 300 columns Presolve time: 0.00s Presolved: 104 rows, 72 columns, 336 nonzeros Variable types: 0 continuous, 72 integer (35 binary) Root relaxation: objective 8.750000e+02, 67 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 875.00000 0 1 2300.00000 875.00000 62.0% - 0s H 0 0 885.0000000 875.00000 1.13% - 0s 0 0 cutoff 0 885.00000 880.00089 0.56% - 0s Explored 0 nodes (73 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 2: 885 2300 Pool objective bound 885 Optimal solution found (tolerance 1.00e-04) Best objective 8.850000000000e+02, best bound 8.850000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 6 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Found heuristic solution: objective 2460 Presolve removed 592 rows and 325 columns Presolve time: 0.00s Presolved: 66 rows, 47 columns, 187 nonzeros Variable types: 0 continuous, 47 integer (23 binary) Root relaxation: objective 6.233333e+02, 43 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 623.33333 0 5 2460.00000 623.33333 74.7% - 0s H 0 0 780.0000000 623.33333 20.1% - 0s H 0 0 645.0000000 623.33333 3.36% - 0s Explored 0 nodes (51 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 645 780 2460 Pool objective bound 645 Optimal solution found (tolerance 1.00e-04) Best objective 6.450000000000e+02, best bound 6.450000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 6 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-02, 1e+03] Found heuristic solution: objective 2300 Presolve removed 553 rows and 300 columns Presolve time: 0.00s Presolved: 105 rows, 72 columns, 335 nonzeros Variable types: 0 continuous, 72 integer (35 binary) Root relaxation: objective 6.010000e+02, 71 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 601.00000 0 22 2300.00000 601.00000 73.9% - 0s H 0 0 675.0000000 601.00000 11.0% - 0s H 0 0 615.0000000 601.00000 2.28% - 0s 0 0 cutoff 0 615.00000 610.00062 0.81% - 0s Explored 0 nodes (82 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 3: 615 675 2300 Pool objective bound 615 Optimal solution found (tolerance 1.00e-04) Best objective 6.150000000000e+02, best bound 6.150000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 6 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Found heuristic solution: objective 2420 Presolve removed 540 rows and 289 columns Presolve time: 0.00s Presolved: 118 rows, 83 columns, 372 nonzeros Variable types: 0 continuous, 83 integer (39 binary) Root relaxation: objective 9.250000e+02, 76 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 925.0000000 925.00000 0.00% - 0s Explored 0 nodes (82 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 2: 925 2420 Pool objective bound 925 Optimal solution found (tolerance 1.00e-04) Best objective 9.250000000000e+02, best bound 9.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 745 Pool objective bound 745 Optimal solution found (tolerance 1.00e-04) Best objective 7.450000000000e+02, best bound 7.450000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 610 Pool objective bound 610 Optimal solution found (tolerance 1.00e-04) Best objective 6.100000000000e+02, best bound 6.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 640 Pool objective bound 640 Optimal solution found (tolerance 1.00e-04) Best objective 6.400000000000e+02, best bound 6.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 700 Pool objective bound 700 Optimal solution found (tolerance 1.00e-04) Best objective 7.000000000000e+02, best bound 7.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 528 rows and 280 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 695 Pool objective bound 695 Optimal solution found (tolerance 1.00e-04) Best objective 6.950000000000e+02, best bound 6.950000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 835 Pool objective bound 835 Optimal solution found (tolerance 1.00e-04) Best objective 8.350000000000e+02, best bound 8.350000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 855 Pool objective bound 855 Optimal solution found (tolerance 1.00e-04) Best objective 8.550000000000e+02, best bound 8.550000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 510 Pool objective bound 510 Optimal solution found (tolerance 1.00e-04) Best objective 5.100000000000e+02, best bound 5.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 1: 850 Pool objective bound 850 Optimal solution found (tolerance 1.00e-04) Best objective 8.500000000000e+02, best bound 8.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3310 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 650 rows and 363 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3258 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [8e-02, 1e+03] Presolve removed 651 rows and 368 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3258 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 598 rows and 335 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3258 nonzeros Variable types: 6 continuous, 366 integer (120 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Found heuristic solution: objective 2500 Presolve removed 594 rows and 326 columns Presolve time: 0.00s Presolved: 64 rows, 46 columns, 180 nonzeros Variable types: 0 continuous, 46 integer (21 binary) Root relaxation: objective 5.911538e+02, 42 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 591.15385 0 7 2500.00000 591.15385 76.4% - 0s H 0 0 815.0000000 591.15385 27.5% - 0s H 0 0 745.0000000 591.15385 20.7% - 0s * 0 0 0 615.0000000 615.00000 0.00% - 0s Cutting planes: Gomory: 1 Implied bound: 2 Flow cover: 1 Explored 0 nodes (52 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 4: 615 745 815 2500 Pool objective bound 615 Optimal solution found (tolerance 1.00e-04) Best objective 6.150000000000e+02, best bound 6.150000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 670 Pool objective bound 670 Optimal solution found (tolerance 1.00e-04) Best objective 6.700000000000e+02, best bound 6.700000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 690 Pool objective bound 690 Optimal solution found (tolerance 1.00e-04) Best objective 6.900000000000e+02, best bound 6.900000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 940 Pool objective bound 940 Optimal solution found (tolerance 1.00e-04) Best objective 9.400000000000e+02, best bound 9.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 705 Pool objective bound 705 Optimal solution found (tolerance 1.00e-04) Best objective 7.050000000000e+02, best bound 7.050000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 615 rows and 335 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 835 Pool objective bound 835 Optimal solution found (tolerance 1.00e-04) Best objective 8.350000000000e+02, best bound 8.350000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 505 Pool objective bound 505 Optimal solution found (tolerance 1.00e-04) Best objective 5.050000000000e+02, best bound 5.050000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 640 Pool objective bound 640 Optimal solution found (tolerance 1.00e-04) Best objective 6.400000000000e+02, best bound 6.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1070 Pool objective bound 1070 Optimal solution found (tolerance 1.00e-04) Best objective 1.070000000000e+03, best bound 1.070000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [6e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1965 Pool objective bound 1965 Optimal solution found (tolerance 1.00e-04) Best objective 1.965000000000e+03, best bound 1.965000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 860 Pool objective bound 860 Optimal solution found (tolerance 1.00e-04) Best objective 8.600000000000e+02, best bound 8.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 910 Pool objective bound 910 Optimal solution found (tolerance 1.00e-04) Best objective 9.100000000000e+02, best bound 9.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 690 Pool objective bound 690 Optimal solution found (tolerance 1.00e-04) Best objective 6.900000000000e+02, best bound 6.900000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+03] Presolve removed 656 rows and 372 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+03] Presolve removed 555 rows and 302 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+03] Presolve removed 652 rows and 366 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 870 Pool objective bound 870 Optimal solution found (tolerance 1.00e-04) Best objective 8.700000000000e+02, best bound 8.700000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 770 Pool objective bound 770 Optimal solution found (tolerance 1.00e-04) Best objective 7.700000000000e+02, best bound 7.700000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 845 Pool objective bound 845 Optimal solution found (tolerance 1.00e-04) Best objective 8.450000000000e+02, best bound 8.450000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1160 Pool objective bound 1160 Optimal solution found (tolerance 1.00e-04) Best objective 1.160000000000e+03, best bound 1.160000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 575 Pool objective bound 575 Optimal solution found (tolerance 1.00e-04) Best objective 5.750000000000e+02, best bound 5.750000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 925 Pool objective bound 925 Optimal solution found (tolerance 1.00e-04) Best objective 9.250000000000e+02, best bound 9.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [6e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1580 Pool objective bound 1580 Optimal solution found (tolerance 1.00e-04) Best objective 1.580000000000e+03, best bound 1.580000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 555 Pool objective bound 555 Optimal solution found (tolerance 1.00e-04) Best objective 5.550000000000e+02, best bound 5.550000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 720 Pool objective bound 720 Optimal solution found (tolerance 1.00e-04) Best objective 7.200000000000e+02, best bound 7.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+03] Presolve removed 626 rows and 343 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1150 Pool objective bound 1150 Optimal solution found (tolerance 1.00e-04) Best objective 1.150000000000e+03, best bound 1.150000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 950 Pool objective bound 950 Optimal solution found (tolerance 1.00e-04) Best objective 9.500000000000e+02, best bound 9.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 895 Pool objective bound 895 Optimal solution found (tolerance 1.00e-04) Best objective 8.950000000000e+02, best bound 8.950000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 490 Pool objective bound 490 Optimal solution found (tolerance 1.00e-04) Best objective 4.900000000000e+02, best bound 4.900000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 450 Pool objective bound 450 Optimal solution found (tolerance 1.00e-04) Best objective 4.500000000000e+02, best bound 4.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+03] Found heuristic solution: objective 585 Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 585 Pool objective bound 585 Optimal solution found (tolerance 1.00e-04) Best objective 5.850000000000e+02, best bound 5.850000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 715 Pool objective bound 715 Optimal solution found (tolerance 1.00e-04) Best objective 7.150000000000e+02, best bound 7.150000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 815 Pool objective bound 815 Optimal solution found (tolerance 1.00e-04) Best objective 8.150000000000e+02, best bound 8.150000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 730 Pool objective bound 730 Optimal solution found (tolerance 1.00e-04) Best objective 7.300000000000e+02, best bound 7.300000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 651 rows and 370 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+03] Presolve removed 621 rows and 341 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1095 Pool objective bound 1095 Optimal solution found (tolerance 1.00e-04) Best objective 1.095000000000e+03, best bound 1.095000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1305 Pool objective bound 1305 Optimal solution found (tolerance 1.00e-04) Best objective 1.305000000000e+03, best bound 1.305000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 710 Pool objective bound 710 Optimal solution found (tolerance 1.00e-04) Best objective 7.100000000000e+02, best bound 7.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 735 Pool objective bound 735 Optimal solution found (tolerance 1.00e-04) Best objective 7.350000000000e+02, best bound 7.350000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 657 rows and 372 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [6e-01, 1e+03] Presolve removed 656 rows and 368 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 850 Pool objective bound 850 Optimal solution found (tolerance 1.00e-04) Best objective 8.500000000000e+02, best bound 8.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+03] Presolve removed 547 rows and 296 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 710 Pool objective bound 710 Optimal solution found (tolerance 1.00e-04) Best objective 7.100000000000e+02, best bound 7.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 550 Pool objective bound 550 Optimal solution found (tolerance 1.00e-04) Best objective 5.500000000000e+02, best bound 5.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 530 Pool objective bound 530 Optimal solution found (tolerance 1.00e-04) Best objective 5.300000000000e+02, best bound 5.300000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 655 Pool objective bound 655 Optimal solution found (tolerance 1.00e-04) Best objective 6.550000000000e+02, best bound 6.550000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 656 rows and 368 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1055 Pool objective bound 1055 Optimal solution found (tolerance 1.00e-04) Best objective 1.055000000000e+03, best bound 1.055000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+03] Presolve removed 555 rows and 302 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 544 rows and 293 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 655 rows and 369 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 520 Pool objective bound 520 Optimal solution found (tolerance 1.00e-04) Best objective 5.200000000000e+02, best bound 5.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 575 Pool objective bound 575 Optimal solution found (tolerance 1.00e-04) Best objective 5.750000000000e+02, best bound 5.750000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 590 Pool objective bound 590 Optimal solution found (tolerance 1.00e-04) Best objective 5.900000000000e+02, best bound 5.900000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+03] Presolve removed 626 rows and 368 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 965 Pool objective bound 965 Optimal solution found (tolerance 1.00e-04) Best objective 9.650000000000e+02, best bound 9.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1325 Pool objective bound 1325 Optimal solution found (tolerance 1.00e-04) Best objective 1.325000000000e+03, best bound 1.325000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1560 Pool objective bound 1560 Optimal solution found (tolerance 1.00e-04) Best objective 1.560000000000e+03, best bound 1.560000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 630 Pool objective bound 630 Optimal solution found (tolerance 1.00e-04) Best objective 6.300000000000e+02, best bound 6.300000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 855 Pool objective bound 855 Optimal solution found (tolerance 1.00e-04) Best objective 8.550000000000e+02, best bound 8.550000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 653 rows and 367 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 642 rows and 359 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 372 columns and 3288 nonzeros Variable types: 0 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.01s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 850 Pool objective bound 850 Optimal solution found (tolerance 1.00e-04) Best objective 8.500000000000e+02, best bound 8.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e-01, 1e+03] Found heuristic solution: objective 590 Presolve removed 658 rows and 378 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 590 Pool objective bound 590 Optimal solution found (tolerance 1.00e-04) Best objective 5.900000000000e+02, best bound 5.900000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+03] Presolve removed 614 rows and 342 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 378 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 595 Pool objective bound 595 Optimal solution found (tolerance 1.00e-04) Best objective 5.950000000000e+02, best bound 5.950000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 378 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 900 Pool objective bound 900 Optimal solution found (tolerance 1.00e-04) Best objective 9.000000000000e+02, best bound 9.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+03] Presolve removed 528 rows and 284 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 528 rows and 284 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 378 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 960 Pool objective bound 960 Optimal solution found (tolerance 1.00e-04) Best objective 9.600000000000e+02, best bound 9.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 378 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 1285 Pool objective bound 1285 Optimal solution found (tolerance 1.00e-04) Best objective 1.285000000000e+03, best bound 1.285000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 654 rows and 374 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Presolve removed 654 rows and 374 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Computing Irreducible Inconsistent Subsystem (IIS)... Constraints Bounds Runtime Min Max Min Max ------------------------------------------------ 0 658 0 252 0s 58 58 30 30 2s IIS computed: 58 constraints, 30 bounds IIS runtime: 1.85 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 658 rows and 378 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 820 Pool objective bound 820 Optimal solution found (tolerance 1.00e-04) Best objective 8.200000000000e+02, best bound 8.200000000000e+02, gap 0.0000% Presolve removed 658 rows and 378 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Presolve removed 658 rows and 378 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 815 Pool objective bound 815 Optimal solution found (tolerance 1.00e-04) Best objective 8.150000000000e+02, best bound 8.150000000000e+02, gap 0.0000% Presolve removed 658 rows and 378 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.01 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 613 rows and 343 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Presolve removed 613 rows and 344 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Computing Irreducible Inconsistent Subsystem (IIS)... Constraints Bounds Runtime Min Max Min Max ------------------------------------------------ 0 658 0 252 0s 40 40 26 26 2s IIS computed: 40 constraints, 26 bounds IIS runtime: 2.01 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [2e-01, 1e+03] Found heuristic solution: objective 850 Presolve removed 658 rows and 378 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 850 Pool objective bound 850 Optimal solution found (tolerance 1.00e-04) Best objective 8.500000000000e+02, best bound 8.500000000000e+02, gap 0.0000% Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 378 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 760 Pool objective bound 760 Optimal solution found (tolerance 1.00e-04) Best objective 7.600000000000e+02, best bound 7.600000000000e+02, gap 0.0000% Presolve removed 658 rows and 378 columns Presolve time: 0.00s Presolve: All rows and columns removed Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.01 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 656 rows and 374 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Presolve removed 656 rows and 374 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Computing Irreducible Inconsistent Subsystem (IIS)... Constraints Bounds Runtime Min Max Min Max ------------------------------------------------ 0 658 0 252 0s 40 40 20 20 5s IIS computed: 40 constraints, 20 bounds IIS runtime: 4.78 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [6e-01, 1e+03] Presolve removed 658 rows and 368 columns Presolve time: 0.00s Presolved: 0 rows, 10 columns, 0 nonzeros Variable types: 6 continuous, 4 integer (4 binary) Root relaxation: objective 1.925000e+03, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1925.0000000 1925.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1925 Pool objective bound 1925 Optimal solution found (tolerance 1.00e-04) Best objective 1.925000000000e+03, best bound 1.925000000000e+03, gap 0.0000% Presolve removed 658 rows and 368 columns Presolve time: 0.00s Presolved: 0 rows, 10 columns, 0 nonzeros Variable types: 6 continuous, 4 integer (4 binary) Root relaxation: objective 0.000000e+00, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 0.0000000 0.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 4 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 6.050000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 605.0000000 605.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 605 Pool objective bound 605 Optimal solution found (tolerance 1.00e-04) Best objective 6.050000000000e+02, best bound 6.050000000000e+02, gap 0.0000% Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 0.000000e+00, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 0.0000000 0.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 4 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 6.400000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 640.0000000 640.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 640 Pool objective bound 640 Optimal solution found (tolerance 1.00e-04) Best objective 6.400000000000e+02, best bound 6.400000000000e+02, gap 0.0000% Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 0.000000e+00, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 0.0000000 0.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 4 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 371 columns Presolve time: 0.00s Presolved: 0 rows, 7 columns, 0 nonzeros Variable types: 6 continuous, 1 integer (1 binary) Root relaxation: objective 8.900000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 890.0000000 890.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 890 Pool objective bound 890 Optimal solution found (tolerance 1.00e-04) Best objective 8.900000000000e+02, best bound 8.900000000000e+02, gap 0.0000% Presolve removed 658 rows and 371 columns Presolve time: 0.00s Presolved: 0 rows, 7 columns, 0 nonzeros Variable types: 6 continuous, 1 integer (1 binary) Root relaxation: objective 0.000000e+00, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 0.0000000 0.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 4 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 651 rows and 370 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Computing Irreducible Inconsistent Subsystem (IIS)... Constraints Bounds Runtime Min Max Min Max ------------------------------------------------ 0 658 0 252 0s 37 37 32 32 3s IIS computed: 37 constraints, 32 bounds IIS runtime: 3.01 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [6e-01, 1e+03] Presolve removed 658 rows and 370 columns Presolve time: 0.00s Presolved: 0 rows, 8 columns, 0 nonzeros Variable types: 6 continuous, 2 integer (2 binary) Root relaxation: objective 1.600000e+03, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1600.0000000 1600.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1600 Pool objective bound 1600 Optimal solution found (tolerance 1.00e-04) Best objective 1.600000000000e+03, best bound 1.600000000000e+03, gap 0.0000% Presolve removed 658 rows and 370 columns Presolve time: 0.00s Presolved: 0 rows, 8 columns, 0 nonzeros Variable types: 6 continuous, 2 integer (2 binary) Root relaxation: objective 0.000000e+00, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 0.0000000 0.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 4 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+03] Found heuristic solution: objective 1350 Presolve removed 658 rows and 369 columns Presolve time: 0.00s Presolved: 0 rows, 9 columns, 0 nonzeros Variable types: 6 continuous, 3 integer (3 binary) Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1350 Pool objective bound 1350 Optimal solution found (tolerance 1.00e-04) Best objective 1.350000000000e+03, best bound 1.350000000000e+03, gap 0.0000% Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [5e-01, 1e+03] Presolve removed 552 rows and 299 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Computing Irreducible Inconsistent Subsystem (IIS)... Constraints Bounds Runtime Min Max Min Max ------------------------------------------------ 0 658 0 252 0s 16 16 13 13 0s IIS computed: 16 constraints, 13 bounds IIS runtime: 0.47 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [3e-01, 1e+03] Presolve removed 658 rows and 369 columns Presolve time: 0.00s Presolved: 0 rows, 9 columns, 0 nonzeros Variable types: 6 continuous, 3 integer (3 binary) Root relaxation: objective 8.800000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 880.0000000 880.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 880 Pool objective bound 880 Optimal solution found (tolerance 1.00e-04) Best objective 8.800000000000e+02, best bound 8.800000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 658 rows and 371 columns Presolve time: 0.00s Presolved: 0 rows, 7 columns, 0 nonzeros Variable types: 6 continuous, 1 integer (1 binary) Root relaxation: objective 8.900000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 890.0000000 890.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 890 Pool objective bound 890 Optimal solution found (tolerance 1.00e-04) Best objective 8.900000000000e+02, best bound 8.900000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [2e-02, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [4e-01, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 1.115000e+03, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1115.0000000 1115.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1115 Pool objective bound 1115 Optimal solution found (tolerance 1.00e-04) Best objective 1.115000000000e+03, best bound 1.115000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 7.450000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 745.0000000 745.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 745 Pool objective bound 745 Optimal solution found (tolerance 1.00e-04) Best objective 7.450000000000e+02, best bound 7.450000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 598 rows and 317 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 925 Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 925 Pool objective bound 925 Optimal solution found (tolerance 1.00e-04) Best objective 9.250000000000e+02, best bound 9.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 6.150000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 615.0000000 615.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 615 Pool objective bound 615 Optimal solution found (tolerance 1.00e-04) Best objective 6.150000000000e+02, best bound 6.150000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 370 columns Presolve time: 0.00s Presolved: 0 rows, 8 columns, 0 nonzeros Variable types: 6 continuous, 2 integer (2 binary) Root relaxation: objective 1.120000e+03, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1120.0000000 1120.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1120 Pool objective bound 1120 Optimal solution found (tolerance 1.00e-04) Best objective 1.120000000000e+03, best bound 1.120000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 370 columns Presolve time: 0.00s Presolved: 0 rows, 8 columns, 0 nonzeros Variable types: 6 continuous, 2 integer (2 binary) Root relaxation: objective 8.800000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 880.0000000 880.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 880 Pool objective bound 880 Optimal solution found (tolerance 1.00e-04) Best objective 8.800000000000e+02, best bound 8.800000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 6.700000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 670.0000000 670.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 670 Pool objective bound 670 Optimal solution found (tolerance 1.00e-04) Best objective 6.700000000000e+02, best bound 6.700000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 369 columns Presolve time: 0.00s Presolved: 0 rows, 9 columns, 0 nonzeros Variable types: 6 continuous, 3 integer (3 binary) Root relaxation: objective 7.500000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 750.0000000 750.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 750 Pool objective bound 750 Optimal solution found (tolerance 1.00e-04) Best objective 7.500000000000e+02, best bound 7.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 368 columns Presolve time: 0.00s Presolved: 0 rows, 10 columns, 0 nonzeros Variable types: 6 continuous, 4 integer (4 binary) Root relaxation: objective 8.450000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 845.0000000 845.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 845 Pool objective bound 845 Optimal solution found (tolerance 1.00e-04) Best objective 8.450000000000e+02, best bound 8.450000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 7.200000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 720.0000000 720.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 720 Pool objective bound 720 Optimal solution found (tolerance 1.00e-04) Best objective 7.200000000000e+02, best bound 7.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 370 columns Presolve time: 0.00s Presolved: 0 rows, 8 columns, 0 nonzeros Variable types: 6 continuous, 2 integer (2 binary) Root relaxation: objective 6.950000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 695.0000000 695.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 695 Pool objective bound 695 Optimal solution found (tolerance 1.00e-04) Best objective 6.950000000000e+02, best bound 6.950000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 371 columns Presolve time: 0.00s Presolved: 0 rows, 7 columns, 0 nonzeros Variable types: 6 continuous, 1 integer (1 binary) Root relaxation: objective 6.200000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 620.0000000 620.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 620 Pool objective bound 620 Optimal solution found (tolerance 1.00e-04) Best objective 6.200000000000e+02, best bound 6.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 371 columns Presolve time: 0.00s Presolved: 0 rows, 7 columns, 0 nonzeros Variable types: 6 continuous, 1 integer (1 binary) Root relaxation: objective 6.800000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 680.0000000 680.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 680 Pool objective bound 680 Optimal solution found (tolerance 1.00e-04) Best objective 6.800000000000e+02, best bound 6.800000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 656 rows and 365 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 657 rows and 368 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 371 columns Presolve time: 0.00s Presolved: 0 rows, 7 columns, 0 nonzeros Variable types: 6 continuous, 1 integer (1 binary) Root relaxation: objective 6.050000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 605.0000000 605.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.03 seconds Thread count was 4 (of 4 available processors) Solution count 1: 605 Pool objective bound 605 Optimal solution found (tolerance 1.00e-04) Best objective 6.050000000000e+02, best bound 6.050000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 640 rows and 353 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 370 columns Presolve time: 0.00s Presolved: 0 rows, 8 columns, 0 nonzeros Variable types: 6 continuous, 2 integer (2 binary) Root relaxation: objective 8.250000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 825.0000000 825.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 825 Pool objective bound 825 Optimal solution found (tolerance 1.00e-04) Best objective 8.250000000000e+02, best bound 8.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter IntFeasTol to 0.1 Prev: 1e-05 Min: 1e-09 Max: 0.1 Default: 1e-05 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 1.140000e+03, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1140.0000000 1140.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1140 Pool objective bound 1140 Optimal solution found (tolerance 1.00e-04) Best objective 1.140000000000e+03, best bound 1.140000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter IntFeasTol to 0.1 Prev: 1e-05 Min: 1e-09 Max: 0.1 Default: 1e-05 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 624 rows and 336 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter IntFeasTol to 0.1 Prev: 1e-05 Min: 1e-09 Max: 0.1 Default: 1e-05 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 500 Presolve removed 658 rows and 357 columns Presolve time: 0.00s Presolved: 0 rows, 21 columns, 0 nonzeros Variable types: 6 continuous, 15 integer (15 binary) Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 500 Pool objective bound 500 Optimal solution found (tolerance 1.00e-04) Best objective 5.000000000000e+02, best bound 5.000000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter IntFeasTol to 0.1 Prev: 1e-05 Min: 1e-09 Max: 0.1 Default: 1e-05 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 6.800000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 680.0000000 680.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 1: 680 Pool objective bound 680 Optimal solution found (tolerance 1.00e-04) Best objective 6.800000000000e+02, best bound 6.800000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter IntFeasTol to 0.1 Prev: 1e-05 Min: 1e-09 Max: 0.1 Default: 1e-05 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 595 rows and 326 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter IntFeasTol to 0.1 Prev: 1e-05 Min: 1e-09 Max: 0.1 Default: 1e-05 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 9.150000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 915.0000000 915.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 915 Pool objective bound 915 Optimal solution found (tolerance 1.00e-04) Best objective 9.150000000000e+02, best bound 9.150000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter IntFeasTol to 0.1 Prev: 1e-05 Min: 1e-09 Max: 0.1 Default: 1e-05 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 372 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 9.500000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 950.0000000 950.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 950 Pool objective bound 950 Optimal solution found (tolerance 1.00e-04) Best objective 9.500000000000e+02, best bound 9.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter IntFeasTol to 0.1 Prev: 1e-05 Min: 1e-09 Max: 0.1 Default: 1e-05 Optimize a model with 658 rows, 378 columns and 3288 nonzeros Variable types: 6 continuous, 372 integer (126 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 5e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 658 rows and 368 columns Presolve time: 0.00s Presolved: 0 rows, 10 columns, 0 nonzeros Variable types: 6 continuous, 4 integer (4 binary) Root relaxation: objective 9.050000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 905.0000000 905.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 905 Pool objective bound 905 Optimal solution found (tolerance 1.00e-04) Best objective 9.050000000000e+02, best bound 9.050000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter IntFeasTol to 0.1 Prev: 1e-05 Min: 1e-09 Max: 0.1 Default: 1e-05 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 186 columns Presolve time: 0.00s Presolved: 0 rows, 12 columns, 0 nonzeros Variable types: 6 continuous, 6 integer (6 binary) Root relaxation: objective 5.900000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 590.0000000 590.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 590 Pool objective bound 590 Optimal solution found (tolerance 1.00e-04) Best objective 5.900000000000e+02, best bound 5.900000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter IntFeasTol to 0.1 Prev: 1e-05 Min: 1e-09 Max: 0.1 Default: 1e-05 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 178 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter IntFeasTol to 0.1 Prev: 1e-05 Min: 1e-09 Max: 0.1 Default: 1e-05 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 292 rows and 151 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter IntFeasTol to 0.1 Prev: 1e-05 Min: 1e-09 Max: 0.1 Default: 1e-05 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 185 columns Presolve time: 0.00s Presolved: 0 rows, 13 columns, 0 nonzeros Variable types: 6 continuous, 7 integer (7 binary) Root relaxation: objective 5.200000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 520.0000000 520.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 520 Pool objective bound 520 Optimal solution found (tolerance 1.00e-04) Best objective 5.200000000000e+02, best bound 5.200000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter IntFeasTol to 0.1 Prev: 1e-05 Min: 1e-09 Max: 0.1 Default: 1e-05 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 191 columns Presolve time: 0.00s Presolved: 0 rows, 7 columns, 0 nonzeros Variable types: 6 continuous, 1 integer (1 binary) Root relaxation: objective 7.050000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 705.0000000 705.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 705 Pool objective bound 705 Optimal solution found (tolerance 1.00e-04) Best objective 7.050000000000e+02, best bound 7.050000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter IntFeasTol to 0.1 Prev: 1e-05 Min: 1e-09 Max: 0.1 Default: 1e-05 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 190 columns Presolve time: 0.00s Presolved: 0 rows, 8 columns, 0 nonzeros Variable types: 6 continuous, 2 integer (2 binary) Root relaxation: objective 1.280000e+03, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1280.0000000 1280.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1280 Pool objective bound 1280 Optimal solution found (tolerance 1.00e-04) Best objective 1.280000000000e+03, best bound 1.280000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter IntFeasTol to 0.1 Prev: 1e-05 Min: 1e-09 Max: 0.1 Default: 1e-05 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 750 Presolve removed 338 rows and 189 columns Presolve time: 0.00s Presolved: 0 rows, 9 columns, 0 nonzeros Variable types: 6 continuous, 3 integer (3 binary) Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 750 Pool objective bound 750 Optimal solution found (tolerance 1.00e-04) Best objective 7.500000000000e+02, best bound 7.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter IntFeasTol to 0.1 Prev: 1e-05 Min: 1e-09 Max: 0.1 Default: 1e-05 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 560 Presolve removed 338 rows and 187 columns Presolve time: 0.00s Presolved: 0 rows, 11 columns, 0 nonzeros Variable types: 6 continuous, 5 integer (5 binary) Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 560 Pool objective bound 560 Optimal solution found (tolerance 1.00e-04) Best objective 5.600000000000e+02, best bound 5.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 191 columns Presolve time: 0.00s Presolved: 0 rows, 7 columns, 0 nonzeros Variable types: 6 continuous, 1 integer (1 binary) Root relaxation: objective 7.600000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 760.0000000 760.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 760 Pool objective bound 760 Optimal solution found (tolerance 1.00e-04) Best objective 7.600000000000e+02, best bound 7.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 337 rows and 187 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 190 columns Presolve time: 0.00s Presolved: 0 rows, 8 columns, 0 nonzeros Variable types: 6 continuous, 2 integer (2 binary) Root relaxation: objective 1.545000e+03, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1545.0000000 1545.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1545 Pool objective bound 1545 Optimal solution found (tolerance 1.00e-04) Best objective 1.545000000000e+03, best bound 1.545000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 191 columns Presolve time: 0.00s Presolved: 0 rows, 7 columns, 0 nonzeros Variable types: 6 continuous, 1 integer (1 binary) Root relaxation: objective 5.600000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 560.0000000 560.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 560 Pool objective bound 560 Optimal solution found (tolerance 1.00e-04) Best objective 5.600000000000e+02, best bound 5.600000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 880 Presolve removed 338 rows and 191 columns Presolve time: 0.00s Presolved: 0 rows, 7 columns, 0 nonzeros Variable types: 6 continuous, 1 integer (1 binary) Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 880 Pool objective bound 880 Optimal solution found (tolerance 1.00e-04) Best objective 8.800000000000e+02, best bound 8.800000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 192 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 7.100000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 710.0000000 710.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 710 Pool objective bound 710 Optimal solution found (tolerance 1.00e-04) Best objective 7.100000000000e+02, best bound 7.100000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 187 columns Presolve time: 0.00s Presolved: 0 rows, 11 columns, 0 nonzeros Variable types: 6 continuous, 5 integer (5 binary) Root relaxation: objective 4.050000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 405.0000000 405.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 405 Pool objective bound 405 Optimal solution found (tolerance 1.00e-04) Best objective 4.050000000000e+02, best bound 4.050000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 191 columns Presolve time: 0.00s Presolved: 0 rows, 7 columns, 0 nonzeros Variable types: 6 continuous, 1 integer (1 binary) Root relaxation: objective 1.085000e+03, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1085.0000000 1085.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1085 Pool objective bound 1085 Optimal solution found (tolerance 1.00e-04) Best objective 1.085000000000e+03, best bound 1.085000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 1135 Presolve removed 338 rows and 191 columns Presolve time: 0.00s Presolved: 0 rows, 7 columns, 0 nonzeros Variable types: 6 continuous, 1 integer (1 binary) Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1135 Pool objective bound 1135 Optimal solution found (tolerance 1.00e-04) Best objective 1.135000000000e+03, best bound 1.135000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 191 columns Presolve time: 0.00s Presolved: 0 rows, 7 columns, 0 nonzeros Variable types: 6 continuous, 1 integer (1 binary) Root relaxation: objective 6.400000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 640.0000000 640.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 640 Pool objective bound 640 Optimal solution found (tolerance 1.00e-04) Best objective 6.400000000000e+02, best bound 6.400000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 332 rows and 183 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 330 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 185 columns Presolve time: 0.00s Presolved: 0 rows, 13 columns, 0 nonzeros Variable types: 6 continuous, 7 integer (7 binary) Root relaxation: objective 4.650000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 465.0000000 465.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 465 Pool objective bound 465 Optimal solution found (tolerance 1.00e-04) Best objective 4.650000000000e+02, best bound 4.650000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 331 rows and 182 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 191 columns Presolve time: 0.00s Presolved: 0 rows, 7 columns, 0 nonzeros Variable types: 6 continuous, 1 integer (1 binary) Root relaxation: objective 6.950000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 695.0000000 695.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 1: 695 Pool objective bound 695 Optimal solution found (tolerance 1.00e-04) Best objective 6.950000000000e+02, best bound 6.950000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 190 columns Presolve time: 0.00s Presolved: 0 rows, 8 columns, 0 nonzeros Variable types: 6 continuous, 2 integer (2 binary) Root relaxation: objective 1.075000e+03, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1075.0000000 1075.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1075 Pool objective bound 1075 Optimal solution found (tolerance 1.00e-04) Best objective 1.075000000000e+03, best bound 1.075000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 1055 Presolve removed 338 rows and 191 columns Presolve time: 0.00s Presolved: 0 rows, 7 columns, 0 nonzeros Variable types: 6 continuous, 1 integer (1 binary) Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1055 Pool objective bound 1055 Optimal solution found (tolerance 1.00e-04) Best objective 1.055000000000e+03, best bound 1.055000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 292 rows and 151 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 192 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 6.850000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 685.0000000 685.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 685 Pool objective bound 685 Optimal solution found (tolerance 1.00e-04) Best objective 6.850000000000e+02, best bound 6.850000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 186 columns Presolve time: 0.00s Presolved: 0 rows, 12 columns, 0 nonzeros Variable types: 6 continuous, 6 integer (6 binary) Root relaxation: objective 1.040000e+03, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1040.0000000 1040.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1040 Pool objective bound 1040 Optimal solution found (tolerance 1.00e-04) Best objective 1.040000000000e+03, best bound 1.040000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 187 columns Presolve time: 0.00s Presolved: 0 rows, 11 columns, 0 nonzeros Variable types: 6 continuous, 5 integer (5 binary) Root relaxation: objective 9.050000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 905.0000000 905.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 905 Pool objective bound 905 Optimal solution found (tolerance 1.00e-04) Best objective 9.050000000000e+02, best bound 9.050000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 192 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 8.050000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 805.0000000 805.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 805 Pool objective bound 805 Optimal solution found (tolerance 1.00e-04) Best objective 8.050000000000e+02, best bound 8.050000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 915 Presolve removed 338 rows and 192 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 915 Pool objective bound 915 Optimal solution found (tolerance 1.00e-04) Best objective 9.150000000000e+02, best bound 9.150000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 189 columns Presolve time: 0.00s Presolved: 0 rows, 9 columns, 0 nonzeros Variable types: 6 continuous, 3 integer (3 binary) Root relaxation: objective 1.290000e+03, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1290.0000000 1290.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.02 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1290 Pool objective bound 1290 Optimal solution found (tolerance 1.00e-04) Best objective 1.290000000000e+03, best bound 1.290000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 850 Presolve removed 338 rows and 186 columns Presolve time: 0.00s Presolved: 0 rows, 12 columns, 0 nonzeros Variable types: 6 continuous, 6 integer (6 binary) Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 850 Pool objective bound 850 Optimal solution found (tolerance 1.00e-04) Best objective 8.500000000000e+02, best bound 8.500000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 1130 Presolve removed 338 rows and 192 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1130 Pool objective bound 1130 Optimal solution found (tolerance 1.00e-04) Best objective 1.130000000000e+03, best bound 1.130000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 192 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 1.350000e+03, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1350.0000000 1350.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1350 Pool objective bound 1350 Optimal solution found (tolerance 1.00e-04) Best objective 1.350000000000e+03, best bound 1.350000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 190 columns Presolve time: 0.00s Presolved: 0 rows, 8 columns, 0 nonzeros Variable types: 6 continuous, 2 integer (2 binary) Root relaxation: objective 8.150000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 815.0000000 815.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 815 Pool objective bound 815 Optimal solution found (tolerance 1.00e-04) Best objective 8.150000000000e+02, best bound 8.150000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 191 columns Presolve time: 0.00s Presolved: 0 rows, 7 columns, 0 nonzeros Variable types: 6 continuous, 1 integer (1 binary) Root relaxation: objective 1.025000e+03, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1025.0000000 1025.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1025 Pool objective bound 1025 Optimal solution found (tolerance 1.00e-04) Best objective 1.025000000000e+03, best bound 1.025000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 192 columns Presolve time: 0.00s Presolved: 0 rows, 6 columns, 0 nonzeros Variable types: 6 continuous, 0 integer (0 binary) Root relaxation: objective 6.250000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 625.0000000 625.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 625 Pool objective bound 625 Optimal solution found (tolerance 1.00e-04) Best objective 6.250000000000e+02, best bound 6.250000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 191 columns Presolve time: 0.00s Presolved: 0 rows, 7 columns, 0 nonzeros Variable types: 6 continuous, 1 integer (1 binary) Root relaxation: objective 1.150000e+03, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1150.0000000 1150.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 1150 Pool objective bound 1150 Optimal solution found (tolerance 1.00e-04) Best objective 1.150000000000e+03, best bound 1.150000000000e+03, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 338 rows and 189 columns Presolve time: 0.00s Presolved: 0 rows, 9 columns, 0 nonzeros Variable types: 6 continuous, 3 integer (3 binary) Root relaxation: objective 6.850000e+02, 0 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 685.0000000 685.00000 0.00% - 0s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 4 (of 4 available processors) Solution count 1: 685 Pool objective bound 685 Optimal solution found (tolerance 1.00e-04) Best objective 6.850000000000e+02, best bound 6.850000000000e+02, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Computing Irreducible Inconsistent Subsystem (IIS)... Constraints Bounds Runtime Min Max Min Max ------------------------------------------------ 0 338 0 132 0s 16 16 10 10 0s IIS computed: 16 constraints, 10 bounds IIS runtime: 0.26 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 100 rows and 31 columns Presolve time: 0.01s Presolved: 238 rows, 542 columns, 1692 nonzeros Variable types: 350 continuous, 192 integer (66 binary) Root relaxation: objective 0.000000e+00, 50 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 10 90.00000 0.00000 100% - 0s H 0 0 31.0000000 0.00000 100% - 0s 0 0 0.00000 0 21 31.00000 0.00000 100% - 0s H 0 0 28.0000000 0.00000 100% - 0s 0 0 0.00000 0 17 28.00000 0.00000 100% - 0s 0 0 0.00000 0 16 28.00000 0.00000 100% - 0s 0 0 0.00000 0 18 28.00000 0.00000 100% - 0s H 0 0 13.0000000 0.00000 100% - 0s 0 0 0.00000 0 22 13.00000 0.00000 100% - 0s 0 0 0.00000 0 6 13.00000 0.00000 100% - 0s H 0 0 12.0000000 0.00000 100% - 0s 0 0 0.00000 0 6 12.00000 0.00000 100% - 0s 0 0 0.00000 0 1 12.00000 0.00000 100% - 0s H 0 0 2.0000000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 2 0.00000 0 1 2.00000 0.00000 100% - 0s * 4 1 2 1.0000000 1.00000 0.00% 7.2 0s Cutting planes: Gomory: 5 MIR: 12 Explored 5 nodes (285 simplex iterations) in 0.11 seconds Thread count was 4 (of 4 available processors) Solution count 7: 1 2 12 ... 90 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Variable X ------------------------- ArtN_R188 1 Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 100 rows and 31 columns Presolve time: 0.00s Presolved: 238 rows, 542 columns, 1692 nonzeros Variable types: 350 continuous, 192 integer (66 binary) Root relaxation: objective 0.000000e+00, 50 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 10 90.00000 0.00000 100% - 0s H 0 0 31.0000000 0.00000 100% - 0s 0 0 0.00000 0 21 31.00000 0.00000 100% - 0s H 0 0 28.0000000 0.00000 100% - 0s 0 0 0.00000 0 17 28.00000 0.00000 100% - 0s 0 0 0.00000 0 16 28.00000 0.00000 100% - 0s 0 0 0.00000 0 18 28.00000 0.00000 100% - 0s H 0 0 13.0000000 0.00000 100% - 0s 0 0 0.00000 0 22 13.00000 0.00000 100% - 0s 0 0 0.00000 0 6 13.00000 0.00000 100% - 0s H 0 0 12.0000000 0.00000 100% - 0s 0 0 0.00000 0 6 12.00000 0.00000 100% - 0s 0 0 0.00000 0 1 12.00000 0.00000 100% - 0s H 0 0 2.0000000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 2 0.00000 0 1 2.00000 0.00000 100% - 0s * 4 1 2 1.0000000 1.00000 0.00% 7.2 0s Cutting planes: Gomory: 5 MIR: 12 Explored 5 nodes (285 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 7: 1 2 12 ... 90 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 100 rows and 31 columns Presolve time: 0.00s Presolved: 238 rows, 542 columns, 1692 nonzeros Variable types: 350 continuous, 192 integer (66 binary) Root relaxation: objective 0.000000e+00, 50 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 10 90.00000 0.00000 100% - 0s H 0 0 31.0000000 0.00000 100% - 0s 0 0 0.00000 0 21 31.00000 0.00000 100% - 0s H 0 0 28.0000000 0.00000 100% - 0s 0 0 0.00000 0 17 28.00000 0.00000 100% - 0s 0 0 0.00000 0 16 28.00000 0.00000 100% - 0s 0 0 0.00000 0 18 28.00000 0.00000 100% - 0s H 0 0 13.0000000 0.00000 100% - 0s 0 0 0.00000 0 22 13.00000 0.00000 100% - 0s 0 0 0.00000 0 6 13.00000 0.00000 100% - 0s H 0 0 12.0000000 0.00000 100% - 0s 0 0 0.00000 0 6 12.00000 0.00000 100% - 0s 0 0 0.00000 0 1 12.00000 0.00000 100% - 0s H 0 0 2.0000000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 2 0.00000 0 1 2.00000 0.00000 100% - 0s * 4 1 2 1.0000000 1.00000 0.00% 7.2 0s Cutting planes: Gomory: 5 MIR: 12 Explored 5 nodes (285 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 7: 1 2 12 ... 90 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 100 rows and 31 columns Presolve time: 0.00s Presolved: 238 rows, 542 columns, 1692 nonzeros Variable types: 350 continuous, 192 integer (66 binary) Root relaxation: objective 0.000000e+00, 50 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 10 90.00000 0.00000 100% - 0s H 0 0 31.0000000 0.00000 100% - 0s 0 0 0.00000 0 21 31.00000 0.00000 100% - 0s H 0 0 28.0000000 0.00000 100% - 0s 0 0 0.00000 0 17 28.00000 0.00000 100% - 0s 0 0 0.00000 0 16 28.00000 0.00000 100% - 0s 0 0 0.00000 0 18 28.00000 0.00000 100% - 0s H 0 0 13.0000000 0.00000 100% - 0s 0 0 0.00000 0 22 13.00000 0.00000 100% - 0s 0 0 0.00000 0 6 13.00000 0.00000 100% - 0s H 0 0 12.0000000 0.00000 100% - 0s 0 0 0.00000 0 6 12.00000 0.00000 100% - 0s 0 0 0.00000 0 1 12.00000 0.00000 100% - 0s H 0 0 2.0000000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 2 0.00000 0 1 2.00000 0.00000 100% - 0s * 4 1 2 1.0000000 1.00000 0.00% 7.2 0s Cutting planes: Gomory: 5 MIR: 12 Explored 5 nodes (285 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 7: 1 2 12 ... 90 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 100 rows and 31 columns Presolve time: 0.00s Presolved: 238 rows, 542 columns, 1692 nonzeros Variable types: 350 continuous, 192 integer (66 binary) Root relaxation: objective 0.000000e+00, 50 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 10 90.00000 0.00000 100% - 0s H 0 0 31.0000000 0.00000 100% - 0s 0 0 0.00000 0 21 31.00000 0.00000 100% - 0s H 0 0 28.0000000 0.00000 100% - 0s 0 0 0.00000 0 17 28.00000 0.00000 100% - 0s 0 0 0.00000 0 16 28.00000 0.00000 100% - 0s 0 0 0.00000 0 18 28.00000 0.00000 100% - 0s H 0 0 13.0000000 0.00000 100% - 0s 0 0 0.00000 0 22 13.00000 0.00000 100% - 0s 0 0 0.00000 0 6 13.00000 0.00000 100% - 0s H 0 0 12.0000000 0.00000 100% - 0s 0 0 0.00000 0 6 12.00000 0.00000 100% - 0s 0 0 0.00000 0 1 12.00000 0.00000 100% - 0s H 0 0 2.0000000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 2 0.00000 0 1 2.00000 0.00000 100% - 0s * 4 1 2 1.0000000 1.00000 0.00% 7.2 0s Cutting planes: Gomory: 5 MIR: 12 Explored 5 nodes (285 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 7: 1 2 12 ... 90 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 100 rows and 31 columns Presolve time: 0.00s Presolved: 238 rows, 542 columns, 1692 nonzeros Variable types: 350 continuous, 192 integer (66 binary) Root relaxation: objective 0.000000e+00, 50 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 10 90.00000 0.00000 100% - 0s H 0 0 31.0000000 0.00000 100% - 0s 0 0 0.00000 0 21 31.00000 0.00000 100% - 0s H 0 0 28.0000000 0.00000 100% - 0s 0 0 0.00000 0 17 28.00000 0.00000 100% - 0s 0 0 0.00000 0 16 28.00000 0.00000 100% - 0s 0 0 0.00000 0 18 28.00000 0.00000 100% - 0s H 0 0 13.0000000 0.00000 100% - 0s 0 0 0.00000 0 22 13.00000 0.00000 100% - 0s 0 0 0.00000 0 6 13.00000 0.00000 100% - 0s H 0 0 12.0000000 0.00000 100% - 0s 0 0 0.00000 0 6 12.00000 0.00000 100% - 0s 0 0 0.00000 0 1 12.00000 0.00000 100% - 0s H 0 0 2.0000000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 2 0.00000 0 1 2.00000 0.00000 100% - 0s * 4 1 2 1.0000000 1.00000 0.00% 7.2 0s Cutting planes: Gomory: 5 MIR: 12 Explored 5 nodes (285 simplex iterations) in 0.10 seconds Thread count was 4 (of 4 available processors) Solution count 7: 1 2 12 ... 90 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 100 rows and 31 columns Presolve time: 0.00s Presolved: 238 rows, 542 columns, 1692 nonzeros Variable types: 350 continuous, 192 integer (66 binary) Root relaxation: objective 0.000000e+00, 50 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 10 90.00000 0.00000 100% - 0s H 0 0 31.0000000 0.00000 100% - 0s 0 0 0.00000 0 21 31.00000 0.00000 100% - 0s H 0 0 28.0000000 0.00000 100% - 0s 0 0 0.00000 0 17 28.00000 0.00000 100% - 0s 0 0 0.00000 0 16 28.00000 0.00000 100% - 0s 0 0 0.00000 0 18 28.00000 0.00000 100% - 0s H 0 0 13.0000000 0.00000 100% - 0s 0 0 0.00000 0 22 13.00000 0.00000 100% - 0s 0 0 0.00000 0 6 13.00000 0.00000 100% - 0s H 0 0 12.0000000 0.00000 100% - 0s 0 0 0.00000 0 6 12.00000 0.00000 100% - 0s 0 0 0.00000 0 1 12.00000 0.00000 100% - 0s H 0 0 2.0000000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 2 0.00000 0 1 2.00000 0.00000 100% - 0s * 4 1 2 1.0000000 1.00000 0.00% 7.2 0s Cutting planes: Gomory: 5 MIR: 12 Explored 5 nodes (285 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 7: 1 2 12 ... 90 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 100 rows and 31 columns Presolve time: 0.00s Presolved: 238 rows, 542 columns, 1692 nonzeros Variable types: 350 continuous, 192 integer (66 binary) Root relaxation: objective 0.000000e+00, 50 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 10 90.00000 0.00000 100% - 0s H 0 0 31.0000000 0.00000 100% - 0s 0 0 0.00000 0 21 31.00000 0.00000 100% - 0s H 0 0 28.0000000 0.00000 100% - 0s 0 0 0.00000 0 17 28.00000 0.00000 100% - 0s 0 0 0.00000 0 16 28.00000 0.00000 100% - 0s 0 0 0.00000 0 18 28.00000 0.00000 100% - 0s H 0 0 13.0000000 0.00000 100% - 0s 0 0 0.00000 0 22 13.00000 0.00000 100% - 0s 0 0 0.00000 0 6 13.00000 0.00000 100% - 0s H 0 0 12.0000000 0.00000 100% - 0s 0 0 0.00000 0 6 12.00000 0.00000 100% - 0s 0 0 0.00000 0 1 12.00000 0.00000 100% - 0s H 0 0 2.0000000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 2 0.00000 0 1 2.00000 0.00000 100% - 0s * 4 1 2 1.0000000 1.00000 0.00% 7.2 0s Cutting planes: Gomory: 5 MIR: 12 Explored 5 nodes (285 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 7: 1 2 12 ... 90 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 100 rows and 31 columns Presolve time: 0.00s Presolved: 238 rows, 542 columns, 1692 nonzeros Variable types: 350 continuous, 192 integer (66 binary) Root relaxation: objective 0.000000e+00, 50 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 10 90.00000 0.00000 100% - 0s H 0 0 31.0000000 0.00000 100% - 0s 0 0 0.00000 0 21 31.00000 0.00000 100% - 0s H 0 0 28.0000000 0.00000 100% - 0s 0 0 0.00000 0 17 28.00000 0.00000 100% - 0s 0 0 0.00000 0 16 28.00000 0.00000 100% - 0s 0 0 0.00000 0 18 28.00000 0.00000 100% - 0s H 0 0 13.0000000 0.00000 100% - 0s 0 0 0.00000 0 22 13.00000 0.00000 100% - 0s 0 0 0.00000 0 6 13.00000 0.00000 100% - 0s H 0 0 12.0000000 0.00000 100% - 0s 0 0 0.00000 0 6 12.00000 0.00000 100% - 0s 0 0 0.00000 0 1 12.00000 0.00000 100% - 0s H 0 0 2.0000000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 2 0.00000 0 1 2.00000 0.00000 100% - 0s * 4 1 2 1.0000000 1.00000 0.00% 7.2 0s Cutting planes: Gomory: 5 MIR: 12 Explored 5 nodes (285 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 7: 1 2 12 ... 90 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 100 rows and 31 columns Presolve time: 0.00s Presolved: 238 rows, 542 columns, 1692 nonzeros Variable types: 350 continuous, 192 integer (66 binary) Root relaxation: objective 0.000000e+00, 50 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 10 90.00000 0.00000 100% - 0s H 0 0 31.0000000 0.00000 100% - 0s 0 0 0.00000 0 21 31.00000 0.00000 100% - 0s H 0 0 28.0000000 0.00000 100% - 0s 0 0 0.00000 0 17 28.00000 0.00000 100% - 0s 0 0 0.00000 0 16 28.00000 0.00000 100% - 0s 0 0 0.00000 0 18 28.00000 0.00000 100% - 0s H 0 0 13.0000000 0.00000 100% - 0s 0 0 0.00000 0 22 13.00000 0.00000 100% - 0s 0 0 0.00000 0 6 13.00000 0.00000 100% - 0s H 0 0 12.0000000 0.00000 100% - 0s 0 0 0.00000 0 6 12.00000 0.00000 100% - 0s 0 0 0.00000 0 1 12.00000 0.00000 100% - 0s H 0 0 2.0000000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 2 0.00000 0 1 2.00000 0.00000 100% - 0s * 4 1 2 1.0000000 1.00000 0.00% 7.2 0s Cutting planes: Gomory: 5 MIR: 12 Explored 5 nodes (285 simplex iterations) in 0.09 seconds Thread count was 4 (of 4 available processors) Solution count 7: 1 2 12 ... 90 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 100 rows and 31 columns Presolve time: 0.00s Presolved: 238 rows, 542 columns, 1692 nonzeros Variable types: 350 continuous, 192 integer (66 binary) Root relaxation: objective 0.000000e+00, 50 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 10 90.00000 0.00000 100% - 0s H 0 0 31.0000000 0.00000 100% - 0s 0 0 0.00000 0 21 31.00000 0.00000 100% - 0s H 0 0 28.0000000 0.00000 100% - 0s 0 0 0.00000 0 17 28.00000 0.00000 100% - 0s 0 0 0.00000 0 16 28.00000 0.00000 100% - 0s 0 0 0.00000 0 18 28.00000 0.00000 100% - 0s H 0 0 13.0000000 0.00000 100% - 0s 0 0 0.00000 0 22 13.00000 0.00000 100% - 0s 0 0 0.00000 0 6 13.00000 0.00000 100% - 0s H 0 0 12.0000000 0.00000 100% - 0s 0 0 0.00000 0 6 12.00000 0.00000 100% - 0s 0 0 0.00000 0 1 12.00000 0.00000 100% - 0s H 0 0 2.0000000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 2 0.00000 0 1 2.00000 0.00000 100% - 0s * 4 1 2 1.0000000 1.00000 0.00% 7.2 0s Cutting planes: Gomory: 5 MIR: 12 Explored 5 nodes (285 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 7: 1 2 12 ... 90 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 100 rows and 31 columns Presolve time: 0.00s Presolved: 238 rows, 542 columns, 1692 nonzeros Variable types: 350 continuous, 192 integer (66 binary) Root relaxation: objective 0.000000e+00, 50 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 10 90.00000 0.00000 100% - 0s H 0 0 31.0000000 0.00000 100% - 0s 0 0 0.00000 0 21 31.00000 0.00000 100% - 0s H 0 0 28.0000000 0.00000 100% - 0s 0 0 0.00000 0 17 28.00000 0.00000 100% - 0s 0 0 0.00000 0 16 28.00000 0.00000 100% - 0s 0 0 0.00000 0 18 28.00000 0.00000 100% - 0s H 0 0 13.0000000 0.00000 100% - 0s 0 0 0.00000 0 22 13.00000 0.00000 100% - 0s 0 0 0.00000 0 6 13.00000 0.00000 100% - 0s H 0 0 12.0000000 0.00000 100% - 0s 0 0 0.00000 0 6 12.00000 0.00000 100% - 0s 0 0 0.00000 0 1 12.00000 0.00000 100% - 0s H 0 0 2.0000000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 2 0.00000 0 1 2.00000 0.00000 100% - 0s * 4 1 2 1.0000000 1.00000 0.00% 7.2 0s Cutting planes: Gomory: 5 MIR: 12 Explored 5 nodes (285 simplex iterations) in 0.08 seconds Thread count was 4 (of 4 available processors) Solution count 7: 1 2 12 ... 90 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter ScaleFlag to 2 Prev: 1 Min: 0 Max: 2 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 100 rows and 31 columns Presolve time: 0.01s Presolved: 238 rows, 542 columns, 1692 nonzeros Variable types: 350 continuous, 192 integer (66 binary) Root relaxation: objective 0.000000e+00, 46 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 12 90.00000 0.00000 100% - 0s H 0 0 31.0000000 0.00000 100% - 0s 0 0 0.00000 0 9 31.00000 0.00000 100% - 0s H 0 0 14.0000000 0.00000 100% - 0s 0 0 0.00000 0 9 14.00000 0.00000 100% - 0s 0 0 0.00000 0 16 14.00000 0.00000 100% - 0s H 0 0 5.0000000 0.00000 100% - 0s 0 0 0.00000 0 11 5.00000 0.00000 100% - 0s 0 0 0.00000 0 14 5.00000 0.00000 100% - 0s 0 0 0.00000 0 3 5.00000 0.00000 100% - 0s 0 0 0.00000 0 3 5.00000 0.00000 100% - 0s H 0 0 1.0000000 0.00000 100% - 0s 0 2 0.00000 0 1 1.00000 0.00000 100% - 0s Cutting planes: Gomory: 2 MIR: 8 Explored 4 nodes (408 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 5: 1 5 14 ... 90 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter ScaleFlag to 2 Prev: 1 Min: 0 Max: 2 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 100 rows and 31 columns Presolve time: 0.00s Presolved: 238 rows, 542 columns, 1692 nonzeros Variable types: 350 continuous, 192 integer (66 binary) Root relaxation: objective 0.000000e+00, 46 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 12 90.00000 0.00000 100% - 0s H 0 0 31.0000000 0.00000 100% - 0s 0 0 0.00000 0 9 31.00000 0.00000 100% - 0s H 0 0 14.0000000 0.00000 100% - 0s 0 0 0.00000 0 9 14.00000 0.00000 100% - 0s 0 0 0.00000 0 16 14.00000 0.00000 100% - 0s H 0 0 5.0000000 0.00000 100% - 0s 0 0 0.00000 0 11 5.00000 0.00000 100% - 0s 0 0 0.00000 0 14 5.00000 0.00000 100% - 0s 0 0 0.00000 0 3 5.00000 0.00000 100% - 0s 0 0 0.00000 0 3 5.00000 0.00000 100% - 0s H 0 0 1.0000000 0.00000 100% - 0s 0 2 0.00000 0 1 1.00000 0.00000 100% - 0s Cutting planes: Gomory: 2 MIR: 8 Explored 4 nodes (408 simplex iterations) in 0.06 seconds Thread count was 4 (of 4 available processors) Solution count 5: 1 5 14 ... 90 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 100 rows and 31 columns Presolve time: 0.00s Presolved: 238 rows, 542 columns, 1692 nonzeros Variable types: 350 continuous, 192 integer (66 binary) Root relaxation: objective 0.000000e+00, 50 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 10 90.00000 0.00000 100% - 0s H 0 0 31.0000000 0.00000 100% - 0s 0 0 0.00000 0 21 31.00000 0.00000 100% - 0s H 0 0 28.0000000 0.00000 100% - 0s 0 0 0.00000 0 17 28.00000 0.00000 100% - 0s 0 0 0.00000 0 16 28.00000 0.00000 100% - 0s 0 0 0.00000 0 18 28.00000 0.00000 100% - 0s H 0 0 13.0000000 0.00000 100% - 0s 0 0 0.00000 0 22 13.00000 0.00000 100% - 0s 0 0 0.00000 0 6 13.00000 0.00000 100% - 0s H 0 0 12.0000000 0.00000 100% - 0s 0 0 0.00000 0 6 12.00000 0.00000 100% - 0s 0 0 0.00000 0 1 12.00000 0.00000 100% - 0s H 0 0 2.0000000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 2 0.00000 0 1 2.00000 0.00000 100% - 0s * 4 1 2 1.0000000 1.00000 0.00% 7.2 0s Cutting planes: Gomory: 5 MIR: 12 Explored 5 nodes (285 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 7: 1 2 12 ... 90 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter ScaleFlag to 2 Prev: 1 Min: 0 Max: 2 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter ScaleFlag to 2 Prev: 1 Min: 0 Max: 2 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter ScaleFlag to 2 Prev: 1 Min: 0 Max: 2 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 326 rows and 188 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 326 rows and 188 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Presolve removed 326 rows and 188 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Computing Irreducible Inconsistent Subsystem (IIS)... Constraints Bounds Runtime Min Max Min Max ------------------------------------------------ 0 338 0 132 0s 16 16 10 10 0s IIS computed: 16 constraints, 10 bounds IIS runtime: 0.16 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 326 rows and 188 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 124 rows and 198 columns Presolve time: 0.00s Presolved: 214 rows, 375 columns, 1596 nonzeros Found heuristic solution: objective 75.0000000 Variable types: 0 continuous, 375 integer (56 binary) Root relaxation: objective 0.000000e+00, 53 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 8 75.00000 0.00000 100% - 0s H 0 0 23.0000000 0.00000 100% - 0s H 0 0 22.0000000 0.00000 100% - 0s 0 0 0.00000 0 26 22.00000 0.00000 100% - 0s H 0 0 19.0000000 0.00000 100% - 0s H 0 0 15.0000000 0.00000 100% - 0s 0 0 0.00000 0 27 15.00000 0.00000 100% - 0s 0 0 0.00000 0 9 15.00000 0.00000 100% - 0s H 0 0 2.0000000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 0 0.00000 0 7 2.00000 0.00000 100% - 0s H 0 0 1.0000000 0.00000 100% - 0s Cutting planes: Gomory: 4 MIR: 11 StrongCG: 1 Mod-K: 1 Network: 1 Explored 0 nodes (210 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 8: 1 2 15 ... 76 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 326 rows and 188 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 124 rows and 198 columns Presolve time: 0.00s Presolved: 214 rows, 375 columns, 1596 nonzeros Found heuristic solution: objective 75.0000000 Variable types: 0 continuous, 375 integer (56 binary) Root relaxation: objective 0.000000e+00, 53 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 8 75.00000 0.00000 100% - 0s H 0 0 23.0000000 0.00000 100% - 0s H 0 0 22.0000000 0.00000 100% - 0s 0 0 0.00000 0 26 22.00000 0.00000 100% - 0s H 0 0 19.0000000 0.00000 100% - 0s H 0 0 15.0000000 0.00000 100% - 0s 0 0 0.00000 0 27 15.00000 0.00000 100% - 0s 0 0 0.00000 0 9 15.00000 0.00000 100% - 0s H 0 0 2.0000000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 0 0.00000 0 7 2.00000 0.00000 100% - 0s H 0 0 1.0000000 0.00000 100% - 0s Cutting planes: Gomory: 4 MIR: 11 StrongCG: 1 Mod-K: 1 Network: 1 Explored 0 nodes (210 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 8: 1 2 15 ... 76 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Found heuristic solution: objective 0 Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 1: 0 Pool objective bound 0 Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0000% IIS runtime: 0.00 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 326 rows and 188 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 0 Model is infeasible or unbounded Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 124 rows and 198 columns Presolve time: 0.00s Presolved: 214 rows, 375 columns, 1596 nonzeros Found heuristic solution: objective 75.0000000 Variable types: 0 continuous, 375 integer (56 binary) Root relaxation: objective 0.000000e+00, 53 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 8 75.00000 0.00000 100% - 0s H 0 0 23.0000000 0.00000 100% - 0s H 0 0 22.0000000 0.00000 100% - 0s 0 0 0.00000 0 26 22.00000 0.00000 100% - 0s H 0 0 19.0000000 0.00000 100% - 0s H 0 0 15.0000000 0.00000 100% - 0s 0 0 0.00000 0 27 15.00000 0.00000 100% - 0s 0 0 0.00000 0 9 15.00000 0.00000 100% - 0s H 0 0 2.0000000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 0 0.00000 0 7 2.00000 0.00000 100% - 0s H 0 0 1.0000000 0.00000 100% - 0s Cutting planes: Gomory: 4 MIR: 11 StrongCG: 1 Mod-K: 1 Network: 1 Explored 0 nodes (210 simplex iterations) in 0.05 seconds Thread count was 4 (of 4 available processors) Solution count 8: 1 2 15 ... 76 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Optimize a model with 338 rows, 573 columns and 1923 nonzeros Variable types: 381 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [1e+00, 1e+00] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Found heuristic solution: objective 90 Presolve removed 100 rows and 31 columns Presolve time: 0.00s Presolved: 238 rows, 542 columns, 1692 nonzeros Variable types: 350 continuous, 192 integer (66 binary) Root relaxation: objective 0.000000e+00, 50 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 10 90.00000 0.00000 100% - 0s H 0 0 31.0000000 0.00000 100% - 0s 0 0 0.00000 0 21 31.00000 0.00000 100% - 0s H 0 0 28.0000000 0.00000 100% - 0s 0 0 0.00000 0 17 28.00000 0.00000 100% - 0s 0 0 0.00000 0 16 28.00000 0.00000 100% - 0s 0 0 0.00000 0 18 28.00000 0.00000 100% - 0s H 0 0 13.0000000 0.00000 100% - 0s 0 0 0.00000 0 22 13.00000 0.00000 100% - 0s 0 0 0.00000 0 6 13.00000 0.00000 100% - 0s H 0 0 12.0000000 0.00000 100% - 0s 0 0 0.00000 0 6 12.00000 0.00000 100% - 0s 0 0 0.00000 0 1 12.00000 0.00000 100% - 0s H 0 0 2.0000000 0.00000 100% - 0s 0 0 0.00000 0 1 2.00000 0.00000 100% - 0s 0 2 0.00000 0 1 2.00000 0.00000 100% - 0s * 4 1 2 1.0000000 1.00000 0.00% 7.2 0s Cutting planes: Gomory: 5 MIR: 12 Explored 5 nodes (285 simplex iterations) in 0.07 seconds Thread count was 4 (of 4 available processors) Solution count 7: 1 2 12 ... 90 Pool objective bound 1 Optimal solution found (tolerance 1.00e-04) Best objective 1.000000000000e+00, best bound 1.000000000000e+00, gap 0.0000% Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Computing Irreducible Inconsistent Subsystem (IIS)... Constraints Bounds Runtime Min Max Min Max ------------------------------------------------ 0 338 0 132 0s 16 16 10 10 0s IIS computed: 16 constraints, 10 bounds IIS runtime: 0.26 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Computing Irreducible Inconsistent Subsystem (IIS)... Constraints Bounds Runtime Min Max Min Max ------------------------------------------------ 0 338 0 132 0s 16 16 10 10 0s IIS computed: 16 constraints, 10 bounds IIS runtime: 0.27 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Computing Irreducible Inconsistent Subsystem (IIS)... Constraints Bounds Runtime Min Max Min Max ------------------------------------------------ 0 338 0 132 0s 16 16 10 10 0s IIS computed: 16 constraints, 10 bounds IIS runtime: 0.26 seconds Parameter UpdateMode unchanged Value: 1 Min: 0 Max: 1 Default: 1 Changed value of parameter DualReductions to 0 Prev: 1 Min: 0 Max: 1 Default: 1 Optimize a model with 338 rows, 198 columns and 1548 nonzeros Variable types: 6 continuous, 192 integer (66 binary) Coefficient statistics: Matrix range [1e+00, 1e+03] Objective range [5e+00, 2e+02] Bounds range [1e+00, 1e+00] RHS range [1e+00, 1e+03] Presolve removed 325 rows and 181 columns Presolve time: 0.00s Explored 0 nodes (0 simplex iterations) in 0.01 seconds Thread count was 1 (of 4 available processors) Solution count 0 Pool objective bound 1e+100 Model is infeasible Best objective -, best bound -, gap - Computing Irreducible Inconsistent Subsystem (IIS)... Constraints Bounds Runtime Min Max Min Max ------------------------------------------------ 0 338 0 132 0s 16 16 10 10 0s IIS computed: 16 constraints, 10 bounds IIS runtime: 0.27 seconds