--- Job fast0507 Start 08/21/08 21:28:10 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- fast0507.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/fast0507.gdx --- fast0507.gms(148) 18 Mb --- Starting execution: elapsed 0:00:00.279 --- fast0507.gms(123) 19 Mb --- Generating MIP model m --- fast0507.gms(124) 40 Mb --- 508 rows 63,010 columns 472,359 non-zeroes --- 63,009 discrete-columns --- fast0507.gms(124) 39 Mb --- Executing COINCBC: elapsed 0:00:01.282 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 63009 columns and 507 rows. 63009 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.10.00, build Jun 21 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 172.146 - 1.97 seconds processed model has 484 rows, 62173 columns (62173 integer) and 401766 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 7.00000 obj. 227.667 iterations 5301 Pass 2: suminf. 0.00000 obj. 231 iterations 133 Solution found of 231 Cleaned solution of 231 Before mini branch and bound, 61829 integers at bound fixed and 0 continuous Full problem 484 rows 62173 columns, reduced to 353 rows 344 columns Mini branch and bound improved solution from 231 to 189 (15.73 seconds) Round again with cutoff of 187.315 Pass 3: suminf. 23.49893 obj. 187.315 iterations 5163 Pass 4: suminf. 0.52426 obj. 187.315 iterations 2538 Pass 5: suminf. 0.15728 obj. 187.315 iterations 952 Solution found of 187.315 Full problem 485 rows 62173 columns, reduced to 30 rows 104 columns Cleaned solution of 187 Before mini branch and bound, 61800 integers at bound fixed and 0 continuous Full problem 484 rows 62173 columns, reduced to 343 rows 373 columns Mini branch and bound improved solution from 187 to 185 (44.09 seconds) After 44.11 seconds - Feasibility pump exiting with objective of 185 - took 43.99 seconds Integer solution of 185 found by feasibility pump after 0 iterations and 0 nodes (44.14 seconds) Full problem 484 rows 62173 columns, reduced to 0 rows 0 columns Integer solution of 183 found by combine solutions after 0 iterations and 0 nodes (44.55 seconds) At root node, 0 cuts changed objective from 172.146 to 172.146 in 1 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.068 seconds - new frequency is 10 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.052 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.016 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.116 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.080 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts (0 active), 0 column cuts in 0.604 seconds - new frequency is -100 After 0 nodes, 1 on tree, 183 best solution, best possible 172.146 (52.12 seconds) After 100 nodes, 53 on tree, 183 best solution, best possible 172.351 (657.41 seconds) After 200 nodes, 105 on tree, 183 best solution, best possible 172.351 (1113.29 seconds) Integer solution of 179 found after 94049 iterations and 283 nodes (1473.40 seconds) Full problem 484 rows 62173 columns, reduced to 155 rows 105 columns After 300 nodes, 145 on tree, 179 best solution, best possible 172.351 (1544.66 seconds) Exiting on maximum time Partial search - best objective 179 (best possible 172.351), took 122513 iterations and 365 nodes (1800.24 seconds) Strong branching done 6214 times (389264 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 71, 0 variables fixed on reduced cost Cuts at root node changed objective from 172.146 to 172.146 Probing was tried 37 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.884 seconds) Gomory was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.052 seconds) Knapsack was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) Clique was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.116 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.080 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.604 seconds) Result - Stopped on time objective 179 after 365 nodes and 122513 iterations - took 1801.10 seconds (total time 1803.12) Total time 1803.51 Time limit reached. Have feasible solution. MIP solution: 179 (365 nodes, 1803.57 seconds) Best possible: 172.3511189 Absolute gap: 6.6489 (absolute tolerance optca: 0) Relative gap: 0.038578 (relative tolerance optcr: 0) --- Restarting execution --- fast0507.gms(124) 0 Mb --- Reading solution for model m --- fast0507.gms(124) 22 Mb *** Status: Normal completion --- Job fast0507.gms Stop 08/21/08 21:58:23 elapsed 0:30:13.867