--- Job nw04 Start 08/21/08 11:32:53 GAMS Rev 227 Copyright (C) 1987-2008 GAMS Development. All rights reserved Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- nw04.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/nw04.gdx --- nw04.gms(148) 26 Mb --- Starting execution: elapsed 0:00:00.684 --- nw04.gms(123) 26 Mb --- Generating MIP model m --- nw04.gms(124) 58 Mb --- 37 rows 87,483 columns 724,149 non-zeroes --- 87,482 discrete-columns --- nw04.gms(124) 57 Mb --- Executing COINCBC: elapsed 0:00:02.345 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 87482 columns and 36 rows. 87482 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.00.00, build Mar 20 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 16310.7 - 3.35 seconds 0 fixed, 3208 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 36 rows, 46190 columns (46190 integer) and 331566 elements Objective coefficients multiple of 2 Cutoff increment increased from 1e-05 to 1.998 Pass 1: obj. 1.00000 --> up = 1 , down = 0 - solution found of 19124 Before mini branch and bound, 46183 integers at bound fixed and 0 continuous Full problem 36 rows 46190 columns, reduced to 1 rows 2 columns Mini branch and bound did not improve solution (0.80 seconds) Round again with cutoff of 18842.7 Reduced cost fixing fixed 13921 variables on pass 2 Pass 2: obj. 1.19048 --> up = 0 , down = 0 -- rand = 18 ( 21) Pass 3: obj. 16.80000 --> up = 2 , down = 16 perturbation applied Pass 4: obj. 600.83144 --> up = 0 , down = 604 Pass 5: obj. 3.00000 --> up = 1 , down = 0 Pass 6: obj. 2.00000 --> up = 0 , down = 0 -- rand = 7 ( 19) Pass 7: obj. 5.00000 --> up = 0 , down = 7 perturbation applied Pass 8: obj. 608.87775 --> up = 0 , down = 611 perturbation applied Pass 9: obj. 581.85632 --> up = 0 , down = 586 Pass 10: obj. 3.66667 --> up = 0 , down = 0 -- rand = 13 ( 13) Pass 11: obj. 9.52632 --> up = 0 , down = 13 perturbation applied Pass 12: obj. 558.90672 --> up = 0 , down = 561 Pass 13: obj. 2.00000 --> up = 1 , down = 0 Pass 14: obj. 1.00000 --> up = 1 , down = 0 - solution found of 18356 Before mini branch and bound, 46050 integers at bound fixed and 0 continuous Full problem 36 rows 46190 columns, reduced to 29 rows 140 columns Mini branch and bound improved solution from 18356 to 17812 (4.08 seconds) After 4.10 seconds - Feasibility pump exiting - took 4.02 seconds Full problem 36 rows 46190 columns, reduced to 13 rows 329 columns Integer solution of 17812 found by feasibility pump after 0 iterations and 0 nodes (5.05 seconds) 4 added rows had average density of 5.75 At root node, 4 cuts changed objective from 16310.7 to 16312 in 5 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 1 column cuts in 0.356 seconds - new frequency is 2 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.044 seconds - new frequency is -100 Cut generator 3 (Clique) - 143 row cuts (4 active), 0 column cuts in 0.016 seconds - new frequency is 1 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.024 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.016 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts (0 active), 0 column cuts in 0.036 seconds - new frequency is -100 After 0 nodes, 1 on tree, 17812 best solution, best possible 16312 (6.83 seconds) Strong branching is fixing too many variables, too expensively! Search completed - best objective 16862, took 1500 iterations and 78 nodes (19.02 seconds) Strong branching done 1628 times (23377 iterations), fathomed 2 nodes and fixed 230 variables Maximum depth 17, 52040 variables fixed on reduced cost Cuts at root node changed objective from 16310.7 to 16312 Probing was tried 23 times and created 0 cuts of which 1 were active after adding rounds of cuts (1.280 seconds) Gomory was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) Knapsack was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.044 seconds) Clique was tried 27 times and created 756 cuts of which 38 were active after adding rounds of cuts (0.140 seconds) MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) Result - Finished objective 16862 after 78 nodes and 1500 iterations - took 21.17 seconds (total time 24.61) Total time 24.97 Solved to optimality. Writing solution. Objective: 16862 Time: 25.03 s --- Restarting execution --- nw04.gms(124) 0 Mb --- Reading solution for model m --- nw04.gms(124) 31 Mb *** Status: Normal completion --- Job nw04.gms Stop 08/21/08 11:33:22 elapsed 0:00:29.163