--- Job ran13x13 Start 07/18/08 15:12:59 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 --- ran13x13.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran13x13.gdx --- ran13x13.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- ran13x13.gms(123) 4 Mb --- Generating MIP model m --- ran13x13.gms(124) 4 Mb --- 196 rows 339 columns 1,015 non-zeroes --- 169 discrete-columns --- Executing Cbc: elapsed 0:00:00.013 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: 338 columns and 195 rows. 169 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 2691.44 - 0.01 seconds processed model has 195 rows, 338 columns (169 integer) and 676 elements Pass 1: suminf. 0.95476 obj. 3004.65 iterations 72 Solution found of 3811 Before mini branch and bound, 146 integers at bound fixed and 145 continuous Full problem 195 rows 338 columns, reduced to 26 rows 30 columns Mini branch and bound improved solution from 3811 to 3494 (0.02 seconds) Round again with cutoff of 3413.74 Pass 2: suminf. 0.95476 obj. 2988.15 iterations 64 Pass 3: suminf. 0.43790 obj. 3413.74 iterations 41 Pass 4: suminf. 0.07692 obj. 3363.08 iterations 24 Pass 5: suminf. 0.30515 obj. 3413.74 iterations 20 Pass 6: suminf. 3.51470 obj. 3413.74 iterations 75 Pass 7: suminf. 2.20761 obj. 3413.74 iterations 38 Pass 8: suminf. 1.58309 obj. 3413.74 iterations 37 Pass 9: suminf. 1.51420 obj. 3413.74 iterations 25 Pass 10: suminf. 2.19016 obj. 3413.74 iterations 40 Pass 11: suminf. 1.91174 obj. 3413.74 iterations 3 Pass 12: suminf. 1.21802 obj. 3413.74 iterations 54 Pass 13: suminf. 0.88558 obj. 3413.74 iterations 17 Pass 14: suminf. 1.06514 obj. 3413.74 iterations 24 Pass 15: suminf. 1.04708 obj. 3413.74 iterations 17 Pass 16: suminf. 1.28559 obj. 3413.74 iterations 32 Pass 17: suminf. 1.19191 obj. 3413.74 iterations 10 Pass 18: suminf. 1.14244 obj. 3413.74 iterations 22 Pass 19: suminf. 0.58183 obj. 3413.74 iterations 25 Pass 20: suminf. 1.05466 obj. 3413.74 iterations 14 Pass 21: suminf. 2.42353 obj. 3413.74 iterations 88 Before mini branch and bound, 118 integers at bound fixed and 119 continuous Full problem 195 rows 338 columns, reduced to 66 rows 91 columns Mini branch and bound did not improve solution (0.14 seconds) After 0.14 seconds - Feasibility pump exiting with objective of 6 - took 0.14 seconds Integer solution of 3811 found by feasibility pump after 0 iterations and 0 nodes (0.14 seconds) Full problem 195 rows 338 columns, reduced to 0 rows 0 columns 37 added rows had average density of 39.5405 At root node, 37 cuts changed objective from 2691.44 to 2987.07 in 17 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.024 seconds - new frequency is 10 Cut generator 1 (Gomory) - 24 row cuts (2 active), 0 column cuts in 0.032 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 41 row cuts (3 active), 0 column cuts in 0.020 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 70 row cuts (20 active), 0 column cuts in -0.000 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 41 row cuts (7 active), 0 column cuts in 0.020 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 30 row cuts (5 active), 0 column cuts in 0.036 seconds - new frequency is -100 After 0 nodes, 1 on tree, 3811 best solution, best possible 2987.07 (0.52 seconds) Cbc0004I Integer solution of 3751 found after 9275 iterations and 346 nodes (4.89 seconds) Cbc0038I Full problem 195 rows 338 columns, reduced to 42 rows 51 columns Cbc0038I Full problem 195 rows 338 columns, reduced to 0 rows 0 columns Cbc0012I Integer solution of 3546 found by combine solutions after 9293 iterations and 348 nodes (6.14 seconds) Cbc0038I Full problem 195 rows 338 columns, reduced to 0 rows 0 columns Cbc0004I Integer solution of 3415 found after 26084 iterations and 1222 nodes (9.12 seconds) Cbc0038I Full problem 195 rows 338 columns, reduced to 0 rows 0 columns Cbc0038I Full problem 195 rows 338 columns, reduced to 57 rows 72 columns Cbc0004I Integer solution of 3341 found after 45561 iterations and 2363 nodes (14.16 seconds) Cbc0038I Full problem 195 rows 338 columns, reduced to 61 rows 78 columns Cbc0038I Full problem 195 rows 338 columns, reduced to 0 rows 0 columns Cbc0038I Full problem 195 rows 338 columns, reduced to 62 rows 80 columns Cbc0038I Full problem 195 rows 338 columns, reduced to 0 rows 0 columns Cbc0038I Full problem 195 rows 338 columns, reduced to 74 rows 100 columns Cbc0038I Full problem 195 rows 338 columns, reduced to 0 rows 0 columns Solved to optimality. wallclocktime: 63.9228 used seconds: 122.23 MIP solution: 3252 (35084 nodes, 122.23 seconds) Best possible: 3252 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran13x13.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran13x13.gms Stop 07/18/08 15:14:03 elapsed 0:01:03.959