--- Job danoint Start 07/17/08 17:27:40
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
--- danoint.gms(106) 2 Mb
--- GDXin=/home/stefan/work/gams/models/LINlib/danoint.gdx
--- danoint.gms(148) 3 Mb
--- Starting execution: elapsed 0:00:00.013
--- danoint.gms(123) 4 Mb
--- Generating MIP model m
--- danoint.gms(124) 4 Mb
---   665 rows  522 columns  3,234 non-zeroes
---   56 discrete-columns
--- danoint.gms(124) 4 Mb
--- Executing Cbc: elapsed 0:00:00.035

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: 521 columns and 664 rows.
                    56 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 62.6373 - 0.14 seconds
processed model has 600 rows, 457 columns (56 integer) and 3440 elements
Pass   1: suminf.    2.76796 obj. 72 iterations 359
Pass   2: suminf.    1.09240 obj. 73.1701 iterations 100
Pass   3: suminf.    0.03501 obj. 80.5098 iterations 118
Pass   4: suminf.    1.05426 obj. 91.8972 iterations 294
Pass   5: suminf.    1.40081 obj. 97.028 iterations 51
Pass   6: suminf.    0.16094 obj. 99.8925 iterations 217
Pass   7: suminf.    0.58065 obj. 88.6935 iterations 215
Pass   8: suminf.    0.00000 obj. 79 iterations 90
Solution found of 79
Before mini branch and bound, 2 integers at bound fixed and 207 continuous
Full problem 600 rows 457 columns, reduced to 363 rows 245 columns - too large
Mini branch and bound did not improve solution (0.33 seconds)
After 0.33 seconds - Feasibility pump exiting with objective of 2.22045e-16 - took 0.33 seconds
Integer solution of 79 found by feasibility pump after 0 iterations and 0 nodes (0.45 seconds)
Full problem 600 rows 457 columns, reduced to 112 rows 121 columns
56 added rows had average density of 151.071
At root node, 56 cuts changed objective from 62.6373 to 62.6709 in 100 passes
Cut generator 0 (Probing) - 28 row cuts (11 active), 0 column cuts  in 0.668 seconds - new frequency is 1
Cut generator 1 (Gomory) - 180 row cuts (18 active), 0 column cuts  in 0.720 seconds - new frequency is 1
Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts  in 0.120 seconds - new frequency is -100
Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts  in 0.044 seconds - new frequency is -100
Cut generator 4 (MixedIntegerRounding2) - 313 row cuts (14 active), 0 column cuts  in 0.108 seconds - new frequency is -100
Cut generator 5 (FlowCover) - 218 row cuts (12 active), 0 column cuts  in 2.396 seconds - new frequency is 1
Cut generator 6 (TwoMirCuts) - 1 row cuts (1 active), 0 column cuts  in 0.228 seconds - new frequency is -100
After 0 nodes, 1 on tree, 79 best solution, best possible 62.6709 (11.68 seconds)
After 1000 nodes, 73 on tree, 79 best solution, best possible 62.69 (48.20 seconds)
After 2000 nodes, 68 on tree, 79 best solution, best possible 62.69 (63.95 seconds)
Cbc0004I Integer solution of 78 found after 142508 iterations and 2294 nodes (70.50 seconds)
Cbc0038I Full problem 600 rows 457 columns, reduced to 112 rows 121 columns
Cbc0038I Full problem 600 rows 457 columns, reduced to 366 rows 249 columns
Cbc0004I Integer solution of 74.5 found after 148120 iterations and 2354 nodes (73.52 seconds)
Cbc0038I Full problem 600 rows 457 columns, reduced to 322 rows 221 columns
Cbc0012I Integer solution of 69.3333 found by combine solutions after 148263 iterations and 2355 nodes (85.62 seconds)
Cbc0012I Integer solution of 66.25 found by combine solutions after 142939 iterations and 2303 nodes (86.83 seconds)
Cbc0004I Integer solution of 65.6667 found after 1016457 iterations and 10215 nodes (243.60 seconds)
Cbc0038I Full problem 600 rows 457 columns, reduced to 393 rows 273 columns - too large

Node limit reached. Have feasible solution.
wallclocktime:  3657.25 	 used seconds:  7159.41
MIP solution:           65.66666667   (416261 nodes, 7159.41 seconds)
Best possible:          63.89390495
Absolute gap:                1.7728   (absolute tolerance optca: 0)
Relative gap:              0.027745   (relative tolerance optcr: 0)
--- Restarting execution
--- danoint.gms(124) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job danoint.gms Stop 07/17/08 18:28:37 elapsed 1:00:57.326