--- Job dano3mip Start 07/17/08 16:26:36 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 --- dano3mip.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/dano3mip.gdx --- dano3mip.gms(148) 6 Mb --- Starting execution: elapsed 0:00:00.109 --- dano3mip.gms(123) 6 Mb --- Generating MIP model m --- dano3mip.gms(124) 10 Mb --- 3,203 rows 13,874 columns 79,657 non-zeroes --- 552 discrete-columns --- dano3mip.gms(124) 10 Mb --- Executing Cbc: elapsed 0:00:00.349 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Reading parameter(s) from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" >> threads 2 Finished reading from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" Problem statistics: 13873 columns and 3202 rows. 552 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.10.00, build Jul 15 2008 command line - GAMS/CBC -threads 2 -solve -quit threads was changed from 0 to 2 Continuous objective value is 576.232 - 36.25 seconds 0 fixed, 315 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 3139 rows, 13825 columns (552 integer) and 80277 elements Pass 1: (12.27 seconds) suminf. 2.48247 obj. 819.443 iterations 17145 Pass 2: (61.68 seconds) suminf. 0.00000 obj. 861.1 iterations 41268 Solution found of 861.1 Before mini branch and bound, 424 integers at bound fixed and 12084 continuous Full problem 3139 rows 13825 columns, reduced to 1376 rows 1160 columns Mini branch and bound improved solution from 861.1 to 782.25 (80.87 seconds) Freeing continuous variables gives a solution of 756.625 Round again with cutoff of 738.586 Pass 3: (94.20 seconds) suminf. 2.57089 obj. 738.586 iterations 19844 Pass 4: (121.46 seconds) suminf. 0.57726 obj. 738.586 iterations 28170 Pass 5: (134.08 seconds) suminf. 0.32144 obj. 738.586 iterations 15506 Pass 6: (163.40 seconds) suminf. 3.35998 obj. 738.586 iterations 34809 Pass 7: (163.77 seconds) suminf. 3.29539 obj. 738.586 iterations 798 Pass 8: (171.36 seconds) suminf. 4.34539 obj. 738.586 iterations 9418 Pass 9: (188.69 seconds) suminf. 2.55706 obj. 738.586 iterations 20538 Pass 10: (202.14 seconds) suminf. 0.61109 obj. 738.586 iterations 17874 Pass 11: (215.68 seconds) suminf. 1.35523 obj. 738.586 iterations 21466 Pass 12: (216.78 seconds) suminf. 1.12252 obj. 738.586 iterations 2406 Pass 13: (222.90 seconds) suminf. 6.95545 obj. 738.586 iterations 12259 Pass 14: (226.95 seconds) suminf. 5.82914 obj. 738.586 iterations 6426 Pass 15: (230.37 seconds) suminf. 5.00000 obj. 738.586 iterations 4284 Pass 16: (236.32 seconds) suminf. 5.37668 obj. 738.586 iterations 7172 Pass 17: (243.38 seconds) suminf. 1.20194 obj. 738.586 iterations 12624 Pass 18: (245.87 seconds) suminf. 0.79456 obj. 738.586 iterations 4990 Pass 19: (253.50 seconds) suminf. 3.45834 obj. 738.586 iterations 13849 Pass 20: (259.23 seconds) suminf. 1.37803 obj. 738.586 iterations 8712 Pass 21: (265.19 seconds) suminf. 0.51653 obj. 738.586 iterations 9343 Pass 22: (271.18 seconds) suminf. 3.65796 obj. 738.586 iterations 12809 Before mini branch and bound, 227 integers at bound fixed and 10520 continuous Full problem 3139 rows 13825 columns, reduced to 2197 rows 2995 columns Mini branch and bound did not improve solution (559.09 seconds) After 559.09 seconds - Feasibility pump exiting with objective of 1 - took 559.05 seconds Integer solution of 756.625 found by feasibility pump after 0 iterations and 0 nodes (559.09 seconds) Full problem 3139 rows 13825 columns, reduced to 927 rows 1177 columns 88 added rows had average density of 7.15909 At root node, 88 cuts changed objective from 576.232 to 576.427 in 3 passes Cut generator 0 (Probing) - 102 row cuts (84 active), 15 column cuts in 0.248 seconds - new frequency is 1 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.060 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.068 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 2 row cuts (0 active), 0 column cuts in 0.040 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.200 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 6 row cuts (4 active), 0 column cuts in 0.320 seconds - new frequency is -100 After 0 nodes, 1 on tree, 756.625 best solution, best possible 576.427 (567.10 seconds) After 100 nodes, 52 on tree, 756.625 best solution, best possible 576.608 (1047.55 seconds) After 200 nodes, 107 on tree, 756.625 best solution, best possible 576.608 (1452.09 seconds) After 300 nodes, 161 on tree, 756.625 best solution, best possible 576.608 (1807.21 seconds) After 400 nodes, 217 on tree, 756.625 best solution, best possible 576.608 (2087.46 seconds) After 500 nodes, 274 on tree, 756.625 best solution, best possible 576.608 (2227.78 seconds) After 600 nodes, 330 on tree, 756.625 best solution, best possible 576.608 (2348.66 seconds) After 700 nodes, 350 on tree, 756.625 best solution, best possible 576.608 (2377.81 seconds) Cbc0004I Integer solution of 753.3 found after 558389 iterations and 797 nodes (2417.23 seconds) Cbc0038I Full problem 3139 rows 13825 columns, reduced to 927 rows 1177 columns Cbc0038I Full problem 3139 rows 13825 columns, reduced to 1329 rows 2196 columns --- Restarting execution --- dano3mip.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job dano3mip.gms Stop 07/17/08 17:27:40 elapsed 1:01:04.163