--- Job neos6 Start 07/18/08 14:25:41 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 --- neos6.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/neos6.gdx --- neos6.gms(148) 10 Mb --- Starting execution: elapsed 0:00:00.202 --- neos6.gms(123) 10 Mb --- Generating MIP model m --- neos6.gms(124) 19 Mb --- 1,037 rows 8,787 columns 252,170 non-zeroes --- 8,340 discrete-columns --- neos6.gms(124) 18 Mb --- Executing Cbc: elapsed 0:00:00.676 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: 8786 columns and 1036 rows. 8340 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 83 - 0.80 seconds 0 fixed, 223 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 1036 rows, 8563 columns (8340 integer) and 251723 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 8.49975 obj. 103.601 iterations 579 Pass 2: suminf. 7.63776 obj. 104.706 iterations 135 Pass 3: suminf. 5.75556 obj. 107.822 iterations 226 Pass 4: suminf. 4.98825 obj. 107.202 iterations 128 Pass 5: suminf. 7.39222 obj. 105.38 iterations 175 Pass 6: suminf. 4.70370 obj. 110.444 iterations 154 Pass 7: suminf. 3.19192 obj. 110 iterations 119 Pass 8: suminf. 3.09795 obj. 110.158 iterations 39 Pass 9: suminf. 5.85185 obj. 111.966 iterations 264 Pass 10: suminf. 2.36214 obj. 113.457 iterations 272 Pass 11: suminf. 2.26146 obj. 113.646 iterations 54 Pass 12: suminf. 3.13333 obj. 133.467 iterations 287 Pass 13: suminf. 0.38889 obj. 134 iterations 175 Pass 14: suminf. 0.22222 obj. 134.444 iterations 5 Pass 15: suminf. 0.22222 obj. 137.556 iterations 128 Pass 16: suminf. 6.00000 obj. 122.5 iterations 494 Pass 17: suminf. 0.00000 obj. 129 iterations 270 Solution found of 129 Before mini branch and bound, 8171 integers at bound fixed and 127 continuous Full problem 1036 rows 8563 columns, reduced to 308 rows 265 columns Mini branch and bound did not improve solution (4.26 seconds) After 4.26 seconds - Feasibility pump exiting with objective of 1 - took 4.20 seconds Integer solution of 129 found by feasibility pump after 0 iterations and 0 nodes (4.34 seconds) Full problem 1036 rows 8563 columns, reduced to 0 rows 0 columns 3 added rows had average density of 76.3333 At root node, 3 cuts changed objective from 83 to 83 in 3 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 1 column cuts in 0.324 seconds - new frequency is 1 Cut generator 1 (Gomory) - 12 row cuts (1 active), 0 column cuts in 0.088 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.024 seconds - new frequency is -100 Cut generator 3 (Clique) - 96 row cuts (1 active), 0 column cuts in 0.008 seconds - new frequency is 1 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.316 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.048 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 7 row cuts (1 active), 0 column cuts in 0.312 seconds - new frequency is -100 After 0 nodes, 1 on tree, 129 best solution, best possible 83 (8.01 seconds) After 100 nodes, 51 on tree, 129 best solution, best possible 83 (127.97 seconds) After 200 nodes, 106 on tree, 129 best solution, best possible 83 (223.06 seconds) Cbc0038I Full problem 1036 rows 8563 columns, reduced to 357 rows 308 columns Cbc0038I Full problem 1036 rows 8563 columns, reduced to 359 rows 308 columns Cbc0004I Integer solution of 87 found after 311881 iterations and 1886 nodes (807.04 seconds) Cbc0038I Full problem 1036 rows 8563 columns, reduced to 359 rows 308 columns Cbc0038I Full problem 1036 rows 8563 columns, reduced to 388 rows 338 columns Cbc0004I Integer solution of 85 found after 871597 iterations and 7608 nodes (1612.69 seconds) Cbc0038I Full problem 1036 rows 8563 columns, reduced to 359 rows 308 columns Cbc0038I Full problem 1036 rows 8563 columns, reduced to 410 rows 353 columns Cbc0012I Integer solution of 84 found by combine solutions after 871603 iterations and 7609 nodes (1618.46 seconds) Cbc0038I Full problem 1036 rows 8563 columns, reduced to 359 rows 308 columns Cbc0004I Integer solution of 83 found after 1724824 iterations and 17742 nodes (2371.74 seconds) Solved to optimality. wallclocktime: 1306.6 used seconds: 2380.23 MIP solution: 83 (17745 nodes, 2380.24 seconds) Best possible: 83 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- neos6.gms(124) 0 Mb --- Reading solution for model m --- neos6.gms(124) 10 Mb *** Status: Normal completion --- Job neos6.gms Stop 07/18/08 14:47:29 elapsed 0:21:47.422