--- Job ran17x17 Start 08/22/08 02:53:58 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 --- ran17x17.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran17x17.gdx --- ran17x17.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- ran17x17.gms(123) 4 Mb --- Generating MIP model m --- ran17x17.gms(124) 4 Mb --- 324 rows 579 columns 1,735 non-zeroes --- 289 discrete-columns --- Executing COINCBC: elapsed 0:00:00.016 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 578 columns and 323 rows. 289 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 1215.25 - 0.01 seconds processed model has 323 rows, 578 columns (289 integer) and 1156 elements Pass 1: suminf. 1.72044 obj. 1261.72 iterations 128 Solution found of 1571 Before mini branch and bound, 268 integers at bound fixed and 268 continuous Full problem 323 rows 578 columns, reduced to 21 rows 24 columns Mini branch and bound improved solution from 1571 to 1464 (0.02 seconds) Round again with cutoff of 1439.12 Pass 2: suminf. 1.72044 obj. 1263.96 iterations 129 Pass 3: suminf. 0.56756 obj. 1439.12 iterations 106 Pass 4: suminf. 0.47894 obj. 1439.12 iterations 41 Pass 5: suminf. 0.42410 obj. 1439.12 iterations 77 Pass 6: suminf. 0.34243 obj. 1439.12 iterations 70 Pass 7: suminf. 0.55347 obj. 1439.12 iterations 44 Pass 8: suminf. 0.55347 obj. 1439.12 iterations 45 Pass 9: suminf. 0.51217 obj. 1439.12 iterations 33 Pass 10: suminf. 0.51217 obj. 1439.12 iterations 36 Pass 11: suminf. 0.42411 obj. 1439.12 iterations 48 Pass 12: suminf. 3.21272 obj. 1439.12 iterations 119 Pass 13: suminf. 1.60435 obj. 1439.12 iterations 63 Pass 14: suminf. 1.60435 obj. 1439.12 iterations 7 Pass 15: suminf. 3.10009 obj. 1439.12 iterations 101 Pass 16: suminf. 2.24228 obj. 1439.12 iterations 59 Pass 17: suminf. 1.74237 obj. 1439.12 iterations 47 Pass 18: suminf. 1.64853 obj. 1439.12 iterations 46 Pass 19: suminf. 2.82333 obj. 1439.12 iterations 58 Pass 20: suminf. 2.29115 obj. 1439.12 iterations 37 Pass 21: suminf. 1.72802 obj. 1439.12 iterations 21 Before mini branch and bound, 238 integers at bound fixed and 239 continuous Full problem 323 rows 578 columns, reduced to 66 rows 86 columns Mini branch and bound did not improve solution (0.15 seconds) After 0.15 seconds - Feasibility pump exiting with objective of 10 - took 0.15 seconds Integer solution of 1571 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) Full problem 323 rows 578 columns, reduced to 0 rows 0 columns 41 added rows had average density of 25.0976 At root node, 41 cuts changed objective from 1215.25 to 1321.02 in 11 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.052 seconds - new frequency is 10 Cut generator 1 (Gomory) - 17 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 52 row cuts (8 active), 0 column cuts in 0.024 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 55 row cuts (10 active), 0 column cuts in 0.004 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 38 row cuts (14 active), 0 column cuts in -0.000 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 79 row cuts (9 active), 0 column cuts in 0.044 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1571 best solution, best possible 1321.02 (0.54 seconds) After 1000 nodes, 104 on tree, 1571 best solution, best possible 1322.58 (7.19 seconds) Full problem 323 rows 578 columns, reduced to 47 rows 57 columns Integer solution of 1455 found by combine solutions after 22763 iterations and 1466 nodes (8.10 seconds) Integer solution of 1450 found after 26905 iterations and 1694 nodes (8.87 seconds) Full problem 323 rows 578 columns, reduced to 60 rows 76 columns Integer solution of 1439 found by combine solutions after 26932 iterations and 1695 nodes (8.99 seconds) After 2000 nodes, 198 on tree, 1439 best solution, best possible 1322.82 (9.67 seconds) Integer solution of 1438 found after 30994 iterations and 2062 nodes (9.79 seconds) Full problem 323 rows 578 columns, reduced to 62 rows 79 columns Integer solution of 1437 found by combine solutions after 31019 iterations and 2064 nodes (9.92 seconds) After 3000 nodes, 654 on tree, 1437 best solution, best possible 1352.5 (14.10 seconds) Integer solution of 1387 found after 63876 iterations and 3129 nodes (14.54 seconds) Full problem 323 rows 578 columns, reduced to 66 rows 85 columns Integer solution of 1373 found by combine solutions after 63885 iterations and 3130 nodes (14.59 seconds) After 4000 nodes, 378 on tree, 1373 best solution, best possible 1359.86 (16.65 seconds) After 5000 nodes, 398 on tree, 1373 best solution, best possible 1364.87 (18.71 seconds) After 6000 nodes, 361 on tree, 1373 best solution, best possible 1368.48 (20.51 seconds) After 7000 nodes, 260 on tree, 1373 best solution, best possible 1370.99 (21.97 seconds) Search completed - best objective 1373, took 103927 iterations and 7982 nodes (23.23 seconds) Strong branching done 3084 times (57451 iterations), fathomed 52 nodes and fixed 312 variables Maximum depth 67, 109658 variables fixed on reduced cost Cuts at root node changed objective from 1215.25 to 1321.02 Probing was tried 514 times and created 340 cuts of which 145 were active after adding rounds of cuts (0.192 seconds) Gomory was tried 11 times and created 17 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) Knapsack was tried 1176 times and created 936 cuts of which 214 were active after adding rounds of cuts (1.244 seconds) Clique was tried 11 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 1176 times and created 2504 cuts of which 1350 were active after adding rounds of cuts (0.328 seconds) FlowCover was tried 1176 times and created 1958 cuts of which 1009 were active after adding rounds of cuts (0.424 seconds) TwoMirCuts was tried 11 times and created 79 cuts of which 9 were active after adding rounds of cuts (0.044 seconds) Result - Finished objective 1373 after 7982 nodes and 103927 iterations - took 23.23 seconds (total time 23.24) Total time 23.25 Solved to optimality. MIP solution: 1373 (7982 nodes, 23.24 seconds) Best possible: 1373 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran17x17.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran17x17.gms Stop 08/22/08 02:54:21 elapsed 0:00:23.302