--- Job 10teams Start 08/21/08 16:00:40 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 --- 10teams.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/10teams.gdx --- 10teams.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.016 --- 10teams.gms(123) 4 Mb --- Generating MIP model m --- 10teams.gms(124) 4 Mb --- 231 rows 2,026 columns 14,176 non-zeroes --- 1,800 discrete-columns --- 10teams.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.050 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 2025 columns and 230 rows. 1800 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 917 - 0.12 seconds 200 variables fixed processed model has 210 rows, 1600 columns (1600 integer) and 9600 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 24.28571 obj. 931.048 iterations 770 Pass 2: suminf. 13.57229 obj. 939.511 iterations 679 Pass 3: suminf. 10.80075 obj. 946.412 iterations 269 Pass 4: suminf. 9.87179 obj. 948.436 iterations 421 Pass 5: suminf. 9.52849 obj. 950.122 iterations 184 Pass 6: suminf. 8.84671 obj. 946.055 iterations 697 Pass 7: suminf. 7.97092 obj. 946.515 iterations 409 Pass 8: suminf. 8.21298 obj. 946.282 iterations 403 Pass 9: suminf. 7.98283 obj. 945.38 iterations 142 Pass 10: suminf. 9.30295 obj. 947.073 iterations 605 Pass 11: suminf. 8.50550 obj. 946.77 iterations 410 Pass 12: suminf. 8.03121 obj. 946.175 iterations 283 Pass 13: suminf. 7.97092 obj. 946.252 iterations 93 Pass 14: suminf. 13.74211 obj. 964.068 iterations 403 Pass 15: suminf. 9.44681 obj. 950.553 iterations 403 Pass 16: suminf. 8.20198 obj. 946.39 iterations 310 Pass 17: suminf. 8.68827 obj. 951.432 iterations 714 Pass 18: suminf. 8.03121 obj. 945.466 iterations 372 Pass 19: suminf. 7.97092 obj. 947.059 iterations 114 Pass 20: suminf. 9.77273 obj. 945.727 iterations 862 No solution found this major pass Before mini branch and bound, 950 integers at bound fixed and 0 continuous Full problem 210 rows 1600 columns, reduced to 210 rows 650 columns - too large Mini branch and bound did not improve solution (1.11 seconds) Full problem 211 rows 1600 columns, reduced to 211 rows 1600 columns - too large After 1.40 seconds - Feasibility pump exiting - took 1.39 seconds 17 added rows had average density of 17.3529 At root node, 17 cuts changed objective from 917 to 924 in 3 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.116 seconds - new frequency is 10 Cut generator 1 (Gomory) - 16 row cuts (2 active), 0 column cuts in 0.036 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 3 (Clique) - 108 row cuts (15 active), 0 column cuts in -0.000 seconds - new frequency is 1 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 10 row cuts (0 active), 0 column cuts in 0.024 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 924 (4.03 seconds) Integer solution of 992 found after 42525 iterations and 414 nodes (41.97 seconds) Integer solution of 980 found after 64127 iterations and 622 nodes (49.66 seconds) Full problem 210 rows 1600 columns, reduced to 0 rows 0 columns Full problem 210 rows 1600 columns, reduced to 27 rows 10 columns Integer solution of 924 found after 67815 iterations and 654 nodes (50.51 seconds) Search completed - best objective 924, took 67815 iterations and 654 nodes (50.52 seconds) Strong branching done 6270 times (388022 iterations), fathomed 14 nodes and fixed 48 variables Maximum depth 41, 2076 variables fixed on reduced cost Cuts at root node changed objective from 917 to 924 Probing was tried 50 times and created 0 cuts of which 6 were active after adding rounds of cuts (0.176 seconds) Gomory was tried 3 times and created 16 cuts of which 2 were active after adding rounds of cuts (0.036 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) Clique was tried 214 times and created 2727 cuts of which 932 were active after adding rounds of cuts (0.136 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 10 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) Result - Finished objective 924 after 654 nodes and 67815 iterations - took 50.64 seconds (total time 50.77) Total time 50.78 Solved to optimality. MIP solution: 924 (654 nodes, 50.78 seconds) Best possible: 924 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- 10teams.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job 10teams.gms Stop 08/21/08 16:01:31 elapsed 0:00:50.944