--- Job air05 Start 07/17/08 13:05: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 --- air05.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/air05.gdx --- air05.gms(148) 5 Mb --- Starting execution: elapsed 0:00:00.076 --- air05.gms(123) 5 Mb --- Generating MIP model m --- air05.gms(124) 8 Mb --- 427 rows 7,196 columns 59,317 non-zeroes --- 7,195 discrete-columns --- air05.gms(124) 8 Mb --- Executing Cbc: elapsed 0:00:00.217 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: 7195 columns and 426 rows. 7195 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 25877.6 - 1.46 seconds 43 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 752 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 4 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 2 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 349 rows, 6437 columns (6437 integer) and 40552 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 20.60000 obj. 29799.3 iterations 1649 Pass 2: suminf. 4.00000 obj. 30223 iterations 1879 Pass 3: suminf. 4.00000 obj. 30223 iterations 49 Pass 4: suminf. 4.00000 obj. 30223 iterations 821 Pass 5: suminf. 0.00000 obj. 30327 iterations 1353 Solution found of 30327 Before mini branch and bound, 6148 integers at bound fixed and 0 continuous Full problem 349 rows 6437 columns, reduced to 223 rows 266 columns Mini branch and bound improved solution from 30327 to 30175 (3.50 seconds) Round again with cutoff of 29745.3 Pass 6: suminf. 19.40000 obj. 29697.7 iterations 1466 Pass 7: suminf. 3.29424 obj. 29745.3 iterations 1673 Pass 8: suminf. 1.25047 obj. 29745.3 iterations 1545 Pass 9: suminf. 6.25000 obj. 29473.5 iterations 1812 Pass 10: suminf. 5.50000 obj. 29348.5 iterations 543 Pass 11: suminf. 0.00000 obj. 28724 iterations 324 Solution found of 28724 Before mini branch and bound, 6113 integers at bound fixed and 0 continuous Full problem 349 rows 6437 columns, reduced to 226 rows 304 columns Mini branch and bound improved solution from 28724 to 28421 (7.84 seconds) After 7.84 seconds - Feasibility pump exiting with objective of 28421 - took 7.82 seconds Integer solution of 28421 found by feasibility pump after 0 iterations and 0 nodes (7.84 seconds) Full problem 349 rows 6437 columns, reduced to 0 rows 0 columns Full problem 349 rows 6437 columns, reduced to 164 rows 1838 columns Integer solution of 26677 found by greedy equality after 0 iterations and 0 nodes (9.08 seconds) Full problem 349 rows 6437 columns, reduced to 0 rows 0 columns 28 added rows had average density of 6.35714 At root node, 28 cuts changed objective from 25877.6 to 25956.2 in 13 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 1.864 seconds - new frequency is 10 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.296 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.048 seconds - new frequency is -100 Cut generator 3 (Clique) - 145 row cuts (27 active), 0 column cuts in 0.052 seconds - new frequency is 1 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.020 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.024 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts (0 active), 0 column cuts in 0.436 seconds - new frequency is -100 After 0 nodes, 1 on tree, 26677 best solution, best possible 25956.2 (13.37 seconds) After 100 nodes, 18 on tree, 26677 best solution, best possible 26129.5 (60.23 seconds) Cbc0038I Full problem 349 rows 6437 columns, reduced to 0 rows 0 columns Cbc0004I Integer solution of 26427 found after 25129 iterations and 159 nodes (79.31 seconds) Solved to optimality. wallclocktime: 75.8278 used seconds: 133.05 MIP solution: 26374 (412 nodes, 133.05 seconds) Best possible: 26374 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- air05.gms(124) 0 Mb --- Reading solution for model m --- air05.gms(124) 4 Mb *** Status: Normal completion --- Job air05.gms Stop 07/17/08 13:06:21 elapsed 0:01:16.112