Found operating system: Windows Vista on architecture amd64. Running StreetsPreprocessorTask Task is sinking 95 ways. Task finished in 0.246000 s. Nodes: 301 Edges: 350 Nodes are OK. Number of unfiltered nodes: 301 Number of unfiltered edges: 700 Targets initialised: [V228, V252] Sources initialised: [V280, V51] Nodes of degree 2 found: 172 ====Graph conversion started!===== Original # of nodes: 129 Original # of edges: 350 Converted # of nodes: 129 Converted # of edges: 350 GLPK Simplex Optimizer, v4.44 1 row, 352 columns, 352 non-zeros Preprocessing... 1 row, 350 columns, 350 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 1 0: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 1: obj = 0.000000000e+000 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 1 row, 352 columns, 352 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 1: mip = not found yet <= +inf (1; 0) + 1: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 1: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 130 rows, 352 columns, 700 non-zeros Preprocessing... 130 rows, 348 columns, 696 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 106 0: obj = 0.000000000e+000 infeas = 1.000e+000 (24) * 9: obj = 0.000000000e+000 infeas = 0.000e+000 (19) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 130 rows, 352 columns, 700 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 9: mip = not found yet <= +inf (1; 0) + 18: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 18: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 130 rows, 352 columns, 701 non-zeros Preprocessing... 130 rows, 349 columns, 698 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 106 0: obj = 0.000000000e+000 infeas = 1.000e+000 (24) * 9: obj = 0.000000000e+000 infeas = 0.000e+000 (20) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 130 rows, 352 columns, 701 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 9: mip = not found yet <= +inf (1; 0) + 16: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 16: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 2 rows, 2 columns, 3 non-zeros Preprocessing... ~ 0: obj = -1.000000000e+002 infeas = 0.000e+000 OPTIMAL SOLUTION FOUND BY LP PREPROCESSOR 1 GLPK Simplex Optimizer, v4.44 2 rows, 353 columns, 367 non-zeros Preprocessing... 2 rows, 351 columns, 364 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 2 1: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 2: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 4: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 2 rows, 353 columns, 367 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 4: mip = not found yet <= +inf (1; 0) + 4: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 4: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 482 rows, 353 columns, 700 non-zeros Preprocessing... 130 rows, 348 columns, 696 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 106 18: obj = 0.000000000e+000 infeas = 1.000e+000 (24) * 27: obj = 0.000000000e+000 infeas = 0.000e+000 (19) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 482 rows, 353 columns, 700 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 27: mip = not found yet <= +inf (1; 0) + 36: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 36: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 482 rows, 353 columns, 701 non-zeros Preprocessing... 130 rows, 349 columns, 698 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 106 16: obj = 0.000000000e+000 infeas = 1.000e+000 (24) * 25: obj = 0.000000000e+000 infeas = 0.000e+000 (20) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 482 rows, 353 columns, 701 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 25: mip = not found yet <= +inf (1; 0) + 32: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 32: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 2 rows, 3 columns, 4 non-zeros Preprocessing... ~ 0: obj = -0.000000000e+000 infeas = 0.000e+000 OPTIMAL SOLUTION FOUND BY LP PREPROCESSOR 2 GLPK Simplex Optimizer, v4.44 2 rows, 353 columns, 367 non-zeros Preprocessing... 2 rows, 351 columns, 364 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 2 4: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 5: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 7: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 2 rows, 353 columns, 367 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 7: mip = not found yet <= +inf (1; 0) + 7: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 7: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 834 rows, 354 columns, 702 non-zeros Preprocessing... 130 rows, 348 columns, 696 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 106 36: obj = 0.000000000e+000 infeas = 1.000e+000 (24) * 45: obj = 0.000000000e+000 infeas = 0.000e+000 (19) * 46: obj = 0.000000000e+000 infeas = 0.000e+000 (19) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 834 rows, 354 columns, 702 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 46: mip = not found yet <= +inf (1; 0) + 53: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 53: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 834 rows, 354 columns, 703 non-zeros Preprocessing... 130 rows, 349 columns, 698 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 106 32: obj = 0.000000000e+000 infeas = 1.000e+000 (24) * 41: obj = 0.000000000e+000 infeas = 0.000e+000 (20) * 42: obj = 0.000000000e+000 infeas = 0.000e+000 (20) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 834 rows, 354 columns, 703 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 42: mip = not found yet <= +inf (1; 0) + 47: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 47: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 3 rows, 3 columns, 7 non-zeros Preprocessing... 3 rows, 3 columns, 7 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 3 0: obj = 0.000000000e+000 infeas = 4.635e+000 (0) * 1: obj = -1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 3 GLPK Simplex Optimizer, v4.44 3 rows, 354 columns, 381 non-zeros Preprocessing... 3 rows, 352 columns, 377 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 3 7: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 8: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 10: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 3 rows, 354 columns, 381 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 10: mip = not found yet <= +inf (1; 0) + 10: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 10: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 834 rows, 354 columns, 702 non-zeros Preprocessing... 130 rows, 348 columns, 696 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 106 53: obj = 0.000000000e+000 infeas = 1.000e+000 (24) * 62: obj = 0.000000000e+000 infeas = 0.000e+000 (19) * 63: obj = 0.000000000e+000 infeas = 0.000e+000 (19) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 834 rows, 354 columns, 702 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 63: mip = not found yet <= +inf (1; 0) + 70: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 70: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 834 rows, 354 columns, 703 non-zeros Preprocessing... 130 rows, 349 columns, 698 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 106 47: obj = 0.000000000e+000 infeas = 1.000e+000 (24) * 56: obj = 0.000000000e+000 infeas = 0.000e+000 (20) * 57: obj = 0.000000000e+000 infeas = 0.000e+000 (20) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 834 rows, 354 columns, 703 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 57: mip = not found yet <= +inf (1; 0) + 62: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 62: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 3 rows, 4 columns, 9 non-zeros Preprocessing... 3 rows, 4 columns, 9 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 3 1: obj = 0.000000000e+000 infeas = 4.635e+000 (0) * 2: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 3: obj = -5.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 4 GLPK Simplex Optimizer, v4.44 3 rows, 354 columns, 381 non-zeros Preprocessing... 3 rows, 352 columns, 377 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 3 10: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 11: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 14: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 3 rows, 354 columns, 381 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 14: mip = not found yet <= +inf (1; 0) + 14: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 14: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 1186 rows, 355 columns, 704 non-zeros Preprocessing... 130 rows, 348 columns, 696 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 106 70: obj = 0.000000000e+000 infeas = 1.000e+000 (24) * 79: obj = 0.000000000e+000 infeas = 0.000e+000 (19) * 80: obj = 0.000000000e+000 infeas = 0.000e+000 (19) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 1186 rows, 355 columns, 704 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 80: mip = not found yet <= +inf (1; 0) + 87: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 87: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 1186 rows, 355 columns, 705 non-zeros Preprocessing... 130 rows, 349 columns, 698 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 106 62: obj = 0.000000000e+000 infeas = 1.000e+000 (24) * 71: obj = 0.000000000e+000 infeas = 0.000e+000 (20) * 72: obj = 0.000000000e+000 infeas = 0.000e+000 (20) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 1186 rows, 355 columns, 705 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 72: mip = not found yet <= +inf (1; 0) + 77: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 77: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 4 rows, 5 columns, 14 non-zeros Preprocessing... 4 rows, 4 columns, 13 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 4 * 3: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 4: obj = 0.000000000e+000 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 5 GLPK Simplex Optimizer, v4.44 4 rows, 355 columns, 395 non-zeros Preprocessing... 4 rows, 353 columns, 390 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 4 14: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 15: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 17: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 4 rows, 355 columns, 395 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 17: mip = not found yet <= +inf (1; 0) + 17: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 17: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 1538 rows, 356 columns, 706 non-zeros Preprocessing... 130 rows, 348 columns, 696 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 107 87: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 96: obj = 0.000000000e+000 infeas = 0.000e+000 (19) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 1538 rows, 356 columns, 706 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 96: mip = not found yet <= +inf (1; 0) + 102: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 102: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 1538 rows, 356 columns, 707 non-zeros Preprocessing... 130 rows, 349 columns, 698 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 107 77: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 86: obj = 0.000000000e+000 infeas = 0.000e+000 (20) * 87: obj = 0.000000000e+000 infeas = 0.000e+000 (20) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 1538 rows, 356 columns, 707 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 87: mip = not found yet <= +inf (1; 0) + 93: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 93: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 5 rows, 6 columns, 22 non-zeros Preprocessing... 5 rows, 6 columns, 22 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 5 4: obj = 0.000000000e+000 infeas = 4.635e+000 (0) * 5: obj = -1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 6 GLPK Simplex Optimizer, v4.44 5 rows, 356 columns, 407 non-zeros Preprocessing... 5 rows, 354 columns, 401 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 5 17: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 18: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 20: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 5 rows, 356 columns, 407 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 20: mip = not found yet <= +inf (1; 0) + 20: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 20: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 1890 rows, 357 columns, 708 non-zeros Preprocessing... 130 rows, 348 columns, 696 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 107 102: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 110: obj = 0.000000000e+000 infeas = 0.000e+000 (19) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 1890 rows, 357 columns, 708 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 110: mip = not found yet <= +inf (1; 0) + 117: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 117: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 1890 rows, 357 columns, 709 non-zeros Preprocessing... 130 rows, 349 columns, 698 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 107 93: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 101: obj = 0.000000000e+000 infeas = 0.000e+000 (20) * 113: obj = 0.000000000e+000 infeas = 0.000e+000 (11) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 1890 rows, 357 columns, 709 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 113: mip = not found yet <= +inf (1; 0) + 118: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 118: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 5 rows, 7 columns, 26 non-zeros Preprocessing... 5 rows, 7 columns, 26 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 5 5: obj = 0.000000000e+000 infeas = 4.635e+000 (0) * 6: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 7: obj = -5.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 7 GLPK Simplex Optimizer, v4.44 5 rows, 356 columns, 407 non-zeros Preprocessing... 5 rows, 354 columns, 401 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 5 20: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 21: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 25: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 5 rows, 356 columns, 407 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 25: mip = not found yet <= +inf (1; 0) + 26: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 26: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 2242 rows, 358 columns, 710 non-zeros Preprocessing... 130 rows, 348 columns, 696 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 107 117: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 124: obj = 0.000000000e+000 infeas = 0.000e+000 (19) * 128: obj = 0.000000000e+000 infeas = 0.000e+000 (19) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 2242 rows, 358 columns, 710 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 128: mip = not found yet <= +inf (1; 0) + 140: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 140: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 2242 rows, 358 columns, 711 non-zeros Preprocessing... 130 rows, 349 columns, 698 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 107 118: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 126: obj = 0.000000000e+000 infeas = 0.000e+000 (20) * 139: obj = 0.000000000e+000 infeas = 0.000e+000 (11) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 2242 rows, 358 columns, 711 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 139: mip = not found yet <= +inf (1; 0) + 142: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 142: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 6 rows, 8 columns, 33 non-zeros Preprocessing... 6 rows, 7 columns, 32 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 6 * 7: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 8: obj = 0.000000000e+000 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 8 GLPK Simplex Optimizer, v4.44 6 rows, 357 columns, 422 non-zeros Preprocessing... 6 rows, 355 columns, 415 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 6 26: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 27: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 29: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 6 rows, 357 columns, 422 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 29: mip = not found yet <= +inf (1; 0) + 29: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 29: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 2594 rows, 359 columns, 712 non-zeros Preprocessing... 130 rows, 348 columns, 696 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 107 140: obj = -1.000000000e+000 infeas = 1.000e+000 (23) * 147: obj = -1.000000000e+000 infeas = 0.000e+000 (19) * 160: obj = 0.000000000e+000 infeas = 0.000e+000 (14) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 2594 rows, 359 columns, 712 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 160: mip = not found yet <= +inf (1; 0) + 171: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 171: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 2594 rows, 359 columns, 713 non-zeros Preprocessing... 130 rows, 349 columns, 698 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 107 142: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 150: obj = 0.000000000e+000 infeas = 0.000e+000 (20) * 151: obj = 0.000000000e+000 infeas = 0.000e+000 (20) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 2594 rows, 359 columns, 713 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 151: mip = not found yet <= +inf (1; 0) + 158: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 158: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 7 rows, 9 columns, 45 non-zeros Preprocessing... 7 rows, 9 columns, 45 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 7 8: obj = 0.000000000e+000 infeas = 4.635e+000 (0) * 9: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 10: obj = -5.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 9 GLPK Simplex Optimizer, v4.44 7 rows, 358 columns, 441 non-zeros Preprocessing... 7 rows, 356 columns, 433 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 7 29: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 30: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 33: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 7 rows, 358 columns, 441 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 33: mip = not found yet <= +inf (1; 0) + 33: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 33: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 2946 rows, 360 columns, 714 non-zeros Preprocessing... 130 rows, 348 columns, 696 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 107 171: obj = -5.000000000e-001 infeas = 1.000e+000 (23) * 179: obj = -5.000000000e-001 infeas = 0.000e+000 (18) * 198: obj = 0.000000000e+000 infeas = 0.000e+000 (9) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 2946 rows, 360 columns, 714 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 198: mip = not found yet <= +inf (1; 0) + 204: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 204: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 2946 rows, 360 columns, 715 non-zeros Preprocessing... 130 rows, 349 columns, 698 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 107 158: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 168: obj = 0.000000000e+000 infeas = 0.000e+000 (19) * 170: obj = 0.000000000e+000 infeas = 0.000e+000 (19) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 2946 rows, 360 columns, 715 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 170: mip = not found yet <= +inf (1; 0) + 180: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 180: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 8 rows, 10 columns, 54 non-zeros Preprocessing... 8 rows, 9 columns, 53 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 8 * 10: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 11: obj = 0.000000000e+000 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 10 GLPK Simplex Optimizer, v4.44 8 rows, 359 columns, 458 non-zeros Preprocessing... 8 rows, 357 columns, 449 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 8 33: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 34: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 36: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 8 rows, 359 columns, 458 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 36: mip = not found yet <= +inf (1; 0) + 36: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 36: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 3298 rows, 361 columns, 716 non-zeros Preprocessing... 130 rows, 348 columns, 696 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 107 204: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 212: obj = -1.000000000e+000 infeas = 0.000e+000 (18) * 223: obj = 0.000000000e+000 infeas = 0.000e+000 (11) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 3298 rows, 361 columns, 716 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 223: mip = not found yet <= +inf (1; 0) + 235: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 235: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 3298 rows, 361 columns, 717 non-zeros Preprocessing... 130 rows, 349 columns, 698 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 107 180: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 190: obj = 0.000000000e+000 infeas = 0.000e+000 (19) * 191: obj = 0.000000000e+000 infeas = 0.000e+000 (19) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 3298 rows, 361 columns, 717 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 191: mip = not found yet <= +inf (1; 0) + 198: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 198: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 9 rows, 11 columns, 69 non-zeros Preprocessing... 9 rows, 11 columns, 69 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 9 11: obj = 0.000000000e+000 infeas = 4.635e+000 (0) * 12: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 14: obj = -5.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 11 GLPK Simplex Optimizer, v4.44 9 rows, 360 columns, 470 non-zeros Preprocessing... 9 rows, 358 columns, 460 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 9 36: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 37: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 41: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 9 rows, 360 columns, 470 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 41: mip = not found yet <= +inf (1; 0) + 42: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 42: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 3650 rows, 362 columns, 718 non-zeros Preprocessing... 130 rows, 348 columns, 696 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 107 235: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 243: obj = -5.000000000e-001 infeas = 0.000e+000 (18) * 262: obj = 0.000000000e+000 infeas = 0.000e+000 (5) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 3650 rows, 362 columns, 718 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 262: mip = not found yet <= +inf (1; 0) + 276: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 276: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 3650 rows, 362 columns, 719 non-zeros Preprocessing... 130 rows, 349 columns, 698 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 107 198: obj = 0.000000000e+000 infeas = 1.000e+000 (23) 200: obj = 0.000000000e+000 infeas = 1.000e+000 (22) * 208: obj = 0.000000000e+000 infeas = 0.000e+000 (19) * 210: obj = 0.000000000e+000 infeas = 0.000e+000 (19) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 3650 rows, 362 columns, 719 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 210: mip = not found yet <= +inf (1; 0) + 217: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 217: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 10 rows, 12 columns, 83 non-zeros Preprocessing... 10 rows, 12 columns, 83 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 10 14: obj = 0.000000000e+000 infeas = 9.269e+000 (0) * 15: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 18: obj = -5.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 12 GLPK Simplex Optimizer, v4.44 10 rows, 361 columns, 495 non-zeros Preprocessing... 10 rows, 359 columns, 484 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 10 42: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 43: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 46: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 10 rows, 361 columns, 495 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 46: mip = not found yet <= +inf (1; 0) + 46: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 46: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 4002 rows, 363 columns, 722 non-zeros Preprocessing... 132 rows, 349 columns, 700 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 109 276: obj = -5.000000000e-001 infeas = 1.000e+000 (23) * 284: obj = -1.000000000e+000 infeas = 0.000e+000 (18) * 309: obj = 0.000000000e+000 infeas = 0.000e+000 (5) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 4002 rows, 363 columns, 722 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 309: mip = not found yet <= +inf (1; 0) + 317: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 317: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 4002 rows, 363 columns, 723 non-zeros Preprocessing... 132 rows, 350 columns, 702 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 109 217: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 226: obj = 0.000000000e+000 infeas = 0.000e+000 (19) * 230: obj = 0.000000000e+000 infeas = 0.000e+000 (17) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 4002 rows, 363 columns, 723 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 230: mip = not found yet <= +inf (1; 0) + 234: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 234: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 11 rows, 13 columns, 101 non-zeros Preprocessing... 11 rows, 13 columns, 101 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 11 18: obj = 0.000000000e+000 infeas = 1.390e+001 (0) * 19: obj = -1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 13 GLPK Simplex Optimizer, v4.44 11 rows, 362 columns, 511 non-zeros Preprocessing... 11 rows, 360 columns, 499 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 11 46: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 47: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 49: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 11 rows, 362 columns, 511 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 49: mip = not found yet <= +inf (1; 0) + 49: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 49: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 4354 rows, 364 columns, 724 non-zeros Preprocessing... 132 rows, 349 columns, 700 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 108 317: obj = 0.000000000e+000 infeas = 1.000e+000 (24) * 324: obj = -1.000000000e+000 infeas = 0.000e+000 (19) * 336: obj = 0.000000000e+000 infeas = 0.000e+000 (11) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 4354 rows, 364 columns, 724 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 336: mip = not found yet <= +inf (1; 0) + 338: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 338: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 4354 rows, 364 columns, 725 non-zeros Preprocessing... 132 rows, 350 columns, 702 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 109 234: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 243: obj = 0.000000000e+000 infeas = 0.000e+000 (19) * 244: obj = 0.000000000e+000 infeas = 0.000e+000 (19) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 4354 rows, 364 columns, 725 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 244: mip = not found yet <= +inf (1; 0) + 248: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 248: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 12 rows, 14 columns, 124 non-zeros Preprocessing... 12 rows, 14 columns, 124 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 12 19: obj = 0.000000000e+000 infeas = 1.390e+001 (0) * 20: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 25: obj = -6.666666667e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 14 GLPK Simplex Optimizer, v4.44 12 rows, 363 columns, 522 non-zeros Preprocessing... 12 rows, 361 columns, 509 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 12 49: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 50: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 58: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 12 rows, 363 columns, 522 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 58: mip = not found yet <= +inf (1; 0) + 58: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 58: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 4706 rows, 365 columns, 726 non-zeros Preprocessing... 132 rows, 349 columns, 700 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 108 338: obj = -3.333333333e-001 infeas = 1.000e+000 (24) * 354: obj = -6.666666667e-001 infeas = 0.000e+000 (13) * 373: obj = 0.000000000e+000 infeas = 0.000e+000 (6) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 4706 rows, 365 columns, 726 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 373: mip = not found yet <= +inf (1; 0) + 377: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 377: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 4706 rows, 365 columns, 727 non-zeros Preprocessing... 132 rows, 350 columns, 702 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 110 248: obj = 0.000000000e+000 infeas = 1.000e+000 (22) * 257: obj = 0.000000000e+000 infeas = 0.000e+000 (19) * 274: obj = 0.000000000e+000 infeas = 0.000e+000 (8) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 4706 rows, 365 columns, 727 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 274: mip = not found yet <= +inf (1; 0) + 278: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 278: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 13 rows, 15 columns, 140 non-zeros Preprocessing... 13 rows, 15 columns, 140 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 13 25: obj = 0.000000000e+000 infeas = 4.635e+000 (0) * 26: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 30: obj = -5.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 15 GLPK Simplex Optimizer, v4.44 13 rows, 364 columns, 540 non-zeros Preprocessing... 13 rows, 362 columns, 526 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 13 58: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 59: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 64: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 13 rows, 364 columns, 540 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 64: mip = not found yet <= +inf (1; 0) + 64: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 64: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 5058 rows, 366 columns, 730 non-zeros Preprocessing... 134 rows, 350 columns, 704 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 110 377: obj = 0.000000000e+000 infeas = 1.000e+000 (24) 400: obj = 0.000000000e+000 infeas = 1.000e+000 (10) * 402: obj = 0.000000000e+000 infeas = 0.000e+000 (10) * 403: obj = 0.000000000e+000 infeas = 0.000e+000 (10) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 5058 rows, 366 columns, 730 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 403: mip = not found yet <= +inf (1; 0) + 406: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 406: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 5058 rows, 366 columns, 731 non-zeros Preprocessing... 134 rows, 351 columns, 706 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 112 278: obj = 0.000000000e+000 infeas = 1.000e+000 (22) * 291: obj = -5.000000000e-001 infeas = 0.000e+000 (19) * 295: obj = 0.000000000e+000 infeas = 0.000e+000 (18) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 5058 rows, 366 columns, 731 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 295: mip = not found yet <= +inf (1; 0) + 296: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 296: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 14 rows, 16 columns, 162 non-zeros Preprocessing... 14 rows, 16 columns, 162 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 14 30: obj = 0.000000000e+000 infeas = 9.269e+000 (0) * 31: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 34: obj = -5.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 16 GLPK Simplex Optimizer, v4.44 14 rows, 365 columns, 553 non-zeros Preprocessing... 14 rows, 363 columns, 538 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 14 64: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 65: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 69: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 14 rows, 365 columns, 553 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 69: mip = not found yet <= +inf (1; 0) + 69: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 69: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 5410 rows, 367 columns, 736 non-zeros Preprocessing... 137 rows, 351 columns, 710 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 113 406: obj = -5.000000000e-001 infeas = 1.000e+000 (24) * 423: obj = -5.000000000e-001 infeas = 0.000e+000 (16) * 441: obj = 0.000000000e+000 infeas = 0.000e+000 (8) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 5410 rows, 367 columns, 736 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 441: mip = not found yet <= +inf (1; 0) + 451: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 451: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 5410 rows, 367 columns, 737 non-zeros Preprocessing... 137 rows, 352 columns, 712 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 114 296: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 310: obj = 0.000000000e+000 infeas = 0.000e+000 (20) * 311: obj = 0.000000000e+000 infeas = 0.000e+000 (20) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 5410 rows, 367 columns, 737 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 311: mip = not found yet <= +inf (1; 0) + 312: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 312: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 15 rows, 17 columns, 186 non-zeros Preprocessing... 15 rows, 17 columns, 186 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 15 34: obj = 0.000000000e+000 infeas = 1.390e+001 (0) * 35: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 38: obj = -5.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 17 GLPK Simplex Optimizer, v4.44 15 rows, 366 columns, 566 non-zeros Preprocessing... 15 rows, 364 columns, 550 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 15 69: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 70: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 79: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 15 rows, 366 columns, 566 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 79: mip = not found yet <= +inf (1; 0) + 79: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 79: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 5762 rows, 368 columns, 740 non-zeros Preprocessing... 139 rows, 352 columns, 714 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 115 451: obj = 0.000000000e+000 infeas = 1.000e+000 (24) * 468: obj = -5.000000000e-001 infeas = 0.000e+000 (16) * 485: obj = 0.000000000e+000 infeas = 0.000e+000 (8) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 5762 rows, 368 columns, 740 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 485: mip = not found yet <= +inf (1; 0) + 501: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 501: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 5762 rows, 368 columns, 741 non-zeros Preprocessing... 139 rows, 353 columns, 716 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 116 312: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 330: obj = 0.000000000e+000 infeas = 0.000e+000 (17) * 331: obj = 0.000000000e+000 infeas = 0.000e+000 (17) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 5762 rows, 368 columns, 741 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 331: mip = not found yet <= +inf (1; 0) + 333: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 333: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 16 rows, 18 columns, 207 non-zeros Preprocessing... 16 rows, 18 columns, 207 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 16 38: obj = 0.000000000e+000 infeas = 1.854e+001 (0) * 39: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 44: obj = -6.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 18 GLPK Simplex Optimizer, v4.44 16 rows, 367 columns, 586 non-zeros Preprocessing... 16 rows, 365 columns, 569 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 16 79: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 80: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 85: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 16 rows, 367 columns, 586 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 85: mip = not found yet <= +inf (1; 0) + 87: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (2; 0) + 87: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 3) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 6114 rows, 369 columns, 746 non-zeros Preprocessing... 142 rows, 353 columns, 720 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 118 501: obj = -2.000000000e-001 infeas = 1.000e+000 (24) * 518: obj = -4.000000000e-001 infeas = 0.000e+000 (16) * 537: obj = 0.000000000e+000 infeas = 0.000e+000 (9) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 6114 rows, 369 columns, 746 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 537: mip = not found yet <= +inf (1; 0) + 548: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 548: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 6114 rows, 369 columns, 747 non-zeros Preprocessing... 142 rows, 354 columns, 722 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 119 333: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 351: obj = 0.000000000e+000 infeas = 0.000e+000 (17) * 356: obj = 0.000000000e+000 infeas = 0.000e+000 (14) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 6114 rows, 369 columns, 747 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 356: mip = not found yet <= +inf (1; 0) + 359: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 359: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 17 rows, 19 columns, 230 non-zeros Preprocessing... 17 rows, 19 columns, 230 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 17 44: obj = 0.000000000e+000 infeas = 2.317e+001 (0) * 45: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 52: obj = -5.000000000e+001 infeas = 1.183e-030 (0) OPTIMAL SOLUTION FOUND 19 GLPK Simplex Optimizer, v4.44 17 rows, 368 columns, 606 non-zeros Preprocessing... 17 rows, 366 columns, 588 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 17 87: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 88: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 94: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 17 rows, 368 columns, 606 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 94: mip = not found yet <= +inf (1; 0) + 94: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 94: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 6466 rows, 370 columns, 752 non-zeros Preprocessing... 145 rows, 354 columns, 726 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 121 548: obj = -2.500000000e-001 infeas = 1.000e+000 (24) * 565: obj = -2.500000000e-001 infeas = 0.000e+000 (16) * 589: obj = 2.127623711e-032 infeas = 0.000e+000 (5) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 6466 rows, 370 columns, 752 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 589: mip = not found yet <= +inf (1; 0) + 605: >>>>> 2.127623711e-032 <= 2.127623711e-032 0.0% (1; 0) + 605: mip = 2.127623711e-032 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 6466 rows, 370 columns, 753 non-zeros Preprocessing... 145 rows, 355 columns, 728 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 122 359: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 377: obj = 0.000000000e+000 infeas = 0.000e+000 (17) * 382: obj = 0.000000000e+000 infeas = 0.000e+000 (14) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 6466 rows, 370 columns, 753 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 382: mip = not found yet <= +inf (1; 0) + 395: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 395: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 18 rows, 20 columns, 249 non-zeros Preprocessing... 18 rows, 20 columns, 249 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 18 52: obj = 0.000000000e+000 infeas = 1.854e+001 (0) * 53: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 59: obj = -5.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 20 GLPK Simplex Optimizer, v4.44 18 rows, 369 columns, 623 non-zeros Preprocessing... 18 rows, 367 columns, 604 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 18 94: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 95: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 103: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 18 rows, 369 columns, 623 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 103: mip = not found yet <= +inf (1; 0) + 112: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (4; 0) + 112: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 7) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 6818 rows, 371 columns, 756 non-zeros Preprocessing... 147 rows, 355 columns, 730 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 123 605: obj = 0.000000000e+000 infeas = 1.000e+000 (24) * 632: obj = -2.500000000e-001 infeas = 0.000e+000 (10) * 652: obj = 0.000000000e+000 infeas = 0.000e+000 (4) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 6818 rows, 371 columns, 756 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 652: mip = not found yet <= +inf (1; 0) + 652: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 652: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 6818 rows, 371 columns, 757 non-zeros Preprocessing... 147 rows, 356 columns, 732 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 124 395: obj = 0.000000000e+000 infeas = 1.000e+000 (23) 400: obj = 0.000000000e+000 infeas = 1.000e+000 (22) * 413: obj = 0.000000000e+000 infeas = 0.000e+000 (17) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 6818 rows, 371 columns, 757 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 413: mip = not found yet <= +inf (1; 0) + 416: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 416: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 19 rows, 21 columns, 274 non-zeros Preprocessing... 19 rows, 21 columns, 274 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 19 59: obj = 0.000000000e+000 infeas = 2.317e+001 (0) * 60: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 62: obj = -5.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 21 GLPK Simplex Optimizer, v4.44 19 rows, 370 columns, 642 non-zeros Preprocessing... 19 rows, 368 columns, 622 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 19 112: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 113: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 118: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 19 rows, 370 columns, 642 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 118: mip = not found yet <= +inf (1; 0) + 118: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 118: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 7170 rows, 372 columns, 762 non-zeros Preprocessing... 150 rows, 356 columns, 736 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 126 652: obj = 0.000000000e+000 infeas = 1.000e+000 (24) * 683: obj = -5.000000000e-001 infeas = 0.000e+000 (10) * 698: obj = 0.000000000e+000 infeas = 0.000e+000 (6) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 7170 rows, 372 columns, 762 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 698: mip = not found yet <= +inf (1; 0) + 702: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 702: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 7170 rows, 372 columns, 763 non-zeros Preprocessing... 150 rows, 357 columns, 738 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 127 416: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 434: obj = 0.000000000e+000 infeas = 0.000e+000 (17) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 7170 rows, 372 columns, 763 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 434: mip = not found yet <= +inf (1; 0) + 437: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 437: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 20 rows, 22 columns, 311 non-zeros Preprocessing... 20 rows, 22 columns, 311 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 20 62: obj = 0.000000000e+000 infeas = 2.781e+001 (0) * 63: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 70: obj = -6.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 22 GLPK Simplex Optimizer, v4.44 20 rows, 371 columns, 654 non-zeros Preprocessing... 20 rows, 369 columns, 633 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 20 118: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 119: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 134: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 20 rows, 371 columns, 654 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 134: mip = not found yet <= +inf (1; 0) + 150: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (2; 0) + 150: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 3) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 7522 rows, 373 columns, 766 non-zeros Preprocessing... 152 rows, 357 columns, 740 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 128 702: obj = -2.000000000e-001 infeas = 1.000e+000 (24) * 733: obj = -5.000000000e-001 infeas = 0.000e+000 (10) * 758: obj = 0.000000000e+000 infeas = 0.000e+000 (5) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 7522 rows, 373 columns, 766 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 758: mip = not found yet <= +inf (1; 0) + 769: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 769: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 7522 rows, 373 columns, 767 non-zeros Preprocessing... 152 rows, 358 columns, 742 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 129 437: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 455: obj = 0.000000000e+000 infeas = 0.000e+000 (17) * 456: obj = 0.000000000e+000 infeas = 0.000e+000 (17) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 7522 rows, 373 columns, 767 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 456: mip = not found yet <= +inf (1; 0) + 459: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 459: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 21 rows, 23 columns, 340 non-zeros Preprocessing... 21 rows, 23 columns, 340 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 21 70: obj = 0.000000000e+000 infeas = 3.244e+001 (0) * 71: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 86: obj = -5.000000000e+001 infeas = 3.701e-016 (0) OPTIMAL SOLUTION FOUND 23 GLPK Simplex Optimizer, v4.44 21 rows, 372 columns, 682 non-zeros Preprocessing... 21 rows, 370 columns, 660 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 21 150: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 151: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 168: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 21 rows, 372 columns, 682 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 168: mip = not found yet <= +inf (1; 0) + 202: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 202: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 7874 rows, 374 columns, 770 non-zeros Preprocessing... 154 rows, 358 columns, 744 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 130 769: obj = -5.000000000e-001 infeas = 1.000e+000 (24) 800: obj = -5.000000000e-001 infeas = 1.000e+000 (11) * 803: obj = -7.500000000e-001 infeas = 0.000e+000 (10) * 834: obj = -4.065076210e-018 infeas = 0.000e+000 (1) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 7874 rows, 374 columns, 770 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 834: mip = not found yet <= +inf (1; 0) + 847: >>>>> 7.113883367e-018 <= -4.065076210e-018 4.9% (7; 0) + 847: mip = 7.113883367e-018 <= tree is empty 0.0% (0; 13) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 7874 rows, 374 columns, 771 non-zeros Preprocessing... 154 rows, 359 columns, 746 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 131 459: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 485: obj = -1.524403579e-017 infeas = 0.000e+000 (15) * 486: obj = -1.524403579e-017 infeas = 0.000e+000 (15) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 7874 rows, 374 columns, 771 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 486: mip = not found yet <= +inf (1; 0) + 489: >>>>> -1.524403579e-017 <= -1.524403579e-017 0.0% (1; 0) + 489: mip = -1.524403579e-017 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 22 rows, 24 columns, 360 non-zeros Preprocessing... 22 rows, 24 columns, 360 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 22 86: obj = 0.000000000e+000 infeas = 1.390e+001 (0) * 87: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 99: obj = -5.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 24 GLPK Simplex Optimizer, v4.44 22 rows, 373 columns, 704 non-zeros Preprocessing... 22 rows, 371 columns, 681 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 22 202: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 203: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 214: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 22 rows, 373 columns, 704 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 214: mip = not found yet <= +inf (1; 0) + 237: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 237: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 8226 rows, 375 columns, 776 non-zeros Preprocessing... 157 rows, 359 columns, 750 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 133 847: obj = 0.000000000e+000 infeas = 1.000e+000 (24) * 898: obj = -5.000000000e-001 infeas = 0.000e+000 (5) * 918: obj = 0.000000000e+000 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 8226 rows, 375 columns, 776 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 918: mip = not found yet <= +inf (1; 0) + 956: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (11; 0) + 956: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 21) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 8226 rows, 375 columns, 777 non-zeros Preprocessing... 157 rows, 360 columns, 752 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 135 489: obj = 0.000000000e+000 infeas = 1.000e+000 (22) * 515: obj = 0.000000000e+000 infeas = 0.000e+000 (14) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 8226 rows, 375 columns, 777 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 515: mip = not found yet <= +inf (1; 0) + 516: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 516: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 23 rows, 25 columns, 382 non-zeros Preprocessing... 23 rows, 25 columns, 382 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 23 99: obj = 0.000000000e+000 infeas = 1.854e+001 (0) * 100: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 110: obj = -4.444444444e+001 infeas = 2.220e-016 (0) OPTIMAL SOLUTION FOUND 25 GLPK Simplex Optimizer, v4.44 23 rows, 374 columns, 733 non-zeros Preprocessing... 23 rows, 372 columns, 709 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 23 237: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 238: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 251: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 23 rows, 374 columns, 733 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 251: mip = not found yet <= +inf (1; 0) + 256: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (2; 0) + 256: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 3) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 8578 rows, 376 columns, 782 non-zeros Preprocessing... 160 rows, 360 columns, 756 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 136 956: obj = 0.000000000e+000 infeas = 1.000e+000 (24) 1000: obj = 0.000000000e+000 infeas = 1.000e+000 (5) * 1006: obj = -3.333333333e-001 infeas = 0.000e+000 (5) * 1031: obj = -2.127623711e-032 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 8578 rows, 376 columns, 782 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 1031: mip = not found yet <= +inf (1; 0) + 1032: >>>>> -2.127623711e-032 <= -2.127623711e-032 0.0% (1; 0) + 1032: mip = -2.127623711e-032 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 8578 rows, 376 columns, 783 non-zeros Preprocessing... 160 rows, 361 columns, 758 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 138 516: obj = 0.000000000e+000 infeas = 1.000e+000 (22) * 542: obj = -2.127623711e-032 infeas = 0.000e+000 (14) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 8578 rows, 376 columns, 783 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 542: mip = not found yet <= +inf (1; 0) + 545: >>>>> -2.127623711e-032 <= -2.127623711e-032 0.0% (1; 0) + 545: mip = -2.127623711e-032 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 24 rows, 26 columns, 418 non-zeros Preprocessing... 24 rows, 26 columns, 418 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 24 110: obj = 0.000000000e+000 infeas = 2.317e+001 (0) * 111: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 120: obj = -5.000000000e+001 infeas = 9.499e-016 (0) OPTIMAL SOLUTION FOUND 26 GLPK Simplex Optimizer, v4.44 24 rows, 375 columns, 756 non-zeros Preprocessing... 24 rows, 373 columns, 731 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 24 256: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 257: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 263: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 24 rows, 375 columns, 756 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 263: mip = not found yet <= +inf (1; 0) + 277: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 277: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 8930 rows, 377 columns, 788 non-zeros Preprocessing... 163 rows, 361 columns, 762 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 140 1032: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 1090: obj = -5.000000000e-001 infeas = 0.000e+000 (2) * 1106: obj = -6.920308310e-017 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 8930 rows, 377 columns, 788 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 1106: mip = not found yet <= +inf (1; 0) + 1117: >>>>> 1.330828521e-017 <= 1.330828521e-017 0.0% (1; 0) + 1117: mip = 1.330828521e-017 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 8930 rows, 377 columns, 789 non-zeros Preprocessing... 163 rows, 362 columns, 764 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 142 545: obj = 0.000000000e+000 infeas = 1.000e+000 (21) * 571: obj = -2.500000000e-001 infeas = 0.000e+000 (13) * 575: obj = 0.000000000e+000 infeas = 0.000e+000 (12) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 8930 rows, 377 columns, 789 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 575: mip = not found yet <= +inf (1; 0) + 577: >>>>> 1.330828521e-017 <= 1.330828521e-017 0.0% (1; 0) + 577: mip = 1.330828521e-017 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 25 rows, 27 columns, 458 non-zeros Preprocessing... 25 rows, 27 columns, 458 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 25 120: obj = 0.000000000e+000 infeas = 2.781e+001 (0) * 121: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 132: obj = -6.250000000e+001 infeas = 2.958e-031 (0) OPTIMAL SOLUTION FOUND 27 GLPK Simplex Optimizer, v4.44 25 rows, 376 columns, 764 non-zeros Preprocessing... 25 rows, 374 columns, 738 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 25 277: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 278: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 298: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 25 rows, 376 columns, 764 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 298: mip = not found yet <= +inf (1; 0) + 306: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 306: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 9282 rows, 378 columns, 794 non-zeros Preprocessing... 166 rows, 362 columns, 768 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 143 1117: obj = 0.000000000e+000 infeas = 1.000e+000 (23) * 1174: obj = -2.500000000e-001 infeas = 0.000e+000 (2) * 1200: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 1207: obj = 0.000000000e+000 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 9282 rows, 378 columns, 794 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 1207: mip = not found yet <= +inf (1; 0) + 1207: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 1207: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 9282 rows, 378 columns, 795 non-zeros Preprocessing... 166 rows, 364 columns, 771 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 144 577: obj = 0.000000000e+000 infeas = 1.000e+000 (22) 600: obj = 0.000000000e+000 infeas = 1.000e+000 (14) * 603: obj = -1.250000000e-001 infeas = 0.000e+000 (13) * 608: obj = 0.000000000e+000 infeas = 0.000e+000 (12) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 9282 rows, 378 columns, 795 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 608: mip = not found yet <= +inf (1; 0) + 611: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 611: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 26 rows, 28 columns, 488 non-zeros Preprocessing... 26 rows, 28 columns, 488 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 26 132: obj = 0.000000000e+000 infeas = 1.854e+001 (0) * 133: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 134: obj = -5.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 28 GLPK Simplex Optimizer, v4.44 26 rows, 377 columns, 787 non-zeros Preprocessing... 26 rows, 375 columns, 760 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 26 306: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 307: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 312: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 26 rows, 377 columns, 787 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 312: mip = not found yet <= +inf (1; 0) + 312: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 312: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 9634 rows, 379 columns, 800 non-zeros Preprocessing... 169 rows, 363 columns, 774 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 147 1207: obj = 0.000000000e+000 infeas = 1.000e+000 (22) * 1273: obj = -5.000000000e-001 infeas = 0.000e+000 (1) * 1291: obj = 0.000000000e+000 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 9634 rows, 379 columns, 800 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 1291: mip = not found yet <= +inf (1; 0) + 1302: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (7; 0) + 1302: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 13) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 9634 rows, 379 columns, 801 non-zeros Preprocessing... 169 rows, 365 columns, 777 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 148 611: obj = 0.000000000e+000 infeas = 1.000e+000 (21) * 639: obj = 0.000000000e+000 infeas = 0.000e+000 (13) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 9634 rows, 379 columns, 801 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 639: mip = not found yet <= +inf (1; 0) + 644: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 644: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 27 rows, 29 columns, 527 non-zeros Preprocessing... 27 rows, 29 columns, 527 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 27 134: obj = 0.000000000e+000 infeas = 2.317e+001 (0) * 135: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 152: obj = -5.384615385e+001 infeas = 4.441e-016 (0) OPTIMAL SOLUTION FOUND 29 GLPK Simplex Optimizer, v4.44 27 rows, 378 columns, 828 non-zeros Preprocessing... 27 rows, 376 columns, 800 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 27 312: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 313: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 331: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 27 rows, 378 columns, 828 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 331: mip = not found yet <= +inf (1; 0) + 416: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (3; 0) + 416: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 5) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 9986 rows, 380 columns, 806 non-zeros Preprocessing... 172 rows, 364 columns, 780 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 150 1302: obj = 0.000000000e+000 infeas = 2.000e+000 (22) * 1375: obj = -3.333333333e-001 infeas = 0.000e+000 (0) * 1400: obj = -5.712130945e-017 infeas = 1.018e-015 (0) * 1412: obj = -5.190231232e-017 infeas = 2.776e-017 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 9986 rows, 380 columns, 806 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 1412: mip = not found yet <= +inf (1; 0) + 1412: >>>>> -5.190231232e-017 <= -5.190231232e-017 0.0% (1; 0) + 1412: mip = -5.190231232e-017 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 9986 rows, 380 columns, 807 non-zeros Preprocessing... 172 rows, 366 columns, 783 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 151 644: obj = 0.000000000e+000 infeas = 1.000e+000 (21) * 672: obj = 0.000000000e+000 infeas = 0.000e+000 (13) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 9986 rows, 380 columns, 807 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 672: mip = not found yet <= +inf (1; 0) + 682: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 682: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 28 rows, 30 columns, 554 non-zeros Preprocessing... 28 rows, 30 columns, 554 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 28 152: obj = 0.000000000e+000 infeas = 4.635e+000 (0) * 153: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 165: obj = -5.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 30 GLPK Simplex Optimizer, v4.44 28 rows, 379 columns, 847 non-zeros Preprocessing... 28 rows, 377 columns, 818 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 28 416: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 417: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 423: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 28 rows, 379 columns, 847 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 423: mip = not found yet <= +inf (1; 0) + 423: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 423: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 10338 rows, 381 columns, 812 non-zeros Preprocessing... 175 rows, 365 columns, 786 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 153 1412: obj = 0.000000000e+000 infeas = 2.000e+000 (22) * 1486: obj = -3.333333333e-001 infeas = 0.000e+000 (0) * 1494: obj = 0.000000000e+000 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 10338 rows, 381 columns, 812 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 1494: mip = not found yet <= +inf (1; 0) + 1568: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (29; 0) + 1568: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 57) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 10338 rows, 381 columns, 813 non-zeros Preprocessing... 175 rows, 367 columns, 789 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 154 682: obj = 0.000000000e+000 infeas = 1.000e+000 (21) * 710: obj = 0.000000000e+000 infeas = 0.000e+000 (13) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 10338 rows, 381 columns, 813 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 710: mip = not found yet <= +inf (1; 0) + 720: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 720: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 29 rows, 31 columns, 596 non-zeros Preprocessing... 29 rows, 31 columns, 596 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 29 165: obj = 0.000000000e+000 infeas = 9.269e+000 (0) * 166: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 185: obj = -5.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 31 GLPK Simplex Optimizer, v4.44 29 rows, 380 columns, 895 non-zeros Preprocessing... 29 rows, 378 columns, 865 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 29 423: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 424: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 429: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 29 rows, 380 columns, 895 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 429: mip = not found yet <= +inf (1; 0) + 462: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 462: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 10690 rows, 382 columns, 818 non-zeros Preprocessing... 178 rows, 366 columns, 792 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 156 1568: obj = 0.000000000e+000 infeas = 2.000e+000 (22) 1600: obj = 0.000000000e+000 infeas = 1.000e+000 (6) * 1642: obj = -3.333333333e-001 infeas = 0.000e+000 (0) * 1651: obj = 0.000000000e+000 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 10690 rows, 382 columns, 818 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 1651: mip = not found yet <= +inf (1; 0) + 1703: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (11; 0) + 1703: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 21) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 10690 rows, 382 columns, 819 non-zeros Preprocessing... 178 rows, 368 columns, 795 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 157 720: obj = 0.000000000e+000 infeas = 1.000e+000 (21) * 753: obj = 0.000000000e+000 infeas = 0.000e+000 (11) * 754: obj = 0.000000000e+000 infeas = 0.000e+000 (11) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 10690 rows, 382 columns, 819 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 754: mip = not found yet <= +inf (1; 0) + 761: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 761: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 30 rows, 32 columns, 623 non-zeros Preprocessing... 30 rows, 32 columns, 623 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 30 185: obj = 0.000000000e+000 infeas = 9.269e+000 (0) * 186: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 196: obj = -3.333333333e+001 infeas = 5.916e-031 (0) OPTIMAL SOLUTION FOUND 32 GLPK Simplex Optimizer, v4.44 30 rows, 381 columns, 920 non-zeros Preprocessing... 30 rows, 379 columns, 889 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 30 462: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 463: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 469: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 30 rows, 381 columns, 920 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 469: mip = not found yet <= +inf (1; 0) + 512: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 512: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 11042 rows, 383 columns, 824 non-zeros Preprocessing... 181 rows, 367 columns, 798 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 159 1703: obj = 0.000000000e+000 infeas = 3.000e+000 (22) * 1776: obj = -3.333333333e-001 infeas = 0.000e+000 (1) * 1780: obj = -3.333333333e-001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 11042 rows, 383 columns, 824 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 1780: mip = not found yet <= +inf (1; 0) + 1814: >>>>> -3.333333333e-001 <= -3.333333333e-001 0.0% (13; 0) + 1814: mip = -3.333333333e-001 <= tree is empty 0.0% (0; 25) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 11042 rows, 383 columns, 825 non-zeros Preprocessing... 181 rows, 369 columns, 801 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 160 761: obj = 0.000000000e+000 infeas = 2.000e+000 (21) * 792: obj = 0.000000000e+000 infeas = 0.000e+000 (13) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 11042 rows, 383 columns, 825 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 792: mip = not found yet <= +inf (1; 0) + 802: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 802: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 31 rows, 33 columns, 677 non-zeros Preprocessing... 31 rows, 33 columns, 677 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 31 196: obj = 0.000000000e+000 infeas = 1.390e+001 (0) * 197: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 200: obj = -6.666666667e+001 infeas = 0.000e+000 (0) * 205: obj = -5.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 33 GLPK Simplex Optimizer, v4.44 31 rows, 382 columns, 929 non-zeros Preprocessing... 31 rows, 380 columns, 897 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 31 512: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 513: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 527: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 31 rows, 382 columns, 929 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 527: mip = not found yet <= +inf (1; 0) + 541: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 541: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 11394 rows, 384 columns, 830 non-zeros Preprocessing... 184 rows, 368 columns, 804 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 162 1814: obj = 0.000000000e+000 infeas = 3.000e+000 (22) * 1882: obj = -3.750000000e-001 infeas = 0.000e+000 (8) * 1904: obj = 1.850371708e-017 infeas = 1.203e-015 (7) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 11394 rows, 384 columns, 830 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 1904: mip = not found yet <= +inf (1; 0) + 1924: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (11; 0) + 1924: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 21) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 11394 rows, 384 columns, 831 non-zeros Preprocessing... 184 rows, 370 columns, 807 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 163 802: obj = 0.000000000e+000 infeas = 2.000e+000 (21) * 829: obj = -5.000000000e-001 infeas = 0.000e+000 (15) * 843: obj = 0.000000000e+000 infeas = 0.000e+000 (10) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 11394 rows, 384 columns, 831 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 843: mip = not found yet <= +inf (1; 0) + 844: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 844: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 32 rows, 34 columns, 719 non-zeros Preprocessing... 32 rows, 34 columns, 719 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 32 205: obj = 0.000000000e+000 infeas = 1.390e+001 (0) * 206: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 209: obj = -5.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 34 GLPK Simplex Optimizer, v4.44 32 rows, 383 columns, 967 non-zeros Preprocessing... 32 rows, 381 columns, 934 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 32 541: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 542: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 549: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 32 rows, 383 columns, 967 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 549: mip = not found yet <= +inf (1; 0) + 550: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 550: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 11746 rows, 385 columns, 836 non-zeros Preprocessing... 187 rows, 369 columns, 810 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 165 1924: obj = 0.000000000e+000 infeas = 3.000e+000 (22) * 1984: obj = -3.333333333e-001 infeas = 2.776e-016 (7) * 1991: obj = 2.775557562e-017 infeas = 1.110e-015 (5) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 11746 rows, 385 columns, 836 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 1991: mip = not found yet <= +inf (1; 0) + 1991: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 1991: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 11746 rows, 385 columns, 837 non-zeros Preprocessing... 187 rows, 371 columns, 813 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 166 844: obj = 0.000000000e+000 infeas = 2.000e+000 (21) * 876: obj = 0.000000000e+000 infeas = 0.000e+000 (13) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 11746 rows, 385 columns, 837 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 876: mip = not found yet <= +inf (1; 0) + 877: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 877: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 33 rows, 35 columns, 771 non-zeros Preprocessing... 33 rows, 35 columns, 771 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 33 209: obj = 0.000000000e+000 infeas = 1.854e+001 (0) * 210: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 221: obj = -5.714285714e+001 infeas = 2.220e-016 (0) OPTIMAL SOLUTION FOUND 35 GLPK Simplex Optimizer, v4.44 33 rows, 384 columns, 985 non-zeros Preprocessing... 33 rows, 382 columns, 951 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 33 550: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 551: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 562: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 33 rows, 384 columns, 985 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 562: mip = not found yet <= +inf (1; 0) + 932: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (3; 0) + 932: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 5) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 12098 rows, 386 columns, 842 non-zeros Preprocessing... 190 rows, 370 columns, 816 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 168 1991: obj = 0.000000000e+000 infeas = 3.000e+000 (22) 2000: obj = 0.000000000e+000 infeas = 3.000e+000 (14) * 2051: obj = -3.809523810e-001 infeas = 2.776e-016 (7) * 2103: obj = -1.586032892e-017 infeas = 8.743e-016 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 12098 rows, 386 columns, 842 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 2103: mip = not found yet <= +inf (1; 0) + 2106: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 2106: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 12098 rows, 386 columns, 843 non-zeros Preprocessing... 190 rows, 372 columns, 819 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 169 877: obj = 0.000000000e+000 infeas = 2.000e+000 (21) * 917: obj = -2.142857143e-001 infeas = 0.000e+000 (5) * 934: obj = 0.000000000e+000 infeas = 0.000e+000 (1) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 12098 rows, 386 columns, 843 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 934: mip = not found yet <= +inf (1; 0) + 937: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 937: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 34 rows, 36 columns, 814 non-zeros Preprocessing... 34 rows, 36 columns, 814 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 34 221: obj = 0.000000000e+000 infeas = 2.317e+001 (0) * 222: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 239: obj = -6.190476190e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 36 GLPK Simplex Optimizer, v4.44 34 rows, 385 columns, 1027 non-zeros Preprocessing... 34 rows, 383 columns, 992 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 34 932: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 933: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 949: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 34 rows, 385 columns, 1027 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 949: mip = not found yet <= +inf (1; 0) + 958: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 958: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 12450 rows, 387 columns, 848 non-zeros Preprocessing... 193 rows, 371 columns, 822 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 171 2106: obj = 0.000000000e+000 infeas = 3.000e+000 (22) * 2177: obj = -4.285714286e-001 infeas = 5.551e-017 (5) * 2200: obj = 7.930164462e-018 infeas = 2.405e-015 (5) * 2204: obj = 0.000000000e+000 infeas = 0.000e+000 (5) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 12450 rows, 387 columns, 848 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 2204: mip = not found yet <= +inf (1; 0) + 2212: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 2212: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 12450 rows, 387 columns, 849 non-zeros Preprocessing... 193 rows, 373 columns, 825 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 172 937: obj = 0.000000000e+000 infeas = 2.000e+000 (21) * 978: obj = -2.619047619e-001 infeas = 0.000e+000 (5) * 1000: obj = -2.555275215e-017 infeas = 3.886e-016 (1) * 1001: obj = -1.233581138e-017 infeas = 5.551e-017 (1) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 12450 rows, 387 columns, 849 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 1001: mip = not found yet <= +inf (1; 0) + 1003: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 1003: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 35 rows, 37 columns, 859 non-zeros Preprocessing... 35 rows, 37 columns, 859 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 35 239: obj = 0.000000000e+000 infeas = 2.781e+001 (0) * 240: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 250: obj = -5.000000000e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 37 GLPK Simplex Optimizer, v4.44 35 rows, 386 columns, 1050 non-zeros Preprocessing... 35 rows, 384 columns, 1014 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 35 958: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 959: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 971: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 35 rows, 386 columns, 1050 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 971: mip = not found yet <= +inf (1; 0) + 978: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 978: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 12802 rows, 388 columns, 854 non-zeros Preprocessing... 196 rows, 372 columns, 828 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 174 2212: obj = 0.000000000e+000 infeas = 3.000e+000 (22) * 2286: obj = -5.000000000e-001 infeas = 0.000e+000 (8) * 2287: obj = -5.000000000e-001 infeas = 6.163e-033 (7) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 12802 rows, 388 columns, 854 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 2287: mip = not found yet <= +inf (1; 0) + 2360: >>>>> -5.000000000e-001 <= -5.000000000e-001 0.0% (20; 0) + 2360: mip = -5.000000000e-001 <= tree is empty 0.0% (0; 39) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 12802 rows, 388 columns, 855 non-zeros Preprocessing... 196 rows, 374 columns, 831 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 175 1003: obj = 0.000000000e+000 infeas = 2.000e+000 (21) * 1042: obj = -2.500000000e-001 infeas = 0.000e+000 (7) * 1059: obj = 3.697785493e-032 infeas = 2.683e-015 (5) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 12802 rows, 388 columns, 855 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 1059: mip = not found yet <= +inf (1; 0) + 1071: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (6; 0) + 1071: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 11) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 36 rows, 38 columns, 902 non-zeros Preprocessing... 36 rows, 38 columns, 902 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 36 250: obj = 0.000000000e+000 infeas = 3.244e+001 (0) * 251: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 268: obj = -5.000000000e+001 infeas = 6.862e-016 (0) OPTIMAL SOLUTION FOUND 38 GLPK Simplex Optimizer, v4.44 36 rows, 387 columns, 1067 non-zeros Preprocessing... 36 rows, 385 columns, 1030 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 36 978: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 979: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 1000: obj = 9.761904762e+001 infeas = 1.735e-015 (0) * 1007: obj = 1.000000000e+002 infeas = 2.037e-015 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 36 rows, 387 columns, 1067 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 1007: mip = not found yet <= +inf (1; 0) + 1010: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 1010: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 13154 rows, 389 columns, 860 non-zeros Preprocessing... 199 rows, 373 columns, 834 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 177 2360: obj = 0.000000000e+000 infeas = 3.000e+000 (22) 2400: obj = 0.000000000e+000 infeas = 3.000e+000 (12) * 2428: obj = -5.000000000e-001 infeas = 0.000e+000 (9) * 2454: obj = -2.500000000e-001 infeas = 0.000e+000 (7) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 13154 rows, 389 columns, 860 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 2454: mip = not found yet <= +inf (1; 0) + 2465: >>>>> -2.500000000e-001 <= -2.500000000e-001 0.0% (2; 0) + 2465: mip = -2.500000000e-001 <= tree is empty 0.0% (0; 3) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 13154 rows, 389 columns, 861 non-zeros Preprocessing... 199 rows, 375 columns, 837 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 178 1071: obj = 0.000000000e+000 infeas = 2.000e+000 (21) * 1111: obj = -3.750000000e-001 infeas = 0.000e+000 (7) * 1142: obj = -2.418305541e-017 infeas = 0.000e+000 (3) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 13154 rows, 389 columns, 861 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 1142: mip = not found yet <= +inf (1; 0) + 1142: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 1142: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 37 rows, 39 columns, 956 non-zeros Preprocessing... 37 rows, 39 columns, 956 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 37 268: obj = 0.000000000e+000 infeas = 3.708e+001 (0) * 269: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 280: obj = -5.714285714e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 39 GLPK Simplex Optimizer, v4.44 37 rows, 388 columns, 1086 non-zeros Preprocessing... 37 rows, 386 columns, 1048 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 37 1010: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 1011: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 1026: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 37 rows, 388 columns, 1086 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 1026: mip = not found yet <= +inf (1; 0) + 1397: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (2; 0) + 1397: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 3) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 13506 rows, 390 columns, 866 non-zeros Preprocessing... 202 rows, 374 columns, 840 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 180 2465: obj = 0.000000000e+000 infeas = 3.000e+000 (22) * 2539: obj = -4.000000000e-001 infeas = 0.000e+000 (8) * 2584: obj = 4.563620834e-018 infeas = 4.802e-016 (5) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 13506 rows, 390 columns, 866 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 2584: mip = not found yet <= +inf (1; 0) + 2591: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 2591: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 13506 rows, 390 columns, 867 non-zeros Preprocessing... 202 rows, 376 columns, 843 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 181 1142: obj = 0.000000000e+000 infeas = 2.000e+000 (21) * 1200: obj = -3.333333333e-001 infeas = 0.000e+000 (3) * 1214: obj = 0.000000000e+000 infeas = 0.000e+000 (3) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 13506 rows, 390 columns, 867 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 1214: mip = not found yet <= +inf (1; 0) + 1214: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 1214: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 38 rows, 40 columns, 994 non-zeros Preprocessing... 38 rows, 40 columns, 994 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 38 280: obj = 0.000000000e+000 infeas = 3.708e+001 (0) * 281: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 298: obj = -5.882352941e+001 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND 40 GLPK Simplex Optimizer, v4.44 38 rows, 389 columns, 1105 non-zeros Preprocessing... 38 rows, 387 columns, 1066 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 38 1397: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 1398: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 1400: obj = 5.882352941e+001 infeas = 0.000e+000 (0) * 1425: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 38 rows, 389 columns, 1105 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 1425: mip = not found yet <= +inf (1; 0) + 1428: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 1428: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 13858 rows, 391 columns, 872 non-zeros Preprocessing... 205 rows, 375 columns, 846 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 183 2591: obj = 0.000000000e+000 infeas = 3.000e+000 (22) 2600: obj = 0.000000000e+000 infeas = 3.000e+000 (13) * 2657: obj = -4.117647059e-001 infeas = 0.000e+000 (9) * 2698: obj = -1.764705882e-001 infeas = 2.671e-032 (7) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 13858 rows, 391 columns, 872 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 2698: mip = not found yet <= +inf (1; 0) + 2698: >>>>> -1.764705882e-001 <= -1.764705882e-001 0.0% (1; 0) + 2698: mip = -1.764705882e-001 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 13858 rows, 391 columns, 873 non-zeros Preprocessing... 205 rows, 377 columns, 849 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 184 1214: obj = 0.000000000e+000 infeas = 2.000e+000 (21) * 1255: obj = -1.764705882e-001 infeas = 0.000e+000 (9) * 1268: obj = 0.000000000e+000 infeas = 0.000e+000 (8) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 13858 rows, 391 columns, 873 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 1268: mip = not found yet <= +inf (1; 0) + 1269: >>>>> 0.000000000e+000 <= 0.000000000e+000 0.0% (1; 0) + 1269: mip = 0.000000000e+000 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 39 rows, 41 columns, 1053 non-zeros Preprocessing... 39 rows, 41 columns, 1053 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 39 298: obj = 0.000000000e+000 infeas = 4.171e+001 (0) * 299: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 309: obj = -6.000000000e+001 infeas = 3.331e-016 (0) OPTIMAL SOLUTION FOUND 41 GLPK Simplex Optimizer, v4.44 39 rows, 390 columns, 1119 non-zeros Preprocessing... 39 rows, 388 columns, 1079 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 39 1428: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 1429: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 1440: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 39 rows, 390 columns, 1119 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 1440: mip = not found yet <= +inf (1; 0) + 1442: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 1442: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 14210 rows, 392 columns, 878 non-zeros Preprocessing... 208 rows, 376 columns, 852 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 186 2698: obj = 0.000000000e+000 infeas = 3.000e+000 (22) * 2770: obj = -6.000000000e-001 infeas = 0.000e+000 (8) * 2800: obj = -5.000000000e-001 infeas = 0.000e+000 (3) * 2840: obj = 3.125648139e-017 infeas = 3.173e-015 (1) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 14210 rows, 392 columns, 878 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 2840: mip = not found yet <= +inf (1; 0) + 2906: >>>>> 4.790982676e-017 <= 4.790982676e-017 0.0% (17; 0) + 2906: mip = 4.790982676e-017 <= tree is empty 0.0% (0; 33) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 14210 rows, 392 columns, 879 non-zeros Preprocessing... 208 rows, 378 columns, 855 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 187 1269: obj = 0.000000000e+000 infeas = 2.000e+000 (21) * 1327: obj = -2.500000000e-001 infeas = 0.000e+000 (3) * 1350: obj = 4.790982676e-017 infeas = 0.000e+000 (3) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 14210 rows, 392 columns, 879 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 1350: mip = not found yet <= +inf (1; 0) + 1352: >>>>> 4.790982676e-017 <= 4.790982676e-017 0.0% (1; 0) + 1352: mip = 4.790982676e-017 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 40 rows, 42 columns, 1105 non-zeros Preprocessing... 40 rows, 42 columns, 1105 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+002 ratio = 1.000e+002 GM: min|aij| = 9.955e-001 max|aij| = 1.005e+000 ratio = 1.009e+000 EQ: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Constructing initial basis... Size of triangular part = 40 309: obj = 0.000000000e+000 infeas = 4.635e+001 (0) * 310: obj = -1.000000000e+002 infeas = 0.000e+000 (0) * 331: obj = -5.000000000e+001 infeas = 3.294e-015 (0) OPTIMAL SOLUTION FOUND 42 GLPK Simplex Optimizer, v4.44 40 rows, 391 columns, 1177 non-zeros Preprocessing... 40 rows, 389 columns, 1136 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 40 1442: obj = 0.000000000e+000 infeas = 2.000e+000 (0) * 1443: obj = 0.000000000e+000 infeas = 0.000e+000 (0) * 1470: obj = 1.000000000e+002 infeas = 0.000e+000 (0) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 40 rows, 391 columns, 1177 non-zeros 352 integer variables, 350 of which are binary Integer optimization begins... + 1470: mip = not found yet <= +inf (1; 0) + 1472: >>>>> 1.000000000e+002 <= 1.000000000e+002 0.0% (1; 0) + 1472: mip = 1.000000000e+002 <= tree is empty 0.0% (0; 1) INTEGER OPTIMAL SOLUTION FOUND GLPK Simplex Optimizer, v4.44 14562 rows, 393 columns, 884 non-zeros Preprocessing... 211 rows, 377 columns, 858 non-zeros Scaling... A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000 Problem data seem to be well scaled Constructing initial basis... Size of triangular part = 189 2906: obj = 0.000000000e+000 infeas = 3.000e+000 (22) * 2978: obj = -2.500000000e-001 infeas = 0.000e+000 (8) * 3000: obj = -1.875000000e-001 infeas = 1.665e-016 (7) * 3002: obj = -1.666666667e-001 infeas = 0.000e+000 (7) OPTIMAL SOLUTION FOUND GLPK Integer Optimizer, v4.44 14562 rows, 393 columns, 884 non-zeros 352 integer variables, all of which are binary Integer optimization begins... + 3002: mip = not found yet <= +inf (1; 0) + 3094: >>>>> -5.000000000e-001 <= -2.500000000e-001 50.0% (18; 0) + 4122: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (47; 141) + 5166: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (67; 280) + 6299: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (41; 516) + 7494: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (54; 665) + 8501: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (78; 793) + 9609: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (52; 1025) + 10829: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (38; 1197) + 11910: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (43; 1384) + 13045: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (37; 1578) + 14268: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (53; 1763) + 15839: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (46; 1964) Time used: 60.0 secs. Memory used: 10.8 Mb. + 17378: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (54; 2158) + 18742: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (56; 2365) + 20010: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (63; 2528) + 21433: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (53; 2735) + 23037: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (59; 2914) + 24626: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (55; 3115) + 26025: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (59; 3317) + 27219: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (60; 3525) + 28526: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (63; 3729) + 29914: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (63; 3903) + 31387: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (55; 4117) + 32653: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (63; 4322) Time used: 120.0 secs. Memory used: 10.8 Mb. + 34051: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (59; 4542) + 35588: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (61; 4758) + 36878: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (56; 5000) + 38334: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (54; 5215) + 39495: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (53; 5404) + 40839: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (50; 5611) + 41776: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (59; 5767) + 43000: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (55; 5958) + 44319: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (60; 6161) + 45709: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (50; 6374) + 46950: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (44; 6597) + 48089: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (52; 6777) Time used: 180.0 secs. Memory used: 10.8 Mb. + 49135: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (46; 6967) + 50682: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (56; 7141) + 52158: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (52; 7314) + 53718: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (55; 7485) + 55182: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (53; 7688) + 56812: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (59; 7865) + 58323: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (52; 8079) + 59873: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (50; 8254) + 61298: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (41; 8497) + 62576: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (46; 8707) + 63934: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (43; 8920) + 65371: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (42; 9119) Time used: 240.0 secs. Memory used: 10.9 Mb. + 67315: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (38; 9313) + 68746: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (43; 9486) + 70199: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (42; 9698) + 71423: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (70; 9844) + 72273: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (69; 9964) + 73068: mip = -5.000000000e-001 <= -2.500000000e-001 50.0% (107; 10024)