--- Job n370c Start 07/18/08 10:13:05 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 --- n370c.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/n370c.gdx --- n370c.gms(148) 5 Mb --- Starting execution: elapsed 0:00:00.082 --- n370c.gms(123) 5 Mb --- Generating MIP model m --- n370c.gms(124) 7 Mb --- 5,151 rows 10,001 columns 30,001 non-zeroes --- 5,000 discrete-columns --- n370c.gms(124) 7 Mb --- Executing Cbc: elapsed 0:00:00.233 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: 10000 columns and 5150 rows. 5000 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 965431 - 1.98 seconds processed model has 5150 rows, 10000 columns (5000 integer) and 20000 elements Pass 1: (0.31 seconds) suminf. 6.78883 obj. 1.04387e+06 iterations 1238 Pass 2: (0.34 seconds) suminf. 6.62199 obj. 1.04476e+06 iterations 33 Pass 3: (0.60 seconds) suminf. 1.30391 obj. 1.28526e+06 iterations 1350 Pass 4: (0.83 seconds) suminf. 0.06737 obj. 1.53176e+06 iterations 1271 Pass 5: (1.04 seconds) suminf. 0.00060 obj. 1.63055e+06 iterations 1099 Pass 6: (1.06 seconds) suminf. 0.00060 obj. 1.63055e+06 iterations 0 Pass 7: (1.48 seconds) suminf. 0.13433 obj. 7.40341e+06 iterations 2605 Solution found of 7.42156e+06 Before mini branch and bound, 4503 integers at bound fixed and 4734 continuous Full problem 5150 rows 10000 columns, reduced to 304 rows 443 columns Mini branch and bound did not improve solution (2.29 seconds) After 2.29 seconds - Feasibility pump exiting with objective of 1 - took 2.27 seconds Integer solution of 1.64424e+06 found by feasibility pump after 0 iterations and 0 nodes (3.47 seconds) Full problem 5150 rows 10000 columns, reduced to 22 rows 24 columns Integer solution of 1.62393e+06 found by combine solutions after 0 iterations and 0 nodes (5.31 seconds) 281 added rows had average density of 125.769 At root node, 281 cuts changed objective from 965431 to 1.03222e+06 in 20 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 2.740 seconds - new frequency is 10 Cut generator 1 (Gomory) - 24 row cuts (0 active), 0 column cuts in 1.036 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 305 row cuts (27 active), 0 column cuts in 0.304 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.044 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 668 row cuts (182 active), 0 column cuts in 0.180 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 459 row cuts (67 active), 0 column cuts in 0.424 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 63 row cuts (5 active), 0 column cuts in 0.728 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1.62393e+06 best solution, best possible 1.03222e+06 (26.56 seconds) After 100 nodes, 52 on tree, 1.62393e+06 best solution, best possible 1.03417e+06 (426.79 seconds) After 200 nodes, 110 on tree, 1.62393e+06 best solution, best possible 1.03425e+06 (636.38 seconds) After 300 nodes, 165 on tree, 1.62393e+06 best solution, best possible 1.03425e+06 (814.13 seconds) After 400 nodes, 220 on tree, 1.62393e+06 best solution, best possible 1.03425e+06 (922.65 seconds) After 500 nodes, 275 on tree, 1.62393e+06 best solution, best possible 1.03425e+06 (989.25 seconds) After 600 nodes, 330 on tree, 1.62393e+06 best solution, best possible 1.03425e+06 (1021.71 seconds) After 700 nodes, 381 on tree, 1.62393e+06 best solution, best possible 1.03425e+06 (1047.38 seconds) After 800 nodes, 440 on tree, 1.62393e+06 best solution, best possible 1.03425e+06 (1062.62 seconds) After 900 nodes, 503 on tree, 1.62393e+06 best solution, best possible 1.03425e+06 (1079.48 seconds) Cbc0004I Integer solution of 1.52525e+06 found after 208984 iterations and 915 nodes (1083.70 seconds) Cbc0038I Full problem 5150 rows 10000 columns, reduced to 295 rows 396 columns Cbc0038I Full problem 5150 rows 10000 columns, reduced to 22 rows 24 columns Cbc0012I Integer solution of 1.49753e+06 found by combine solutions after 209704 iterations and 917 nodes (1090.85 seconds) Cbc0012I Integer solution of 1.48289e+06 found by combine solutions after 210171 iterations and 921 nodes (1094.24 seconds) Cbc0038I Full problem 5150 rows 10000 columns, reduced to 22 rows 24 columns Cbc0038I Full problem 5150 rows 10000 columns, reduced to 22 rows 24 columns Node limit reached. Have feasible solution. wallclocktime: 3658.38 used seconds: 7151.8 MIP solution: 1482887 (19931 nodes, 7151.8 seconds) Best possible: 1039307.179 Absolute gap: 4.4358e+05 (absolute tolerance optca: 0) Relative gap: 0.4268 (relative tolerance optcr: 0) --- Restarting execution --- n370c.gms(124) 0 Mb --- Reading solution for model m --- n370c.gms(124) 5 Mb *** Status: Normal completion --- Job n370c.gms Stop 07/18/08 11:14:04 elapsed 1:00:58.701