Permalink
Cannot retrieve contributors at this time
CenterStringLP/output.txt
Go to file| Solving input4.lp | |
| Found incumbent of value 100.000000 after 0.00 sec. (0.02 ticks) | |
| Tried aggregator 1 time. | |
| MIP Presolve eliminated 0 rows and 21 columns. | |
| Reduced MIP has 110 rows, 380 columns, and 1389 nonzeros. | |
| Reduced MIP has 379 binaries, 0 generals, 0 SOSs, and 0 indicators. | |
| Presolve time = 0.00 sec. (0.58 ticks) | |
| Probing fixed 0 vars, tightened 1 bounds. | |
| Probing time = 0.00 sec. (2.10 ticks) | |
| Tried aggregator 1 time. | |
| Reduced MIP has 110 rows, 380 columns, and 1389 nonzeros. | |
| Reduced MIP has 379 binaries, 1 generals, 0 SOSs, and 0 indicators. | |
| Presolve time = 0.00 sec. (0.64 ticks) | |
| Probing time = 0.00 sec. (0.24 ticks) | |
| Clique table members: 100. | |
| MIP emphasis: balance optimality and feasibility. | |
| MIP search method: dynamic search. | |
| Parallel mode: deterministic, using up to 2 threads. | |
| Root relaxation solution time = 0.00 sec. (1.85 ticks) | |
| Nodes Cuts/ | |
| Node Left Objective IInf Best Integer Best Bound ItCnt Gap | |
| * 0+ 0 100.0000 1.0000 143 99.00% | |
| * 0+ 0 87.0000 1.0000 143 98.85% | |
| * 0+ 0 85.0000 1.0000 143 98.82% | |
| 0 0 58.1362 19 85.0000 58.1362 143 31.60% | |
| * 0+ 0 59.0000 58.1362 143 1.46% | |
| 0 0 cutoff 59.0000 58.1362 143 1.46% | |
| Elapsed time = 0.01 sec. (6.47 ticks, tree = 0.00 MB, solutions = 4) | |
| Root node processing (before b&c): | |
| Real time = 0.01 sec. (6.49 ticks) | |
| Parallel b&c, 2 threads: | |
| Real time = 0.00 sec. (0.00 ticks) | |
| Sync time (average) = 0.00 sec. | |
| Wait time (average) = 0.00 sec. | |
| ------------ | |
| Total (root+branch&cut) = 0.01 sec. (6.49 ticks) | |
| Center string is: CGAAGACTATAAATAGCGAGGCCTTAAAGAACTTCCAATGTTCTAGAACCTATGCTTGAGCTGACACTACGGCATCGATTTTCTAATGCTCCGACCCATC | |
| d is 59.0 | |
| ################### | |
| Solving input3.lp | |
| Found incumbent of value 25.000000 after 0.00 sec. (0.01 ticks) | |
| Tried aggregator 2 times. | |
| MIP Presolve eliminated 0 rows and 54 columns. | |
| Aggregator did 7 substitutions. | |
| Reduced MIP has 28 rows, 40 columns, and 229 nonzeros. | |
| Reduced MIP has 39 binaries, 0 generals, 0 SOSs, and 0 indicators. | |
| Presolve time = 0.00 sec. (0.31 ticks) | |
| Probing fixed 0 vars, tightened 1 bounds. | |
| Probing time = 0.00 sec. (0.07 ticks) | |
| Tried aggregator 1 time. | |
| MIP Presolve eliminated 16 rows and 20 columns. | |
| Reduced MIP has 12 rows, 20 columns, and 157 nonzeros. | |
| Reduced MIP has 16 binaries, 4 generals, 0 SOSs, and 0 indicators. | |
| Presolve time = 0.00 sec. (0.11 ticks) | |
| Probing time = 0.00 sec. (0.01 ticks) | |
| Tried aggregator 1 time. | |
| Reduced MIP has 12 rows, 20 columns, and 157 nonzeros. | |
| Reduced MIP has 16 binaries, 4 generals, 0 SOSs, and 0 indicators. | |
| Presolve time = 0.00 sec. (0.06 ticks) | |
| Probing time = 0.00 sec. (0.01 ticks) | |
| Clique table members: 2. | |
| MIP emphasis: balance optimality and feasibility. | |
| MIP search method: dynamic search. | |
| Parallel mode: deterministic, using up to 2 threads. | |
| Root relaxation solution time = 0.00 sec. (0.03 ticks) | |
| Nodes Cuts/ | |
| Node Left Objective IInf Best Integer Best Bound ItCnt Gap | |
| * 0+ 0 25.0000 1.0000 3 96.00% | |
| * 0+ 0 5.0000 1.0000 3 80.00% | |
| * 0 0 integral 0 3.0000 3.0000 3 0.00% | |
| Elapsed time = 0.00 sec. (0.71 ticks, tree = 0.00 MB, solutions = 2) | |
| Root node processing (before b&c): | |
| Real time = 0.00 sec. (0.71 ticks) | |
| Parallel b&c, 2 threads: | |
| Real time = 0.00 sec. (0.00 ticks) | |
| Sync time (average) = 0.00 sec. | |
| Wait time (average) = 0.00 sec. | |
| ------------ | |
| Total (root+branch&cut) = 0.00 sec. (0.71 ticks) | |
| Center string is: CAGAGGTAAAAGAAAGGGGGACAAT | |
| d is 3.0 | |
| ################### | |
| Solving input1.lp | |
| Found incumbent of value 5.000000 after 0.00 sec. (0.00 ticks) | |
| Tried aggregator 1 time. | |
| MIP Presolve eliminated 2 rows and 10 columns. | |
| Reduced MIP has 13 rows, 11 columns, and 58 nonzeros. | |
| Reduced MIP has 10 binaries, 0 generals, 0 SOSs, and 0 indicators. | |
| Presolve time = 0.00 sec. (0.05 ticks) | |
| Probing fixed 0 vars, tightened 1 bounds. | |
| Probing time = 0.00 sec. (0.01 ticks) | |
| Tried aggregator 1 time. | |
| MIP Presolve eliminated 5 rows and 5 columns. | |
| Reduced MIP has 8 rows, 6 columns, and 48 nonzeros. | |
| Reduced MIP has 5 binaries, 1 generals, 0 SOSs, and 0 indicators. | |
| Presolve time = 0.00 sec. (0.02 ticks) | |
| Probing time = 0.00 sec. (0.00 ticks) | |
| Tried aggregator 1 time. | |
| Reduced MIP has 8 rows, 6 columns, and 48 nonzeros. | |
| Reduced MIP has 5 binaries, 1 generals, 0 SOSs, and 0 indicators. | |
| Presolve time = 0.00 sec. (0.02 ticks) | |
| Probing time = 0.00 sec. (0.00 ticks) | |
| MIP emphasis: balance optimality and feasibility. | |
| MIP search method: dynamic search. | |
| Parallel mode: deterministic, using up to 2 threads. | |
| Root relaxation solution time = 0.00 sec. (0.02 ticks) | |
| Nodes Cuts/ | |
| Node Left Objective IInf Best Integer Best Bound ItCnt Gap | |
| * 0+ 0 5.0000 1.0000 6 80.00% | |
| * 0+ 0 4.0000 1.0000 6 75.00% | |
| 0 0 2.5000 2 4.0000 2.5000 6 37.50% | |
| * 0+ 0 3.0000 2.5000 6 16.67% | |
| 0 0 cutoff 3.0000 3.0000 6 0.00% | |
| Elapsed time = 0.00 sec. (0.17 ticks, tree = 0.00 MB, solutions = 3) | |
| Root node processing (before b&c): | |
| Real time = 0.00 sec. (0.17 ticks) | |
| Parallel b&c, 2 threads: | |
| Real time = 0.00 sec. (0.00 ticks) | |
| Sync time (average) = 0.00 sec. | |
| Wait time (average) = 0.00 sec. | |
| ------------ | |
| Total (root+branch&cut) = 0.00 sec. (0.17 ticks) | |
| Center string is: AAACC | |
| d is 3.0 | |
| ################### | |
| Solving input2.lp | |
| Found incumbent of value 10.000000 after 0.00 sec. (0.01 ticks) | |
| Tried aggregator 1 time. | |
| MIP Presolve eliminated 0 rows and 20 columns. | |
| Reduced MIP has 30 rows, 21 columns, and 240 nonzeros. | |
| Reduced MIP has 20 binaries, 0 generals, 0 SOSs, and 0 indicators. | |
| Presolve time = 0.00 sec. (0.17 ticks) | |
| Probing fixed 0 vars, tightened 1 bounds. | |
| Probing time = 0.00 sec. (0.05 ticks) | |
| Tried aggregator 1 time. | |
| MIP Presolve eliminated 10 rows and 10 columns. | |
| Reduced MIP has 20 rows, 11 columns, and 220 nonzeros. | |
| Reduced MIP has 10 binaries, 1 generals, 0 SOSs, and 0 indicators. | |
| Presolve time = 0.00 sec. (0.09 ticks) | |
| Probing time = 0.00 sec. (0.01 ticks) | |
| Tried aggregator 1 time. | |
| Reduced MIP has 20 rows, 11 columns, and 220 nonzeros. | |
| Reduced MIP has 10 binaries, 1 generals, 0 SOSs, and 0 indicators. | |
| Presolve time = 0.00 sec. (0.08 ticks) | |
| Probing time = 0.00 sec. (0.01 ticks) | |
| MIP emphasis: balance optimality and feasibility. | |
| MIP search method: dynamic search. | |
| Parallel mode: deterministic, using up to 2 threads. | |
| Root relaxation solution time = 0.00 sec. (0.06 ticks) | |
| Nodes Cuts/ | |
| Node Left Objective IInf Best Integer Best Bound ItCnt Gap | |
| * 0+ 0 10.0000 1.0000 12 90.00% | |
| * 0+ 0 6.0000 1.0000 12 83.33% | |
| 0 0 5.0000 2 6.0000 5.0000 12 16.67% | |
| 0 0 cutoff 6.0000 13 0.00% | |
| Elapsed time = 0.00 sec. (0.71 ticks, tree = 0.00 MB, solutions = 2) | |
| Gomory fractional cuts applied: 1 | |
| Root node processing (before b&c): | |
| Real time = 0.00 sec. (0.71 ticks) | |
| Parallel b&c, 2 threads: | |
| Real time = 0.00 sec. (0.00 ticks) | |
| Sync time (average) = 0.00 sec. | |
| Wait time (average) = 0.00 sec. | |
| ------------ | |
| Total (root+branch&cut) = 0.00 sec. (0.71 ticks) | |
| Center string is: ACAAACCCCC | |
| d is 6.0 | |
| ################### |